Related papers: Asymptotic normality of pattern counts in conjugac…

We study joint distributions of cycles and patterns in permutations written in standard cycle form. We explore both classical and generalised patterns of length 2 and 3. Many extensions of classical theory are achieved; bivariate generating…

In this article we consider the general setting of conformal graph directed Markov systems modeled by countable state symbolic subshifts of finite type. We deal with two classes of such systems: attracting and parabolic. The latter being…

In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…

We undertake a detailed investigation into the structure of permutations in monotone grid classes whose row-column graphs do not contain components with more than one cycle. Central to this investigation is a new decomposition, called the…

Let $G$ be a finite almost simple group of Lie type acting faithfully and primitively on a set $\Omega$. We prove an analogue of the Boston--Shalev conjecture for conjugacy classes: the proportion of conjugacy classes of $G$ consisting of…

Reviewing the semiclassical theory for the parametric level density fluctuations, we show that for large parametric changes the density correlation function, after rescaling, becomes universal and coincides with the leading asymptotic term…

Summation arithmetic functions with asymptotically independent terms are studied in the paper, the limit of which is the law of normal distribution. Assertions about the asymptotic behavior of the indicated functions are proved.

In this paper we study the property of normality of a number in base 2. A simple rule that associates a vector to a number is presented and the property of normality is stated for the vector associated to the number. The problem of testing…

We consider the sequential composite binary hypothesis testing problem in which one of the hypotheses is governed by a single distribution while the other is governed by a family of distributions whose parameters belong to a known set…

For a fixed permutation $\sigma \in S_k$, let $N_{\sigma}$ denote the function which counts occurrences of $\sigma$ as a pattern in permutations from $S_n$. We study the expected value (and $d$-th moments) of $N_{\sigma}$ on conjugacy…

Using a result of Gessel and Reutenauer, we find a simple formula for the number of cyclic permutations with a given descent set, by expressing it in terms of ordinary descent numbers (i.e., those counting all permutations with a given…

In this paper we study different restrictions imposed over the set of permutations of size $n$, $S_n$, and for specific classes of restrictions study the cycle structure of corresponding permutations. More specifically, we prove that for…

In this paper we apply methods of proof mining to obtain a highly uniform effective rate of asymptotic regularity for the Ishikawa iteration associated to nonexpansive self-mappings of convex subsets of a class of uniformly convex geodesic…

We study how few pairwise distinct longest cycles a regular graph can have under additional constraints. For each integer $r \geq 5$, we give exponential improvements for the best asymptotic upper bounds for this invariant under the…

This paper discusses the asymptotic behaviour of the number of descents in a random signed permutation and its inverse, which was posed as an open problem by Chatterjee and Diaconis in a recent publication. For that purpose, we generalize…

In this case-study in computer-human collaboration, we develop, implement, and execute symbolic-computational algorithms for the automatic discovery and proof of explicit expressions for the expectation, variance, and higher moments of a…

We consider independent long-range percolation models on locally finite vertex-transitive graphs. Using coupling ideas we prove strict monotonicity of the critical points with respect to local perturbations in the connection function,…

We prove limit theorems for the number of fixed points, descents, and inversions of iterated random-to-top shuffles in two asymptotic regimes. Our proofs are analytic, and they utilize new combinatorial decompositions that represent each…

We prove asymptotic equipartition properties for simple hierarchical structures (modelled as multitype Galton-Watson trees) and networked structures (modelled as randomly coloured random graphs). For example, for large $n$, a networked data…

We consider random permutations on $\Sn$ with logarithmic growing cycles weights and study asymptotic behavior as the length $n$ tends to infinity. We show that the cycle count process converges to a vector of independent Poisson variables…