Related papers: Distribution properties for t-hooks in partitions

For a partition $\lambda \vdash n$, we let $\operatorname{pd}(\lambda)$, the parity difference of $\lambda$, be the number of odd parts of $\lambda$ minus the number of even parts of $\lambda$. We prove for $c_0\in\mathbb{R}$ an asymptotic…

We study the order statistics of one dimensional branching Brownian motion in which particles either diffuse (with diffusion constant $D$), die (with rate $d$) or split into two particles (with rate $b$). At the critical point $b=d$ which…

We first show that the pions produced at high $p_T$ in heavy-ion collisions over a wide range of high energies exhibit a scaling behavior when the distributions are plotted in terms of a scaling variable. We then use the recombination model…

Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…

A probability distribution is n-divisible if its nth convolution root exists. While modeling the dependence structure between several (re)insurance losses by an additive risk factor model, the infinite divisibility, that is the…

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…

Recently, Andrews defined a partition function $\mathcal{EO}(n)$ which counts the number of partitions of $n$ in which every even part is less than each odd part. He also defined a partition function $\overline{\mathcal{EO}}(n)$ which…

In this paper, we obtain upper and lower bounds for the partition function $p(n)$ by using an elementary geometric inequality in Euclidean space, and we extend the method to generalizations of the partition function.

Let $\mathcal{P}=\{p_1,p_2,...\}$ be the set of all odd primes arranged in increasing order. A Goldbach partition of the even integer $2k>4$ is a way of writing it as a sum of two primes from $\mathcal{P}$ without regard to order. Let…

We consider a class of particle systems described by differential equations (both stochastic and deterministic), in which the interaction network is determined by the realization of an Erd\H{o}s-R\'enyi graph with parameter $p_n\in (0, 1]$,…

Recently, many authors have investigated how various partition statistics distribute as the size of the partition grows. In this work, we look at a particular statistic arising from the recent rejuvenation of MacMahon's partition analysis.…

We study the asymptotic behavior of solid partitions using transition matrix Monte Carlo simulations. If $p_3(n)$ denotes the number of solid partitions of an integer $n$, we show that $\lim_{n\rightarrow\infty} n^{-3/4} \log p_3(n)\sim…

We obtain a finite analogue of a recent generalization of an identity in Ramanujan's Notebooks. Differentiating it with respect to one of the parameters leads to a result whose limiting case gives a finite analogue of Andrews' famous…

In recent years increasing attention has been paid on the area of supercharacter theories, especially to those of the upper unitriangular group. A particular supercharacter theory, in which supercharacters are indexed by set partitions, has…

The arithmetic properties of the ordinary partition function $p(n)$ have been the topic of intensive study for the past century. Ramanujan proved that there are linear congruences of the form $p(\ell n+\beta)\equiv 0\pmod\ell$ for the…

A famous conjecture of Parkin-Shanks predicts that $p(n)$ is odd with density $1/2$. Despite the remarkable amount of work of the last several decades, however, even showing this density is positive seems out of reach. In a 2018 paper with…

Let \( \{\varphi_i\}_{i=0}^\infty \) be a sequence of orthonormal polynomials on the unit circle with respect to a probability measure \( \mu \). We study zero distribution of random linear combinations of the form \[…

Let $P_{d}(n)$ denote the number of $n \times \ldots \times n$ $d$-dimensional partitions with entries from $\left\{0,1,\ldots,n\right\}$. Building upon the works of Balogh-Treglown-Wagner and Noel-Scott-Sudakov, we show that when $d \to…

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…

The study of permutation and partition statistics is a classical topic in enumerative combinatorics. The major index statistic on permutations was introduced a century ago by Percy MacMahon in his seminal works. In this extended abstract,…