相关论文: Moments of Colored Permutation Statistics on Conju…

The moment problem in probability theory asks for criteria for when there exists a unique measure with a given tuple of moments. We study a variant of this problem for random objects in a category, where a moment is given by the average…

We prove asymptotic equivalents for finite-level representations of symmetric groups, that is, for Young diagrams having all but finitely many boxes on their first row. We deduce that random walks on symmetric groups generated by conjugacy…

We investigate moment sequences of probability measures on $E\subset\mathbb{R}$ under constraints of certain moments being fixed. This corresponds to studying sections of $n$-th moment spaces, i.e. the spaces of moment sequences of order…

Any permutation in the finite symmetric group can be written as a product of simple transpositions $s_i = (i~i+1)$. For a fixed permutation $\sigma \in \mathfrak{S}_n$ the products of minimal length are called reduced decompositions or…

We present an analytic method for computing the moments of a sum of independent and identically distributed random variables. The limiting behavior of these sums is very important to statistical theory, and the moment expressions that we…

We derive evolution equations satisfied by moments of parton distributions when the integration over the Bjorken variable is restricted to a subset (x_0 <= x <= 1) of the allowed kinematical range 0<= x<= 1. The corresponding anomalous…

We investigate the joint moments of derivatives of characteristic polynomials over the unitary symplectic group $Sp(2N)$ and the orthogonal ensembles $SO(2N)$ and $O^-(2N)$. We prove asymptotic formulae for the joint moments of the $n_1$-th…

We study the relationship between the well-known Carleman's condition guaranteeing that a probability distribution is uniquely determined by its moments, and a recent easily checkable condition on the rate of growth of the moments. We use…

Let $\gamma_n$ be the permutation on $n$ symbols defined by $\gamma_n = (1\ 2\...\ n)$. We are interested in an enumerative problem on colored permutations, that is permutations $\beta$ of $n$ in which the numbers from 1 to $n$ are colored…

The jigsaw percolation process, introduced by Brummitt, Chatterjee, Dey and Sivakoff, was inspired by a group of people collectively solving a puzzle. It can also be seen as a measure of whether two graphs on a common vertex set are…

The problem of convergence of the joint moments, which depend on two parameters $s$ and $h$, of the characteristic polynomial of a random Haar-distributed unitary matrix and its derivative, as the matrix size goes to infinity, has been…

It is known from the work of Baik, Deift, and Johansson [1999] that we have Tracy-Widom fluctuations for the longest increasing subsequence of uniform permutations. In this paper, we prove that this result holds also in the case of the…

Let $G$ be a finite group. We consider the problem of counting simultaneous conjugacy classes of $n$-tuples and simultaneous conjugacy classes of commuting $n$-tuples in $G$. Let $\alpha_{G,n}$ denote the number of simultaneous conjugacy…

It is shown that the maximum number of patterns that can occur in a permutation of length $n$ is asymptotically $2^n$. This significantly improves a previous result of Coleman.

If we treat the symmetric group $S_n$ as a probability measure space where each element has measure $1/n!$, then the number of cycles in a permutation becomes a random variable. The Cycle Length Lemma describes the expected values of…

We study the fluctuations of certain biorthogonal ensembles for which the underlying family \{P,Q\} satisfies a finite-term recurrence relation of the form $x P(x) = \mathbf{J}P(x)$. For polynomial linear statistics of such ensembles, we…

We investigate the mixing properties of a model of reversible Markov chains in random environment, which notably contains the simple random walk on the superposition of a deterministic graph and a second graph whose vertex set has been…

Let G be a finite group and H a normal subgroup such that G/H is cyclic. Given a conjugacy class g^G of G we define its centralizing subgroup to be HC_G(g). Let K be such that H\le K\le G. We show that the G-conjugacy classes contained in K…

Finding spanning structures with many distinct colours in properly edge-coloured graphs is a central theme in extremal combinatorics. A classical result of Andersen shows that every proper edge-colouring of the complete graph $K_n$ contains…

In this paper, we introduce a convergence notion for ordered selections. Our convergence notion is based on subpermutation densities and convergences of the marginal distributions. A particular case of this convergence is the well-known…