Related papers: Periodic de Bruijn triangles: exact and asymptotic…
We discuss permutation representations which are obtained by the natural action of $S_n \times S_n$ on some special sets of invertible matrices, defined by simple combinatorial attributes. We decompose these representations into…
The Ewens sampling formula with parameter $\alpha$ is the distribution on $S_n$ which gives each $\pi\in S_n$ weight proportional to $\alpha^{C(\pi)}$, where $C(\pi)$ is the number of cycles of $\pi$. We show that, for any fixed $\alpha$,…
We apply a common measure of randomness, the entropy, in the context of iterated functions on a finite set with n elements. For a permutation, it turns out that this entropy is asymptotically (for a growing number of iterations) close to…
We present a systematic description of the mathematical techniques for studying multiloop Feynman diagrams which constitutes a full-fledged and inherently more powerful alternative to the BPHZ theory. The new techniques emerged as a…
We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple…
In this text, we prove the existence of an asymptotic growth rate of the number of dominating sets (and variants) on finite rectangular grids, when the dimensions of the grid grow to infinity. Moreover, we provide, for each of the variants,…
Given a permutation $\pi$ chosen uniformly from $S_n$, we explore the joint distribution of $\pi(1)$ and the number of descents in $\pi$. We obtain a formula for the number of permutations with $\des(\pi)=d$ and $\pi(1)=k$, and use it to…
We obtain some results about the repeated exponentiation modulo a prime power from the viewpoint of arithmetic dynamical systems. Especially, we extend two asymptotic formulas about periodic points and tails in the case of modulo a prime to…
This paper investigates the asymptotic behaviour of solutions of periodic evolution equations. Starting with a general result concerning the quantified asymptotic behaviour of periodic evolution families we go on to consider a special class…
Let ${\cal H}=(q_1, \ldots q_r)$ be a finite set of coprime integers and let $n_1, n_2, \ldots$ denote the multiplicative semigroup generated by $\cal H$ and arranged in increasing order. The distribution of such sequences has been studied…
We investigate the probability of observing a given pattern of $n$ rises and falls in a random stationary data series. The data are modelled as a sequence of $n+1$ independent and identically distributed random numbers. This probabilistic…
A permutation $\sigma$ describing the relative orders of the first $n$ iterates of a point $x$ under a self-map $f$ of the interval $I=[0,1]$ is called an \emph{order pattern}. For fixed $f$ and $n$, measuring the points $x\in I$ (according…
We investigate one-dimensional families of diagonal forms, considering the evolution of the asymptotic formula and error term. We then discuss properties of the average asymptotic formula obtained. The subsequent second moment analysis…
A ballot permutation is a permutation {\pi} such that in any prefix of {\pi} the descent number is not more than the ascent number. In this article, we obtained a formula in close form for the multivariate generating function of {A(n,d,j)},…
Asymptotic expansions are derived for the tail distribution of the product of two correlated normal random variables with non-zero means and arbitrary variances, and more generally the sum of independent copies of such random variables.…
Successive pairs of pseudo-random numbers generated by standard linear congruential transformations display ordered patterns of parallel lines. We study the ``ordered'' and ``chaotic'' distribution of such pairs by solving the eigenvalue…
In the last decade a huge amount of articles has been published studying pattern avoidance on permutations. From the point of view of enumeration, typically one tries to count permutations avoiding certain patterns according to their…
This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn digraph of higher order and connecting these cycles into one…
For population genetics models with recombination, obtaining an exact, analytic sampling distribution has remained a challenging open problem for several decades. Recently, a new perspective based on asymptotic series has been introduced to…
A single joinpoint changepoint model partitions a time series into two segments, joined at the changepoint time by constraining the estimated piecewise linear regression responses to be continuous. This manuscript derives the exact…