On the combinatorics of lecture hall partitions (Q1601119): Difference between revisions

A lecture hall partition of length \(n\) is defined to be a partition \(\lambda = (\lambda_1,\lambda_2, \ldots, \lambda_n)\) of a positive integer \(N\) satisfying \(0 \leq \frac{\lambda_1}{1} \leq \frac{\lambda_2}{2} \leq \cdots \leq \frac{\lambda_n}{n}\). Bousquet-Mélou and Eriksson have shown that the number of lecture hall partitions of length \(n\) of a positive integer \(N\) whose alternating sum is \(k\) equals the number of partitions of \(N\) into \(k\) odd parts less than \(2n\). In the paper this theorem is reproved using a natural combinatorial bijection between the two sets of partitions. This bijection, although formulated differently, is essentially the same as one of the bijections found by Bousquet-Mélou and Eriksson.