Related papers: Statistics on monotonically ordered non-crossing p…
The paper establishes a connection between two recent combinatorial developments in free probability: the non-crossing linked partitions introduced by Dykema in 2007 to study the S-transform, and the partial order << on NC(n) introduced by…
A conjecture on the monotonicity of t-core partitions in an article of Stanton [Open positivity conjectures for integer partitions, Trends Math., 2:19-25, 1999] has been the catalyst for much recent research on t-core partitions. We…
Buryak, Feigin and Nakajima computed a generating function for a family of partition statistics by using the geometry of the $Z/cZ$ fixed point sets in the Hilbert scheme of points on $C^2$. Loehr and Warrington had already shown how a…
Unlike classical and free independence, the boolean and monotone notions of independence lack of the property of independent constants. In the scalar case, this leads to restrictions for the central limit theorems, as observed by F.…
We study sub-semigroups of the semigroup of probability measures on $\mathbb{R}$ and monotone additive statistics on them, by which we mean maps to the reals that are monotone with respect to the stochastic order and additive under…
Using methods from Analytic Combinatorics, we study the families of perfect matchings, partitions, chord diagrams, and hyperchord diagrams on a disk with a prescribed number of crossings. For each family, we express the generating function…
It is shown that the combinatorics of commutation relations is well suited for analyzing the convergence rate of certain Markov chains. Examples studied include random walk on irreducible representations, a local random walk on partitions…
Suppose some random resource (energy, mass or space) $\chi \geq 0$ is to be shared at random between (possibly infinitely many) species (atoms or fragments). Assume ${\Bbb E}\chi =\theta <\infty $ and suppose the amount of the individual…
In this paper we prove a duality between $k$-noncrossing partitions over $[n]=\{1,...,n\}$ and $k$-noncrossing braids over $[n-1]$. This duality is derived directly via (generalized) vacillating tableaux which are in correspondence to…
This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and…
We introduce two order relations on finite Coxeter groups which refine the absolute and the Bruhat order, and establish some of their main properties. In particular we study the restriction of these orders to noncrossing partitions and show…
The paper introduces the concept of a cluster structure to define a joint distribution of the sample size and its exchangeable random partitions. The cluster structure allows the probability distribution of the random partitions of a subset…
In the first part we associate a periodic sequence to a partition and study the connection the distribution of elements of uniform limit of the sequences. Then some facts of statistical independence of these limits are proved
We present families of combinatorial classes described as trees with nodes that can carry one of two types of "flowers": integer partitions or integer compositions. Two parameters on the flowers of trees will be considered: the number of…
We consider the level statistics of two-dimensional harmonic oscillators with incommensurable frequencies, which are known to have picket-fence type spectra. We propose a parametric representation for the level-spacing distribution and…
We consider a one-dimensional gas of $N$ independent Brownian particles subject to simultaneous stochastic resetting, with inter-reset times drawn from a general waiting-time distribution $\psi(\tau)$. This includes the well-known…
In the present paper the low density limit of the non-chronological multitime correlation functions of boson number type operators is investigated. We prove that the limiting truncated non-chronological correlation can be computed using…
Stochastic processes on topological vector spaces over non-Archimedean fields and with transition measures having values in non-Archimedean fields are defined and investigated. For this the non-Archimedean analog of the Kolmogorov theorem…
We study the combinatorics of solitons in $D<2$ (or $c<1$) string theory. The weights in the summation over multi-solitons are shown to be automatically determined if we further require that the partition function with soliton background be…
Integer partitions are one of the most fundamental objects of combinatorics (and number theory), and so is enumerating objects avoiding patterns. In the present paper we describe two approaches for the systematic counting of classes of…