**Problem of the Week**

**Math Club**

**BUGCAT**

**Zassenhaus Conference**

**Hilton Memorial Lecture**

**BingAWM**

You are here: Homepage » Seminars » Combinatorics Seminar » Bruce Sagan (Michigan State and Rutgers)

seminars:comb:abstract.200603sagc

A *composition* of the nonnegative integer n is a way of writing n as an ordered sum of positive integers. So, the compositions of 3 are 1+1+1, 1+2, 2+1, and 3 itself. It is well known (and easy to prove) that if c_{n} is the number of compositions of n then c_{n} = 2n-1 for n at least 1, and c_{0} = 1. Equivalently, we have the generating function

Sum_{n≥0} c_{n} x^{n} = (1-x)/(1-2x),

which is a rational function. We show that this is a special case of a more general family of rational functions associated with compositions. Our techniques include the use of formal languages. Surprisingly, identities from the theory of hypergeometric series are needed to do some of the computations.

This is joint work with Anders Björner.

seminars/comb/abstract.200603sagc.txt · Last modified: 2020/01/29 14:03 (external edit)

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported