The Refined Lecture Hall Theorem via Abacus Diagrams
Combinatorics
2013-10-01 v2
Abstract
Bousquet-M\'elou & Eriksson's lecture hall theorem generalizes Euler's celebrated distinct-odd partition theorem. We present an elementary and transparent proof of a refined version of the lecture hall theorem using a simple bijection involving abacus diagrams.
Keywords
Cite
@article{arxiv.1211.3702,
title = {The Refined Lecture Hall Theorem via Abacus Diagrams},
author = {Laura Bradford and Meredith Harris and Brant Jones and Alex Komarinski and Carly Matson and Edwin O'Shea},
journal= {arXiv preprint arXiv:1211.3702},
year = {2013}
}
Comments
11 pages; to appear in The Ramanujan Journal