Related papers: Une identit\'e en th\'eorie des partitions

A combinatorial identity that was needed in Ahlgren and Ono's proof of a certain congruence conjecture of Frits Beukers is stated, and a pointer to its WZ proof is given.

In this paper, we give a short proof of a relation generalizing many identities for Bernoulli numbers.

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…

In a previous paper of the second author with K. Ono, surprising multiplicative properties of the partition function were presented. Here, we deal with $k$-regular partitions. Extending the generating function for $k$-regular partitions…

The classic Cayley identity states that \det(\partial) (\det X)^s = s(s+1)...(s+n-1) (\det X)^{s-1} where X=(x_{ij}) is an n-by-n matrix of indeterminates and \partial=(\partial/\partial x_{ij}) is the corresponding matrix of partial…

We present a dual of a family of partition identities of Andrews involving partitions with no repeated odd parts (among other conditions), along with an overpartition generalization that encapsulates both families. These were discovered…

Dumont has conjectured a marvellous identity, which generalizes, in particular, the classical results of Lagrange, Gauss, Jacobi and Kronecker on the sums of two, three and four squares. We give a combinatorial proof of Dumont's conjecture.

We define a generalized vector partition function and derive an identity for generating series of such functions associated with solutions of basic recurrence relation of combinatorial analysis. As a consequence, we obtain the generating…

In "Square partitions and Catalan numbers" (arXiv0912.4983), Bennett et al. presented a recursive algorithm to create a family of partitions from one or several partitions. They were mainly interested in the cases when we begin with a…

An approximate formula for the partitions of Goldbach's Conjecture is derived using Prime Number Theorem and a heuristic probabilistic approach. A strong form of Goldbach's conjecture follows in the form of a lower bounding function for the…

We describe a method, based on the theory of Macdonald-Koornwinder polynomials, for proving bounded Littlewood identities. Our approach provides an alternative to Macdonald's partial fraction technique and results in the first examples of…

Some applications of a result, which is proved recently, is considered. We first prove three determinantal identities concerning the binomial coefficient and Stirling numbers of the first and the second kind. We also easily obtain the…

The aim of this paper is to prove all well-known metrization theorems using partitions of unity. To accomplish this, we first discuss sufficient and necessary conditions for existence of $\mathcal{U}$-small partitions of unity (partitions…

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…

MacMahon showed that the generating function for partitions into at most $k$ parts can be decomposed into a partial fractions-type sum indexed by the partitions of $k$. In this present work, a generalization of MacMahon's result is given,…

In this note, we show how a combinatorial identity of Frisch can be applied to prove and generalize some well-known identities involving harmonic numbers. We also present some combinatorial identities involving odd harmonic numbers which…

We give a bijection between certain colored partitions and the elements in the quotient of an affine Weyl group modulo its Weyl group. By Bott's formula these colored partitions give rise to some partition identities. In certain types,…

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…

Refined versions, analytic and combinatorial, are given for classical integer partition theorems. The examples include the Rogers-Ramanujan identities, the Gollnitz-Gordon identities, Euler's odd=distinct theorem, and the Andrews-Gordon…

Using sequences of finite length with positive integer elements and the inversion statistic on such sequences, a collection of binomial and multinomial identities are extended to their $q$-analog form via combinatorial proofs. Using the…