The \((k, l)\)-Euler theorem and the combinatorics of \((k, l)\)-sequences
From MaRDI portal
Publication:2136207
DOI10.1016/j.ejc.2022.103524zbMath1487.05028arXiv2106.08057OpenAlexW4221106000WikidataQ113875489 ScholiaQ113875489MaRDI QIDQ2136207
Publication date: 10 May 2022
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.08057
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)
Cites Work
- Lecture hall theorems, \(q\)-series and truncated objects
- The mathematics of lecture hall partitions
- Enumeration of sequences constrained by the ratio of consecutive parts
- Euler's partition theorem and the combinatorics of \(\ell \)-sequences
- Lecture hall partitions. II
- Lecture hall partitions
- A generalization of Sylvester's identity
- On the combinatorics of lecture hall partitions
- Anti-lecture hall compositions and Andrews' generalization of the Watson-Whipple transformation
- The \(q\)-variations of Sylvester's bijection between odd and strict partitions
- On generalizations of Euler's partition theorem
- Lecture Hall Sequences, q-Series, and Asymmetric Partition Identities
- Systems of Numeration
This page was built for publication: The \((k, l)\)-Euler theorem and the combinatorics of \((k, l)\)-sequences