Related papers: Note on a partition limit theorem for rank and cra…
The main result of this paper is a bijective proof showing that the generating function for partitions with bounded differences between largest and smallest part is a rational function. This result is similar to the closely related case of…
We revisit the ergodic theorem for the frontier of branching Brownian motion (BBM). Motivated by the proof of Arguin, Bovier, and Kistler \cite{arguin2012ergodic}, we provide a shorter and more direct argument. It relies on two…
We consider a random planar map $M_n$ which is uniformly distributed over the class of all rooted q-angulations with n faces. We let $\mathbf{m}_n$ be the vertex set of $M_n$, which is equipped with the graph distance $d_\mathrm{gr}$. Both…
We study systems of Brownian particles on the real line, which interact by splitting the local times of collisions among themselves in an asymmetric manner. We prove the strong existence and uniqueness of such processes and identify them…
For tensors of fixed order, we establish three types of upper bounds for the geometric rank in terms of the subrank. Firstly, we prove that, under a mild condition on the characteristic of the base field, the geometric rank of a tensor is…
The crank is a partition statistic requested by Dyson in 1944 in order to combinatorially prove a Ramanujan congruence of Euler's partition function $p(n)$. In this paper, we provide connections between Dyson's crank and unimodal…
We give a proof of a result on the growth of the number of particles along chosen paths in a branching Brownian motion. The work follows the approach of classical large deviations results, in which paths in $C[0,1]$ are rescaled onto…
In this paper, we prove inequalities for ranks, cranks, and partitions among different classes modulo 11. These were conjectured by Borozenets.
We consider a particle system with uniform coupling between a macroscopic component and individual particles. The constraint for each particle is of full rank, which implies that each movement of the macroscopic component leads to a…
In a previous paper, the authors proved a conjecture of Lalley and Sellke that the empirical (time-averaged) distribution function of the maximum of branching Brownian motion converges almost surely to a Gumbel distribution. The result is…
By considering the $M_2$-rank of an overpartition as well as a residual crank, we give another combinatorial refinement of the congruences $\overline{\mbox{spt}}_2(3n)\equiv \overline{\mbox{spt}}_2(3n+1)\equiv 0\pmod{3}$. Here…
It has been proved by Bovier & Hartung [Elect. J. Probab. 19 (2014)] that the maximum of a variable-speed branching Brownian motion (BBM) in the weak correlation regime converges to a randomly shifted Gumbel distribution. The random shift…
We generalize a result of Garvan on inequalities and interpretations of the moments of the partition rank and crank functions. In particular for nearly 30 Bailey pairs, we introduce a rank-like function, establish inequalities with the…
We consider the equal sum partition problem, motivated by distance magic graph labeling: Given $n,k \in \N$ such that $k\, | \sum_{i=1}^ni$ and a partition $p_1+\cdots+p_k=n$, when is it possible to find a partition of the set…
We consider uniformly random strictly upper-triangular matrices in $\operatorname{Mat}_n(\mathbb{F}_q)$. For such a matrix $A_n$, we show that $n-\operatorname{rank}(A_n) \approx \log_q n$ as $n \to \infty$, and find that the fluctuations…
We explicitly compute the limiting transient distribution of the search-cost in the move-to-front Markov chain when the number of objects tends to infinity, for general families of deterministic or random request rates. Our techniques are…
Rank-ordering statistics provides a perspective on the rare, largest elements of a population, whereas the statistics of cumulative distributions are dominated by the more numerous small events. The exponent of a power law distribution can…
The 'Arcsine' laws of Brownian particles in one dimension describe distributions of three quantities: the time $t_m$ to reach maximum position, the time $t_r$ spent on the positive side and the time $t_\ell$ of the last visit to the origin.…
We study the asymptotic distribution of the two following combinatorial parameters: the number of arc crossings in the linear representation, ${\mathrm cr^{(\ell)}$, and the number of chord crossings in the circular representation,…
We prove a Large Deviations Principle (LDP) for systems of diffusions (particles) interacting through their ranks, when the number of particles tends to infinity. We show that the limiting particle density is given by the unique solution of…