On the refined lecture hall theorem

Research output: Contribution to journalArticlepeer-review

9 Scopus citations


A lecture hall partition of length n is a sequence (λ1,lambda;2,..,λn of nonnegative integers satisfying 0 ≤ λ1/1 ≤ ⋯≤λn/n. ousquet-Mélou and K. Eriksson showed that there is an one to one correspondence between the set of all lecture hall partitions of length n and the set of all partitions with distinct parts between 1 and n, and possibly multiple parts between n + 1 and In. In this paper, we construct a bijection which is an identity mapping in the limiting case.

Original languageEnglish (US)
Pages (from-to)293-298
Number of pages6
JournalDiscrete Mathematics
Issue number1-3
StatePublished - Apr 6 2002

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'On the refined lecture hall theorem'. Together they form a unique fingerprint.

Cite this