Related papers: The Refined Lecture Hall Theorem via Abacus Diagra…

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…

We show here that the refined theorems for both lecture hall partitions and anti-lecture hall compositions can be obtained as straightforward consequences of two q-Chu Vandermonde identities, once an appropriate recurrence is derived. We…

In this paper, we give a bijective proof of the reduced lecture hall partition theorem. It is possible to extend this bijection in lecture hall partition theorem. And refined versions of each theorems are also presented.

The Lecture Hall cone is a simplicial cone whose lattice points naturally correspond to Lecture Hall partitions. The celebrated Lecture Hall Theorem of Bousquet-M\'elou and Eriksson states that a particular specialization of its…

In 1997 Bousquet-M\'elou and Eriksson introduced lecture hall partitions as the inversion vectors of elements of the parabolic quotient $\widetilde{C}/C$. We provide a new view of their correspondence that allows results in one domain to be…

For an integer $m\ge 2$, a partition $\lambda=(\lambda_1,\lambda_2,\ldots)$ is called $m$-falling, a notion introduced by Keith, if the least nonnegative residues mod $m$ of $\lambda_i$'s form a nonincreasing sequence. We extend a bijection…

We obtain a unification of two refinements of Euler's partition theorem respectively due to Bessenrodt and Glaisher. A specialization of Bessenrodt's insertion algorithm for a generalization of the Andrews-Olsson partition identity is used…

The s-lecture hall polytopes P_s are a class of integer polytopes defined by Savage and Schuster which are closely related to the lecture hall partitions of Eriksson and Bousquet-M\'elou. We define a half-open parallelopiped Par_s…

In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…

In 1997, Bousquet-Melou and Eriksson initiated the study of lecture hall partitions, a fascinating family of partitions that yield a finite version of Euler's celebrated odd/distinct partition theorem. In subsequent work on s-lecture hall…

We give short elementary expositions of combinatorial proofs of some variants of Euler's partitition problem that were first addressed analytically by George Andrews, and later combinatorially by others. Our methods, based on ideas from a…

In a recent paper, Dousse introduced a refinement of Siladi\'c's theorem on partitions, where parts occur in two primary and three secondary colors. Her proof used the method of weighted words and $q$-difference equations. The purpose of…

Motivated by Andrews' recent work related to Euler's partition theorem, we consider the set of partitions of an integer $n$ where the set of even parts has exactly $j$ elements, versus the set of partitions of $n$ where the set of repeated…

We start with a bijective proof of Schur's theorem due to Alladi and Gordon and describe how a particular iteration of it leads to some very general theorems on colored partitions. These theorems imply a number of important results,…

Regarding Euler's odd-strict theorem, which is the most basic partition identity, A refinement was done by Sylvester, and it was generalized by Bessenrodt to the r-regular and r-class regular cases. In this paper, we focus on the…

Recently the authors introduced lecture hall tableaux in their study of multivariate little $q$-Jacobi polynomials. In this paper, we enumerate bounded lecture hall tableaux. We show that their enumeration is closely related to standard and…

Let $A_k(n)$ denote the set of $k$-distinct partitions of $n$, and let $B_k(n)$ be the set of $k$-regular partitions of $n$. Glaisher showed that $\# A_k(n) = \# B_k(n)$. For $k=2$, this equality yields the celebrated Euler's partition…

The classical version of B\'ezout's Theorem gives an integer-valued count of the intersection points of hypersurfaces in projective space over an algebraically closed field. Using work of Kass and Wickelgren, we prove a version of…

This paper gives a bijective proof of Andrews' refinement of the Alladi-Schur theorem. Moreover, it demonstrates that the bijective framework introduced here can be used to reproduce and provide a bijective account of Andrews' recursive…

Over the past twenty years, lecture hall partitions have emerged as fundamental combinatorial structures, leading to new generalizations and interpretations of classical theorems and new results. In recent years, geometric approaches to…