Related papers: Expectations of hook products on large partitions
We prove that a uniformly random automaton with $n$ states on a 2-letter alphabet has a synchronizing word of length $O(n^{1/2}\log n)$ with high probability (w.h.p.). That is to say, w.h.p. there exists a word $\omega$ of such length, and…
We introduce an algorithm for the uniform generation of infinite traces, i.e., infinite words up to commutation of some letters. The algorithm outputs on-the-fly approximations of a theoretical infinite trace, the latter being distributed…
The Mallows measure on the symmetric group $S_n$ is the probability measure such that each permutation has probability proportional to $q$ raised to the power of the number of inversions, where $q$ is a positive parameter and the number of…
In a previous paper, we proposed a probability interpretation for higher genus amplitudes of BMN (Berenstein-Maldacena-Nastase) strings in a pp-wave background with infinite negative curvature. This provides a natural definition of the…
The probabilities for gaps in the eigenvalue spectrum of finite $ N\times N $ random unitary ensembles on the unit circle with a singular weight, and the related hermitian ensembles on the line with Cauchy weight, are found exactly. The…
We consider the combinatorial problem where $p$ players aim to a complete set of $N$ different types of items (species) which are uniformly distributed. Let the random variables $T_{N(i)},\,\,i=1,2,\cdots,p$ denoting the number of trials…
Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match or are compatible with all letters; partial words without holes are said to be full words (or simply words). Given an infinite…
The rate of occurrence of words is not uniform but varies from document to document. Despite this observation, parameters for conventional n-gram language models are usually derived using the assumption of a constant word rate. In this…
Counting experiments often rely on Monte Carlo simulations for predictions of Poisson expectations. The accompanying uncertainty from the finite Monte Carlo sample size can be incorporated into parameter estimation by modifying the Poisson…
We compute the expected number of commutations appearing in a reduced word for the longest element in the symmetric group. The asymptotic behavior of this value is analyzed and shown to approach the length of the permutation, meaning that…
We find a two term asymptotic expansion for the optimal expected value of a sequentially selected monotone subsequence from a random permutation of length n. A striking feature of this expansion is that tells us that the expected value of…
This paper proves a generalization of a conjecture of Guoniu Han, inspired originally by an identity of Nekrasov and Okounkov. The main result states that certain sums over partitions p of n, involving symmetric functions of the squares of…
For every integer $k\geq 2$ let $[k]^{<\mathbb{N}}$ be the set of all words over $k$, that is, all finite sequences having values in $[k]:=\{1,...,k\}$. A Carlson-Simpson tree of $[k]^{<\mathbb{N}}$ of dimension $m\geq 1$ is a subset of…
Fix $p\geq 5$ an odd integer integer. Let $M_n$ be a uniform $p$-angulation with $n$ vertices and endowed with the uniform probability measure on its vertices. We prove that, there exists $C_p\in \mathbb{R}_+$ such that, after rescaling…
Consider a realization of a Poisson process in R^2 with intensity 1 and take a maximal up/right path from the origin to (N,N) consisting of line segments between the points, where maximal means that it contains as many points as possible.…
We define the notion of asymptotically free for locally restricted compositions, which means roughly that large parts can often be replaced by any larger parts. Two well-known examples are Carlitz and alternating compositions. We show that…
We introduce some new classes of words and permutations characterized by the second difference condition $\pi(i-1) + \pi(i+1) - 2\pi(i) \leq k$, which we call the $k$-convexity condition. We demonstrate that for any sized alphabet and…
The fundamental question considered in algorithms on strings is that of indexing, that is, preprocessing a given string for specific queries. By now we have a number of efficient solutions for this problem when the queries ask for an exact…
For a regular compact set $K$ in $C^m$ and a measure $\mu$ on $K$ satisfying the Bernstein-Markov inequality, we consider the ensemble $P_N$ of polynomials of degree $N$, endowed with the Gaussian probability measure induced by $L^2(\mu)$.…
The generalised random Fibonacci chain is a stochastic extension of the classical Fibonacci substitution and is defined as the rule mapping $0\mapsto 1$ and $1 \mapsto 1^i01^{m-i}$ with probability $p_i$, where $p_i\geq 0$ with…