Related papers: Hook-Length Biases in $t$-regular partitions

We generalize overpartitions to (k,j)-colored partitions: k-colored partitions in which each part size may have at most j colors. We find numerous congruences and other symmetries. We use a wide array of tools to prove our theorems:…

Partition functions arise in statistical physics and probability theory as the normalizing constant of Gibbs measures and in combinatorics and graph theory as graph polynomials. For instance the partition functions of the hard-core model…

Orthogonal arrays are a type of combinatorial design that were developed in the 1940s in the design of statistical experiments. In 1947, Rao proved a lower bound on the size of any orthogonal array, and raised the problem of constructing…

We make progress towards understanding the structure of Littlewood-Richardson coefficients $g_{\lambda,\mu}^{\nu}$ for products of Jack symmetric functions. Building on recent results of the second author, we are able to prove new cases of…

In this short note we discuss recent results on hook length formulas of trees unifying some earlier results, and explain hook length formulas naturally associated to families of increasingly labelled trees.

Based on work of Atkin and Swinnerton-Dyer on partition rank difference functions, and more recent work of Lovejoy and Osburn, Mao has proved several inequalities between partition ranks modulo $10$, and additional results modulo $6$ and…

Recently, Rattan and the first author (Ann. Comb. 25 (2021) 697-728) proved a conjectured inequality of Berkovich and Uncu (Ann. Comb. 23 (2019) 263-284) concerning partitions with an impermissible part. In this article, we generalize this…

In this paper, we present, given a odd integer $d$, a decomposition of the multiset of bar lengths of a bar partition $\lambda$ as the union of two multisets, one consisting of the bar lengths in its $\bar{d}$-core partition…

This article is an extensive study of partitions with fixed number of odd and even-indexed odd parts. We use these partitions to generalize recent results of C. Savage and A. Sills. Moreover, we derive explicit formulas for generating…

In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…

We study the problem of extracting randomness from somewhere-random sources, and related combinatorial phenomena: partition analogues of Shearer's lemma on projections. A somewhere-random source is a tuple $(X_1, \ldots, X_t)$ of (possibly…

We survey some of the mechanisms used to prove that naturally defined sequences in combinatorics are log-concave. Among these mechanisms are Alexandrov's inequality for mixed discriminants, the Alexandrov Fenchel inequality for mixed…

Simultaneous core partitions have attracted much attention since Anderson's work on the number of $(t_1,t_2)$-core partitions. In this paper we focus on simultaneous core partitions with distinct parts. The generating function of $t$-core…

Assuming the Riemann Hypothesis it is proved that, for fixed $k>0$ and $H = T^\theta$ with fixed $0<\theta \le 1$, $$ \int_T^{T+H}|\zeta(1/2+it)|^{2k} dt \ll H(\log T)^{k^2(1+O(1/\log_3T))}, $$ where $\log_jT = \log(\log_{j-1}T)$. The proof…

MacMahon showed that the generating function for partitions into at most $k$ parts can be decomposed into a partial fractions-type sum indexed by the partitions of $k$. In this present work, a generalization of MacMahon's result is given,…

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…

Birch and Tverberg partitions are closely related concepts from discrete geometry. We show two properties for the number of Birch partitions: Evenness, and a lower bound. This implies the first non-trivial lower bound for the number of…

We consider simultaneous $(s,s+t,s+2t,\dots,s+pt)$-core partitions in the large-$p$ limit, or (when $s<t$), partitions in which no hook may be of length $s \pmod{t}$. We study generating functions, containment properties, and congruences…

In this paper, we discuss a few recent conjectures made by George Beck related to the ranks and cranks of partitions. The conjectures for the rank of a partition were proved by Andrews by using results due to Atkin and Swinnerton-Dyer on a…

Recently, Andrews and El Bachraoui considered the number of integer partitions whose smallest part is repeated exactly $k$ times and the remaining parts are not repeated. They presented several interesting results and posed questions…