Related papers: Demystifying a divisibility property of the Kostan…
We prove an identity about partitions, previously conjectured in the study of shifted Jack polynomials (math.CO/9903020). The proof given is using $\lambda$-ring techniques. It would be interesting to obtain a bijective proof.
In this note, we present a curious $q$-series identity with applications to certain partitions with bounded part differences.
In this paper, we use the Lambert series generating function for Euler's totient function to introduce a new identity for the number of $1$'s in the partitions of $n$. A new expansion for Euler's partition function $p(n)$ is derived in this…
We prove an identity about partitions with a very elementary formulation. We had previously conjectured this identity, encountered in the study of shifted Jack polynomials (math.CO/9901040). The proof given is using a trivariate generating…
The theory of partition congruences has been a fascinating and difficult subject for over a century now. In attempting to prove a given congruence family, multiple possible complications include the genus of the underlying modular curve,…
We find a close correspondence between certain partition functions of ideal quantum gases and certain symmetric polynomials. Due to this correspondence it can be shown that a number of thermodynamic identities which have recently been…
We translate Uchimura's identity for the divisor function and whose generalizations into combinatorics of partitions, and give a combinatorial proof of them. As a by-product of their proofs, we obtain some combinatorial results.
The partition functions $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, and $Q(n,m,p)$, the number of integer partitons of $n$ into exactly $m$ distinct parts with each part at most…
The G\"ollnitz-Gordon-Andrews identities generalize the partition identities discovered independently by H. G\"ollnitz and B. Gordon. In this article, we present a commutative algebra proof of the G\"ollnitz-Gordon-Andrews identities. More…
We investigate infinite versions of vector and affine space partition results, and thus obtain examples and a counterexample for a partition problem for relational structures. In particular we provide two (related) examples of an age…
We define a class of expressions for the multiple zeta function, and show how to determine whether an expression in the class vanishes identically. The class of such identities, which we call partition identities, is shown to coincide with…
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 present a new partition identity and give a combinatorial proof of our result. This generalizes a result of Andrew's in which he considers the generation function for partitions with respect to size, number of odd parts, and number of…
This paper gives an exposition of well known results on vector partition functions. The exposition is based on works of M. Brion, A. Szenes and M. Vergne and is geared toward explicit computer realizations. In particular, the paper presents…
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…
In his paper, "On a Partition Function of Richard Stanley," George Andrews proves a certain partition identity analytically and asks for a combinatorial proof. This paper provides the requested combinatorial proof.
Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of…
In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…
We apply some recent developments of Baldoni-Beck-Cochet-Vergne on vector partition function, to Kostant's and Steinberg's formulae, for classical Lie algebras $A\_r$, $B\_r$, $C\_r$, $D\_r$. We therefore get efficient {\tt Maple} programs…
The partition function $p(n)$, which counts the number of partitions of a positive integer $n$, is widely studied. Here, we study partition functions $p_S(n)$ that count partitions of $n$ into distinct parts satisfying certain congruence…