The refined lecture hall theorem via abacus diagrams
From MaRDI portal
Publication:457008
DOI10.1007/S11139-013-9525-8zbMATH Open1298.05031arXiv1211.3702OpenAlexW2070692971WikidataQ57442352 ScholiaQ57442352MaRDI QIDQ457008FDOQ457008
Authors: Laura Bradford, Meredith Harris, Alex Komarinski, Carly Matson, Edwin O'Shea, Brant C. Jones
Publication date: 26 September 2014
Published in: The Ramanujan Journal (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1211.3702
Recommendations
- On the refined lecture hall theorem
- A refinement of the lecture hall theorem
- The Abel-Ruffini theorem via loops and permutations
- Abacus proofs of Schur function identities
- On Abrams' theorem
- A proof for Theodorus' theorem by drawing diagrams
- scientific article; zbMATH DE number 4090180
- A refinement of the \(abc\) conjecture
- scientific article; zbMATH DE number 4010916
- Rabinowitz's theorems revisited
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cranks and t-cores
- Lecture hall partitions. II
- Lecture hall partitions
- A refinement of the lecture hall theorem
- On the refined lecture hall theorem
- On the combinatorics of lecture hall partitions
- Abacus models for parabolic quotients of affine Weyl groups
- Counting partitions on the abacus
- ON q-SERIES IDENTITIES ARISING FROM LECTURE HALL PARTITIONS
- Title not available (Why is that?)
- Five guidelines for partition analysis with applications to lecture hall-type theorems
- Lecture hall theorems, \(q\)-series and truncated objects
- Euler's partition theorem and the combinatorics of \(\ell \)-sequences
Cited In (7)
- A note on a finite version of Euler's partition identity
- Bull's theorem by the method of diagrams
- The \((k, l)\)-Euler theorem and the combinatorics of \((k, l)\)-sequences
- The mathematics of lecture hall partitions
- A lecture Hall theorem for \(m\)-falling partitions
- Generating Functions and Triangulations for Lecture Hall Cones
- On the refined lecture hall theorem
This page was built for publication: The refined lecture hall theorem via abacus diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q457008)