Related papers: Bijections between t-Core Partitions and t-Tuples

In this paper, we propose an $(s+d,d)$-abacus for $(s,s+d,\dots,s+pd)$-core partitions and establish a bijection between the $(s,s+d,\dots,s+pd)$-core partitions and the rational Motzkin paths of type $(s+d,-d)$. This result not only gives…

Let \pi be a partition. In [2] we defined BG-rank(\pi) as an alternating sum of parities of parts. This statistic was employed to generalize and refine the famous Ramanujan modulo 5 partition congruence. Let p_j(n)(a_{t,j}(n)) denote a…

We construct a direct natural bijection between descending plane partitions without any special part and permutations. The directness is in the sense that the bijection avoids any reference to nonintersecting lattice paths. The advantage of…

This paper introduced a way of fractal to solve the problem of taking count of the integer partitions, furthermore, using the method in this paper some recurrence equations concerning the integer partitions can be deduced, including the…

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…

In this note we introduce several instructive examples of bijections found between several different combinatorially defined sequences of sets. Each sequence has cardinalities given by the Catalan numbers. Our results answer some questions…

In this article, we introduce the notion of almost consecutive partitions. A partition is almost consecutive if every term is consecutive, with the possible exception of the smallest one. We find formulas relating to the smallest parts of…

Let $p_2(n)$ denote the number of cubic partitions. In this paper, we shall present two new congruences modulo $11$ for $p_2(n)$. We also provide an elementary alternative proof of a congruence established by Chan. Furthermore, we will…

We study a natural generalization of the notion of cores for l-partitions attached with a multi-charge s $\in$ Z^l : the (e, s)-cores. We rely them both to the combinatorics and the notion of weight defined by Fayers. Next we study…

We study the enumeration of set partitions, according to their length, number of parts, cyclic type, and genus. We introduce genus-dependent Bell, Stirling numbers, and Fa\`a di Bruno coefficients. Besides attempting to summarize what is…

The aim of this paper is twofold. First, we study the number of partitions of a positive integer $m$ into at most $n$ parts in a given set $A$. We prove that such a number is bounded by the $n$-th Fibonacci number $F(n)$ for any $m$ and…

We say two posets are "doppelg\"angers" if they have the same number of $P$-partitions of each height $k$. We give a uniform framework for bijective proofs that posets are doppelg\"angers by synthesizing $K$-theoretic Schubert calculus…

The celebrated Rogers-Ramanujan identities equate the number of integer partitions of $n$ ($n\in\mathbb N_0$) with parts congruent to $\pm 1 \pmod{5}$ (respectively $\pm 2 \pmod{5}$) and the number of partitions of $n$ with super-distinct…

We give a series of recursive identities for the number of partitions with exactly $k$ parts and with constraints on both the minimal difference among the parts and the minimal part. Using these results we demonstrate that the number of…

We present some Euler-type recurrences for the partition function $p(n)$.

We present a direct bijection between descending plane partitions with no special parts and permutation matrices. This bijection has the desirable property that the number of parts of the descending plane partition corresponds to the…

We present a bijection between permutation matrices and descending plane partitions without special parts, which respects the quadruple of statistics considered by Behrend, Di Francesco and Zinn--Justin. This bijection involves the…

We study the enumeration problem of higher dimensional partitions, a natural generalisation of classical integer partitions. We show that their counting problem is equivalent to the enumeration of simpler classes of higher dimensional…

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 show that the number of partitions of n with alternating sum k such that the multiplicity of each part is bounded by 2m+1 equals the number of partitions of n with k odd parts such that the multiplicity of each even part is bounded by m.…