Related papers: Codes and shifted codes of partitions

We give "hybrid" proofs of the $q$-binomial theorem and other identities. The proofs are "hybrid" in the sense that we use partition arguments to prove a restricted version of the theorem, and then use analytic methods (in the form of the…

We study the combinatorial properties of final types, which are certain non-decreasing sequences of integers, together with the partitions naturally associated with them. As a consequence, we obtain an identity expressing the $n$-nacci…

We study generalizations of the classical Bernstein operators on polynomial spaces, where instead of fixing $\mathbf{1}$ and $x$, we require that $\mathbf{1}$ and a strictly increasing polynomial $f_1$ be fixed. Via several examples, we…

For a root system R, a field K and a "choice of coefficients in K" we define a category of graded spaces with operators and study some of its properties. Then we assume that the coefficients are given by quantum binomials. We use basic…

The partition functions of Pasquier models on the cylinder, and the associated intertwiners, are considered. It is shown that earlier results due to Saleur and Bauer can be rephrased in a geometrical way, reminiscent of formulae found in…

We prove new double summation hypergeometric $q$-series representations for several families of partitions, including those that appear in the famous product identities of G\"ollnitz, Gordon, and Schur. We give several different proofs for…

Bernstein blocks of complex representations of p-adic reductive groups have been computed in a large amount of examples, in part thanks to the theory of types a la Bushnell and Kutzko. The output of these purely representation-theoretic…

In 1984, Bressoud and Subbarao obtained an interesting weighted partition identity for a generalized divisor function, by means of combinatorial arguments. Recently, the last three named authors found an analytic proof of the aforementioned…

We exploit transformations relating generalized $q$-series, infinite products, sums over integer partitions, and continued fractions, to find partition-theoretic formulas to compute the values of constants such as $\pi$, and to connect sums…

Sylvester showed that the partition function can be written as a sum of the polynomial term and quasiperiodic components called the Sylvester waves. Recently an explicit expression of the Sylvester wave as a finite sum over the Bernoulli…

We present a ``method'' for bijective proofs for determinant identities, which is based on translating determinants to Schur functions by the Jacobi--Trudi identity. We illustrate this ``method'' by generalizing a bijective construction…

A classical result of MacMahon states that inversion number and major index have the same distribution over permutations of a given multiset. In this work we prove a strengthening of this theorem originally conjectured by Haglund. Our…

In this paper, we present a generalization of one of the theorems in [G. E. Andrews, Partitions with parts separated by parity, \textit{Annals of Combinatorics} \textbf{23}(2019), 241 - 248], and give its bijective proof. Further variations…

We construct an evidently positive multiple series as a generating function for partitions satisfying the multiplicity condition in Schur's partition theorem. Refinements of the series when parts in the said partitions are classified…

Although symmetry methods and analysis are a necessary ingredient in every physicist's toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the…

In this paper, we study Grothendieck polynomials from a combinatorial viewpoint. We introduce the factorial Grothendieck polynomials, analogues of the factorial Schur functions and present some of their properties, and use them to produce a…

Elementary proofs are given for sums of Schur functions over partitions into at most n parts each less than or equal to m for which i) all parts are even, ii) all parts of the conjugate partition are even. Also, an elementary proof of a…

Using the celebrated Witten-Kontsevich theorem, we prove a recursive formula of the $n$-point functions for intersection numbers on moduli spaces of curves. It has been used to prove the Faber intersection number conjecture and motivated us…

One of the central open problems in both algebraic combinatorics and representation theory is to find a positive combinatorial rule for Kronecker coefficients $ g_{\lambda \, \mu \, \nu}$. A notable advance in this direction is due to…

Set partitions and permutations with restrictions on the size of the blocks and cycles are important combinatorial sequences. Counting these objects lead to the sequences generalizing the classical Stirling and Bell numbers. The main focus…