User:Minimal Counterexample/sandbox

This is the user sandbox of Minimal Counterexample. A user sandbox is a subpage of the user's user page. It serves as a testing spot and page development space for the user and is not an encyclopedia article. Create or edit your own sandbox here.

Other sandboxes: Main sandbox | Template sandbox

Finished writing a draft article? Are you ready to request review of it by an experienced editor for possible inclusion in Wikipedia? Submit your draft for review!

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. They were introduced by Bousquet-M\'elou and Eriksson in 1997.

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.