Related papers: Odd number and Trapezoidal number

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…

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…

For each positive integer $n$, we construct a bijection between the odd partitions and the distinct partitions of $n$ which extends Bressoud's bijection between the odd-and-distinct partitions of $n$ and the splitting partitions of $n$. We…

A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is…

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…

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…

A partition of a positive integer $n$ is a representation of $n$ as a sum of a finite number of positive integers (called parts). A trapezoidal number is a positive integer that has a partition whose parts are a decreasing sequence of…

We introduce in this section an Algebraic and Combinatorial approach to the theory of Numbers. The approach rests on the observation that numbers can be identified with familiar combinatorial objects namely rooted trees, which we shall here…

We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…

Consider the representation of a rational number as a continued fraction, associated with "odd" Euclidean algorithm. In this paper we prove certain properties for the limit distribution function for sequences of rationals with bounded sum…

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 present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev…

In this paper, we prove the conjecture that if there is an odd perfect number, then there are infinitely many of them.

Let G be any additive abelian group with cyclic torsion subgroup, and let A, B and C be finite subsets of G with cardinality n>0. We show that there is a numbering {a_i}_{i=1}^n of the elements of A, a numbering {b_i}_{i=1}^n of the…

We construct weight-preserving bijections between column strict shifted plane partitions with one row and alternating sign trapezoids with exactly one column in the left half that sums to $1$. Amongst other things, they relate the number of…

Lecture hall partitions are a fundamental combinatorial structure which have been studied extensively over the past two decades. These objects have produced new results, as well as reinterpretations and generalizations of classicial…

Motivated by the universal obstruction to the deformation quantization of Poisson structures in infinite dimensions we introduce the notion of quantizable odd Lie bialgebra. The main result of the paper is a construction of a highly…

A theorem of Andrews equates partitions in which no part is repeated more than 2k-1 times to partitions in which, if j appears at least k times, all parts less than j also do so. This paper proves the theorem bijectively, with some of the…

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…

In this paper we present new, short and elementary proofs of the famous projection and section theorems that are used in Stochastic Calculus.