**Problem of the Week**

**BUGCAT**

**Zassenhaus Conference**

**Hilton Memorial Lecture**

**BingAWM**

**Math Club**

seminars:comb:abstract.200911bec

The study of partitions and compositions (i.e., ordered partitions) of integers goes back centuries and has applications in various areas within and outside of mathematics. Partition analysis is full of beautiful—and sometimes surprising—identities.

As an example (and the first motivation for this study), I mention compositions (λ_{1}, λ_{2}, λ_{3}) of an integer m (i.e., m = λ_{1} + λ_{2} + λ_{3} and all λ_{j} in **Z**_{≥0}) that satisfy the six “triangle conditions”

λ_{π(1)} + λ_{π(2)} ≥ λ_{π(3)}

for every permutation π in S_{3} . George Andrews proved in the 1970's that the number Δ(m) of such compositions of m is encoded by the generating function

Σ_{m ≥ 0} Δ(m) q^{m} = 1/(1-q^{2})^{2}(1-q) .

More generally, for fixed given integers a_{1}, a_{2}, …, a_{n}, we call a composition λ_{1} + λ_{2} + … + λ_{n} *symmetrically constrained* if it satisfies each of the the n! constraints

Σ_{j=1}^{n} a_{j} λ_{π(j)} ≥ 0

for every permutation π in S_{n} . I will show how to compute the generating functions of these compositions, combining methods from partition theory, permutation statistics, and polyhedral geometry.

This is joint work with Ira Gessel, Sunyoung Lee, and Carla Savage.

seminars/comb/abstract.200911bec.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