The (k, l)-Euler theorem and the combinatorics of (k, l)-sequences

DOI10.1016/J.EJC.2022.103524zbMATH Open1487.05028arXiv2106.08057OpenAlexW4221106000WikidataQ113875489 ScholiaQ113875489MaRDI QIDQ2136207FDOQ2136207

Isaac Konan

Publication date: 10 May 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: In 1997, Bousquet-M'elou and Eriksson stated a broad generalization of Euler's distinct-odd partition theorem, namely the $(k,l)$-Euler theorem. Their identity involved the $(k,l)$-lecture-hall partitions, which, unlike usual difference conditions of partitions in Rogers-Ramanujan type identities, satisfy some ratio constraints. In a 2008 paper, in response to a question suggested by Richard Stanley, Savage and Yee provided a simple bijection for the $l$-lecture-hall partitions (the case $k=l$), whose specialization in $l=2$ corresponds to Sylvester's bijection. Subsequently, as an open question, a generalization of their bijection was suggested for the case $k,lgeq2$. In the spirit of Savage and Yee's work, we provide and prove in this paper slight variations of the suggested bijection, not only for the case $k,lgeq2$ but also for the cases $(k,1)$ and $(1,k)$ with $kgeq4$. Furthermore, we show that our bijections equal the recursive bijections given by Bousquet-M'elou and Eriksson in their recursive proof of the $(k,l)$-lecture hall and finally provide the analogous recursive bijection for the $(k,l)$-Euler theorem.

Full work available at URL: https://arxiv.org/abs/2106.08057

Recommendations

• Euler's partition theorem and the combinatorics of \(\ell \)-sequences
• The refined lecture hall theorem via abacus diagrams
• A bijection for Euler's partition theorem in the spirit of Bressoud
• The \(q\)-variations of Sylvester's bijection between odd and strict partitions
• On certain partition bijections related to Euler's partition problem

zbMATH Keywords

Rogers-Ramanujan type identities\((k, l)\)-lecture-hall partitions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Cites Work

• Systems of Numeration
• Lecture hall partitions. II
• Lecture hall partitions
• Enumeration of sequences constrained by the ratio of consecutive parts
• A generalization of Sylvester's identity
• On the combinatorics of lecture hall partitions
• Lecture hall theorems, \(q\)-series and truncated objects
• Euler's partition theorem and the combinatorics of \(\ell \)-sequences
• Lecture Hall Sequences, q-Series, and Asymmetric Partition Identities
• The \(q\)-variations of Sylvester's bijection between odd and strict partitions
• On generalizations of Euler's partition theorem
• Anti-lecture hall compositions and Andrews' generalization of the Watson-Whipple transformation
• The mathematics of lecture hall partitions

Cited In (2)

• \(1/k\)-Eulerian polynomials and \(k\)-inversion sequences
• Euler's partition theorem and the combinatorics of \(\ell \)-sequences

This page was built for publication: The \((k, l)\)-Euler theorem and the combinatorics of \((k, l)\)-sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2136207)