Add to ORKGWe show that cylindric partitions are in one-to-one correspondence with a pair which has an ordinary partition and a colored partition into distinct parts. Then, we show the general form of the generating function for cylindric partitions into distinct parts and give some examples. We prove part of a conjecture by Corteel, Dousse, and Uncu. The approaches and proofs are elementary and combinatorial.Comment: Second version. Many inaccuracies are corrected thanks to Ole Warnaar. 44 pages, 50+ figure
In this paper we give combinatorial proofs for two partition identities. The first one solves a rece...
AbstractIn his memoir in 1984, George E. Andrews introduces many general classes of Frobenius partit...
In this paper a new category of partitions called beaded partitions with k colors will be introduced...
In this paper, cylindric partitions into profiles c = (1, 1) and c = (2, 0) are con-sidered. The gen...
Cylindric partitions into profiles $c=(1,1)$ and $c=(2,0)$ are considered. The generating functions ...
Cylindric plane partitions may be thought of as a natural generalization of reverse plane partitions...
This thesis is divided into three parts. The first part deals with cylindric plane partitions. The s...
AbstractA simple combinatorial argument, based upon the graphic representation of partitions, leads ...
summary:We provide combinatorial interpretations for three new classes of partitions, the so-called ...
AbstractWe start with a bijective proof of Schur’s theorem due to Alladi and Gordon and describe how...
AbstractWe verify a recent conjecture of Kenyon/Szendrői by computing the generating function for py...
The partition perimeter is a statistic defined to be one less than the sum of the number of parts an...
Recently Corteel and Welsh outlined a technique for finding new sum-product identities by using func...
In this paper we introduce and develop the circle embedding method. This method hinges essentially o...
AbstractPartitions in which we use d(a) copies of each part a are studied. The results obtained here...
In this paper we give combinatorial proofs for two partition identities. The first one solves a rece...
AbstractIn his memoir in 1984, George E. Andrews introduces many general classes of Frobenius partit...
In this paper a new category of partitions called beaded partitions with k colors will be introduced...
In this paper, cylindric partitions into profiles c = (1, 1) and c = (2, 0) are con-sidered. The gen...
Cylindric partitions into profiles $c=(1,1)$ and $c=(2,0)$ are considered. The generating functions ...
Cylindric plane partitions may be thought of as a natural generalization of reverse plane partitions...
This thesis is divided into three parts. The first part deals with cylindric plane partitions. The s...
AbstractA simple combinatorial argument, based upon the graphic representation of partitions, leads ...
summary:We provide combinatorial interpretations for three new classes of partitions, the so-called ...
AbstractWe start with a bijective proof of Schur’s theorem due to Alladi and Gordon and describe how...
AbstractWe verify a recent conjecture of Kenyon/Szendrői by computing the generating function for py...
The partition perimeter is a statistic defined to be one less than the sum of the number of parts an...
Recently Corteel and Welsh outlined a technique for finding new sum-product identities by using func...
In this paper we introduce and develop the circle embedding method. This method hinges essentially o...
AbstractPartitions in which we use d(a) copies of each part a are studied. The results obtained here...
In this paper we give combinatorial proofs for two partition identities. The first one solves a rece...
AbstractIn his memoir in 1984, George E. Andrews introduces many general classes of Frobenius partit...
In this paper a new category of partitions called beaded partitions with k colors will be introduced...