Jump to content

User:Minimal Counterexample/sandbox

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Minimal Counterexample (talk | contribs) at 01:57, 18 May 2018 (Definitions). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Lecture hall partition

In number theory and combinatorics, a lecture hall partition is a partition that satisfies additional constraints on its parts. Informally, a lecture hall partition is an arrangement of rows in a tiered lecture hall, with the condition that students on any row can see over the heads of the students in front of them. Bousquet-M\'elou and Eriksson introduced them in 1997.

Definitions

The lecture hall partitions are defined by

where λi refers to the i-th component of λ. A lecture hall partition of N is any such that where

The s-lecture hall partitions, denoted are a generalization of Given a sequence the s-lecture hall partitions are defined by

A partition, strictly speaking, disregards the order of the parts λi. However, given an s-lecture hall partition λ of N, there may be a permutation of λ that is also an s-lecture hall partition of N. In this case, λ is called a composition of N. If s is non-decreasing, then λ is always a partition.

The lecture hall theorem

The lecture hall theorem states that the number of lecture hall partitions of N in is equal to the number of partitions of N into odd parts less than 2n. Euler's partition theorem, for comparison, equates the number of partitions with odd parts to the number of partitions with distinct parts. Therefore, in the limit , the number of lecture hall partitions of N in equals the number of partitions of N with distinct parts.

The (k, l) lecture hall theorem

Polynomic sequences

References

Mireille Bousquet-M\'elou and Kimmo Eriksson. Lecture hall partitions. Ramanujan J., 1(1):101–111, 1997.