Related papers: Une identit\'e remarquable en th\'eorie des partit…

Some conjectures on partition hook lengths, recently stated by the author, have been proved and generalized by Stanley, who also needed a formula by Andrews, Goulden and Jackson on symmetric functions to complete his derivation. Another…

Recently, Andrews and El Bachraoui considered the number of integer partitions whose smallest part is repeated exactly $k$ times and the remaining parts are not repeated. They presented several interesting results and posed questions…

We provide a bijective map from the partitions enumerated by the series side of the Rogers-Selberg mod 7 identities onto partitions associated with a special case of Basil Gordon's combinatorial generalization of the Rogers-Ramanujan…

We present a simple iteration for the Lebesgue identity on partitions, which leads to a refinement involving the alternating sums of partitions.

In a recent work, Maciej Do\l{}e\k{}ga and the author have given a formula of the expansion of the Jack polynomial $J^{(\alpha)}_\lambda$ in the power-sum basis as a non-orientability generating series of bipartite maps whose edges are…

A well-known and fundamental property of the Macdonald polynomials $P_\lambda(x;q,t)$ is their invariance under the transformation sending $(q,t)$ to $(q^{-1},t^{-1})$. Recently, Concha and Lapointe showed that this property extends in an…

We prove a new polynomial refinement of the Capparelli's identities. Using a special case of Bailey's lemma we prove many infinite families of sum-product identities that root from our finite analogues of Capparelli's identities. We also…

We prove an interesting identity for the sum of determinants, which is a generalization of the sum of a geometric progression. The proof is quite long and a number of other identities are proved along the way. Some of the more elementary…

We present a positivity conjecture for the coefficients of the development of Jack polynomials in terms of power sums. This extends Stanley's ex-conjecture about normalized characters of the symmetric group. We prove this conjecture for…

Based on Jensen formulae and the second kind of Chebyshev polynomials, another proof is presented for an extension of a curious binomial identity due to Z. W. Sun and K. J. Wu.

Motivated by a polynomial identity of certain iterated integrals, first observed in [CGM20] in the setting of lattice paths, we prove an intriguing combinatorial identity in the shuffle algebra. It has a close connection to de Bruijn's…

In this paper we give an analytic proof of the identity $A_{5,3,3}(n) =B^0_{5,3,3}(n)$, where $A_{5,3,3}(n)$ counts the number of partitions of $n$ subject to certain restrictions on their parts, and $B^0_{5,3,3}(n)$ counts the number of…

We provide a general and unified combinatorial framework for a number of colored partition identities, which include the five, recently proved analytically by B. Berndt, that correspond to the exceptional modular equations of prime degree…

We examine an identity originally stated in Ramanujan's ``lost notebook'' and first proven algebraically by Andrews and combinatorially by Kim. We give two independent combinatorial proofs and interpretations of this identity, which also…

We study cylindric partitions with two-element profiles using MacMahon's partition analysis. We find explicit formulas for the generating functions of the number of cylindric partitions by first finding the recurrences using partition…

We present what we call a "motivated proof" of the Bressoud-G\"ollnitz-Gordon partition identities. Similar "motivated proofs" have been given by Andrews and Baxter for the Rogers-Ramanujan identities and by Lepowsky and Zhu for Gordon's…

In the first part of this article, we consider a Groebner basis of the differential ideal {x_1^2} with respect to "the" weighted lexicographical monomial order and show that its computation is related with an identity involving the…

A $\lambda$-calculus is introduced in which all programs can be evaluated in probabilistic polynomial time and in which there is sufficient structure to represent sequential cryptographic constructions and adversaries for them, even when…

A partition of degree $n$ is a decomposition $n=i_1+i_2+\dots+i_q$, where ${i_1,i_2,\dots,i_q}$ are positive integers called the parts of the partition. Let $\lambda>0$ be an integer. The partition is said to be a $\lambda$--partition if…

Recently the second named author discovered a combinatorial identity in the context of vertex representations of quantum Kac-Moody algebras. We give a direct and elementary proof of this identity. Our method is to show a related identity of…