Related papers: Correct ordering in the Zipf-Poisson ensemble

We use methods of combinatorial number theory to prove that, for each $n>1$ and any prime $p$, some homotopy group $\pi_i(SU(n))$ contains an element of order $p^{n-1+ord_p([n/p]!)}$, where $ord_p(m)$ denotes the largest integer $\alpha$…

The observed frequency of the longest proper prefix, the longest proper suffix, and the longest infix of a word $w$ in a given sequence $x$ can be used for classifying $w$ as avoided or overabundant. The definitions used for the expectation…

In this paper we consider the palindromes that can be formed by taking unordered sets of $n$ elements from an alphabet of $b$ letters. In particular, we seek to find the probability that given a random member of this space we are able to…

Construct recursively a long string of words w1. .. wn, such that at each step k, w k+1 is a new word with a fixed probability p $\in$ (0, 1), and repeats some preceding word with complementary probability 1 -- p. More precisely, given a…

This paper considers some random processes of the form X_{n+1}=TX_n+B_n (mod p) where B_n and X_n are random variables over (Z/pZ)^d and T is a fixed d x d integer matrix which is invertible over the complex numbers. For a particular…

We study how the order of N independent random walks in one dimension evolves with time. Our focus is statistical properties of the inversion number m, defined as the number of pairs that are out of sort with respect to the initial…

Let $ X_1, \ldots, X_n $ be independent random variables taking values in the alphabet $ \{0, 1, \ldots, r\} $, and $ S_n = \sum_{i = 1}^n X_i $. The Shepp--Olkin theorem states that, in the binary case ($ r = 1 $), the Shannon entropy of $…

Let $a_0=b_0=0$ and $0<a_1\leq b_1<a_2\leq b_2<\ldots\leq b_{n}$ be integers. Let $Q\left(x;\bigcup_{j=1}^{n}[a_j,b_j]\right)$ be the number of integers between $1$ and $x$ such that all exponents in their prime factorization are in…

Given a set I of word, the set of all words obtained by the shuffle of (copies of) words of I is naturally provided with a partial order. In [FS05], the authors have opened the problem of the characterization of the finite sets I such that…

The random Fibonacci chain is a generalisation of the classical Fibonacci substitution and is defined as the rule mapping $0\mapsto 1$ and $1 \mapsto 01$ with probability $p$ and $1 \mapsto 10$ with probability $1-p$ for $0<p<1$ and where…

Let $P(n)$ be the probability that two independent, uniformly random permutations of $[n]$ have the same order, and let $K(n)$ be the probability that they are in the same conjugacy class. Answering a question of Thibault Godin, we prove…

Let $S$ be a finite set of positive integers with largest element $m$. Let us randomly select a composition $a$ of the integer $n$ with parts in $S$, and let $m(a)$ be the multiplicity of $m$ as a part of $a$. Let $0\leq r<q$ be integers,…

In this paper we study the enumeration and the construction, according to the number of ones, of particular binary words avoiding a fixed pattern. The growth of such words can be described by particular jumping and marked succession rules.…

Automated reasoning about uncertain knowledge has many applications. One difficulty when developing such systems is the lack of a completely satisfactory integration of logic and probability. We address this problem directly. Expressive…

Let X_1, X_2,..., X_n be a sequence of independent random variables, let M be a rearrangement invariant space on the underlying probability space, and let N be a symmetric sequence space. This paper gives an approximate formula for the…

Fix a base B and let zeta have the standard exponential distribution; the distribution of digits of zeta base B is known to be very close to Benford's Law. If there exists a C such that the distribution of digits of C times the elements of…

In-place associative integer sorting technique was developed, improved and specialized for distinct integers. The technique is suitable for integer sorting. Hence, given a list S of n integers S[0...n-1], the technique sorts the integers in…

Let $S_n=I_1+\cdots+I_n$ be a sum of independent indicators $I_i$, with $p_i=\Pr(I_i=1)=1-\Pr(I_i=0)$, $i=1,\ldots,n$. It is well-known that the total variation distance between $S_n$ and $Z_\lambda$, where $Z_\lambda$ has a Poisson…

There are many situations where comparison of different groups is of great interest. Considering the ordering of the efficiency of some treatments is an example. We present nonparametric predictive inference (NPI) for the ordering of…

Let $N(x,y)$ denote the number of integers $n\le x$ which are divisible by a shifted prime $p-1$ with $p>y$, $p$ prime. Improving upon recent bounds of McNew, Pollack and Pomerance, we establish the exact order of growth of $N(x,y)$ for all…