Multiple partitions, lattice paths and a Burge-Bressoud-type correspondence

Details Multiple partitions, lattice paths and a Burge-Bressoud-type correspondence Multiple partitions, lattice paths and a Burge-Bressoud-type correspondence

2006-08-31

arxiv.org/abs/math/0609001v2

Mathematics

Combinatorics

12 pages; minor corrections, version to appear in Discrete Math

Scientific paper

A bijection is presented between (1): partitions with conditions $f_j+f_{j+1}\leq k-1$ and $ f_1\leq i-1$, where $f_j$ is the frequency of the part $j$ in the partition, and (2): sets of $k-1$ ordered partitions $(n^{(1)}, n^{(2)}, ..., n^{(k-1)})$ such that $n^{(j)}_\ell \geq n^{(j)}_{\ell+1} + 2j$ and $ n^{(j)}_{m_j} \geq j+ {\rm max} (j-i+1,0)+ 2j (m_{j+1}+... + m_{k-1})$, where $m_j$ is the number of parts in $n^{(j)}$. This bijection entails an elementary and constructive proof of the Andrews multiple-sum enumerating partitions with frequency conditions. A very natural relation between the $k-1$ ordered partitions and restricted paths is also presented, which reveals our bijection to be a modification of Bressoud's version of the Burge correspondence.

Affiliated with

Also associated with

No associations

Rating

Multiple partitions, lattice paths and a Burge-Bressoud-type correspondence does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multiple partitions, lattice paths and a Burge-Bressoud-type correspondence, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiple partitions, lattice paths and a Burge-Bressoud-type correspondence will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-492513