Pith. sign in

REVIEW 1 cited by

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2106.08057 v2 pith:DMDW2TRL submitted 2021-06-15 math.CO math.NT

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

classification math.CO math.NT
keywords bijectioneulertheoremcasepartitionsrecursivesuggestedbijections
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original 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,l\geq 2$. 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,l\geq 2$ but also for the cases $(k,1)$ and $(1,k)$ with $k\geq 4$. 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions

    cs.LG 2026-06 unverdicted novelty 5.0

    A new classifier derived from determinism and statistical consistency requirements achieves zero consistency error by construction and outperforms baselines on Adult, COMPAS, and Bank Marketing datasets.