Related papers: Sizes of Simultaneous Core Partitions
We consider two-loop corrections to $2\to 2$ scattering processes with massive particles in the final state and massive particles in the loop. We discuss the combination of analytic expansions in the high-energy limit and for small…
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…
Connectedness percolation phenomena in the two-dimensional (2D) packing of binary mixtures of disks with different diameters were studied numerically. The packings were produced using random sequential adsorption (RSA) model with…
Consider the random graph process $\{G_t\}_{t\geq 0}$. For $k\geq 3$ let $G_{t}^{(k)}$ denote the $k$-core of $G_t$ and let $\tau_k$ be the minimum $t$ such that the $k$-core of $G_t$ is nonempty. It is well known that w.h.p. for…
We study the asymptotic behaviour of the trace (the sum of the diagonal parts) of a plane partition of the positive integer n, assuming that this parfition is chosen uniformly at random from the set of all such partitions.
We study translation-invariant determinantal random point fields on the real line. We prove, under quite general conditions, that the smallest nearest spacings between the particles in a large interval have Poisson statistics as the length…
Let $p_t(a,b;n)$ denote the number of partitions of $n$ such that the number of $t$ hooks is congruent to $a \bmod{b}$. For $t\in \{2, 3\}$, arithmetic progressions $r_1 \bmod{m_1}$ and $r_2 \bmod{m_2}$ on which $p_t(r_1,m_1; m_2 n + r_2)$…
We consider a family of distributions on spatial random partitions that provide a coupling between different models of interest: the ideal Bose gas; the zero-range process; particle clustering; and spatial permutations. These distributions…
We present a solution to a problem suggested by Philippe Biane: We prove that a certain Plancherel-type probability distribution on partitions converges, as partitions get large, to a new determinantal random point process on the set…
In this paper, we consider a network of rate proportional processor sharing servers in which sessions with long-tailed duration arrive as Poisson processes. In particular, we assume that a session of type $n$ transmits at a rate $r_n$ bits…
We begin with the extraordinary observation that the length distribution of 80 million proteins in UniProt, the Universal Protein Resource, measured in amino acids, is qualitatively identical to the length distribution of large collections…
Random tilings or packings in the plane are characterized by a size distribution of individual elements (domains) and by the statistics of neighbor relations between the domains. Most systems occurring in nature or technology have a…
We introduce a new concept, which we call partition expanders. The basic idea is to study quantitative properties of graphs in a slightly different way than it is in the standard definition of expanders. While in the definition of expanders…
We extend recent results of Ono and Raji, relating the number of self-conjugate $7$-core partitions to Hurwitz class numbers. Furthermore, we give a combinatorial explanation for the curious equality $2\operatorname{sc}_7(8n+1) =…
We prove almost sure strong asymptotic freeness of i.i.d. random unitaries with the following law: sample a Haar unitary matrix of dimension $n$ and then send this unitary into an irreducible representation of $U(n)$. The strong convergence…
In this expository paper we summarize the connection between random partitions and 4-dimensional supersymmetric gauge theories discovered in hep-th/0306238. There is also a brief section about how this extends to 3-dimensional partitions…
We define a spatially-dependent fragmentation process, which involves rectangles breaking up into progressively smaller pieces at rates that depend on their shape. Long, thin rectangles are more likely to break quickly, and are also more…
We study the compositions of an integer n whose part sizes do not exceed a fixed integer k. We use the methods of analytic combinatorics to obtain precise asymptotic formulas for the number of such compositions, the total number of parts…
Consider two random strings having the same length and generated by an iid sequence taking its values uniformly in a fixed finite alphabet. Artificially place a long constant block into one of the strings, where a constant block is a…
We determine the distribution of the number of saddle connections on a random translation surface of large genus. More specifically, for genus $g$ tending to infinity, the number of saddle connections with lengths in a given interval…