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

Anderson established a connection between core partitions and order ideals of certain posets by mapping a partition to its $\beta$-set. In this paper, we give a characterization of the poset $P_{(s,s+1,s+2)}$ whose order ideals correspond…

It has recently been observed empirically that the number of FPL configurations with 3 sets of a, b and c nested arches equals the number of plane partitions in a box of size a x b x c. In this note, this result is proved by constructing…

In this article, we first investigate the partitions whose parts are congruent to $a$ or $b$ modulo $k$ with the aid of separable integer partition classes with modulus $k$ introduced by Andrews. Then, we introduce the…

If $s$ and $t$ are relatively prime J. Olsson proved in 2008 that the $s$-core of a $t$-core partition is again a $t$-core partition, and that the $s$-bar-core of a $t$-bar-core partition is again a $t$-bar-core partition. Here generalized…

Let r_j(\pi,s) denote the number of cells, colored j, in the s-residue diagram of partition \pi. The GBG-rank of \pi mod s is defined as r_0+r_1*w_s+r_2*w_s^2+...+r_(s-1)*w_s^(s-1), where w_s=exp(2*\Pi*I/s). We will prove that for (s,t)=1,…

We find the number of partitions of $n$ whose BG-rank is $j$, in terms of $pp(n)$, the number of pairs of partitions whose total number of cells is $n$, giving both bijective and generating function proofs. Next we find congruences mod 5…

In 1997, Bousquet-M\'elou and Eriksson stated a broad generalization of Euler's distinct-odd partition theorem, namely the $(k,l)$-Euler theorem. Their identity involved the $(k,l)$-lecture-hall partitions, which, unlike usual difference…

Let $A_{3}(n)$ (resp. ${{B}_{3}}(n)$) denote the number of partition pairs (resp. triples) of $n$ where each partition is 3-core. By applying Ramanujan's ${}_{1}\psi_{1}$ formula and Bailey's ${}_{6}\psi_{6}$ formula, we find the explicit…

I present a bijection on integer partitions that leads to recursive expressions, closed formulae and generating functions for the cardinality of certain sets of partitions of a positive integer $n$. The bijection leads also to a product on…

We prove various inequalities between the number of partitions with the bound on the largest part and some restrictions on occurrences of parts. We explore many interesting consequences of these partition inequalities. In particular, we…

We study generating functions which count the sizes of $t$-cores of partitions, and, more generally, the sizes of higher rows in $t$-core towers. We then use these results to derive an asymptotic for the average size of the $t$-defect of…

Inspired by Armin Straub's conjecture (arXiv:1601.07161) about the number and maximal size of (2n+1, 2n+3)-core partitions with distinct parts, we develop relatively efficient, symbolic-computational algorithms, based on non-linear…

For fixed s, the size of an (s, s+1)-core partition with distinct parts can be seen as a random variable X_s. Using computer-assisted methods, we derive formulas for the expectation, variance, and higher moments of X_s. Our results give…

We show that, in many cases, there are infinitely many sets of partitions corresponding to a single analytical Rogers-Ramanujan type identity. This means that a single analytical Rogers-Ramanujan type identity implies the existence of…

We classify the connection between $t$-cores and self-conjugate $t$-cores to sums of squares. To do so, we provide explicit maps between $t$-core partitions and self-conjugate $t$-core partitions of a positive integer $n$ to representations…

Recent results by Andrews and Merca on the number of even parts in all partitions of n into distinct parts, a(n), were derived via generating functions. This paper extends these results to the number of parts divisible by k in all the…

We unify and extend previous bijections on plane quadrangulations to bipartite and quasibipartite plane maps. Starting from a bipartite plane map with a distinguished edge and two distinguished corners (in the same face or in two different…

We present a simple bijection between permutation matrices and descending plane partitions without special parts. This bijection is already mentioned in work of P. Lalonde (without giving the details); it involves the inversion words of…

The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…

A bijection is defined from Littlewood-Richardson tableaux to rigged configurations. It is shown that this map preserves the appropriate statistics, thereby proving a quasi-particle expression for the generalized Kostka polynomials, which…