Related papers: Sizes of Simultaneous Core Partitions
We study two types of probability measures on the set of integer partitions of $n$ with at most $m$ parts. The first one chooses the random partition with a chance related to its largest part only. We then obtain the limiting distributions…
In this article, we study hook lengths in $\ell$-regular partitions and $\ell$-distinct partitions. More precisely, we establish hook length inequalities between $\ell$-regular partitions and $\ell$-distinct partitions for hook lengths $2$…
The fragmentation processes of exchangeable partitions have already been studied by several authors. In this paper, we examine rather fragmentation of exchangeable compositions, that means partitions of $\mathbb{N}$ where the order of the…
Simultaneous core partitions have been widely studied since Anderson's work on the enumeration of $(s,t)$-core partitions. Amdeberhan and Leven showed that the number of $(s,s+1, \ldots, s+k)$-core partitions is equal to the number of $(s,…
In 2010, G.-N. Han obtained the generating function for the number of size $t$ hooks among integer partitions. Here we obtain these generating functions for self-conjugate partitions, which are particularly elegant for even $t$. If…
We introduce the idea of (s,t)-closure and delta-sets and show that (s,t)-closed beta-sets which are contained set-wise in (s,t)-closed delta-sets are also contained partition-wise. This implies the maximal (s,t)-core partition theorem of…
Recently, Amdeberhan et al. proved congruences for the number of hooks of fixed even length among the set of self-conjugate partitions of an integer $n$, therefore answering positively a conjecture raised by Ballantine et al.. In this…
For positive integers $s$ and $L \geq 3$, Berkovich and Uncu (Ann. Comb. $23$ ($2019$) $263$--$284$) conjectured an inequality between the sizes of two closely related sets of partitions whose parts lie in the interval $\{s, \ldots, L+s\}$.…
Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…
We study the structure of a uniformly randomly chosen partial order of width 2 on n elements. We show that under the appropriate scaling, the number of incomparable elements converges to the height of a one dimensional Brownian excursion at…
We give relations between the joint distributions of multiple hook lengths and of frequencies and part sizes in partitions, extending prior work in this area. These results are discovered by investigating truncations of the…
We consider connected components in $k$-uniform hypergraphs for the following notion of connectedness: given integers $k\ge 2$ and $1\le j \le k-1$, two $j$-sets (of vertices) lie in the same $j$-component if there is a sequence of edges…
Fix coprime $s,t\ge1$. We re-prove, without Ehrhart reciprocity, a conjecture of Armstrong (recently verified by Johnson) that the finitely many simultaneous $(s,t)$-cores have average size $\frac{1}{24}(s-1)(t-1)(s+t+1)$, and that the…
We investigate the number $N_{d,r}(s)$ of $(s, s+r)$-core integer partitions with $d$-distinct parts. Our first main result is a proof of a recurrence relation conjectured by Sahin in 2018. We also derive generating functions, asymptotics,…
Using only a symmetric p-core partition and p-quotient, we give an explicit formula for the set of diagonal hook lengths of the associated symmetric partition.
Amdeberhan conjectured that the number of $(t,t+1, t+2)$-core partitions is $\sum_{0\leq k\leq [\frac{t}{2}]}\frac{1}{k+1}\binom{t}{2k}\binom{2k}{k}$. In this paper, we obtain the generating function of the numbers $f_t$ of $(t, t + 1, ...,…
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…
A recent paper by Hanusa and Nath states many conjectures in the study of self-conjugate core partitions. We prove all but two of these conjectures asymptotically by number-theoretic means. We also obtain exact formulas for the number of…
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…
We propose an aproach for asymptotic analysis of plane partition statistics related to counts of parts whose sizes exceed a certain suitably chosen level. In our study, we use the concept of conjugate trace of a plane partition of the…