Related papers: Asymptotics of self-overlapping permutations
The method of extrapolating asymptotic series, based on the Self-Similar Approximation Theory, is developed. Several important questions are answered, which makes the foundation of the method unambiguous and its application straightforward.…
The paper is devoted to tests for uniformity based on sum-functions of overlapping spacings, where the order of spacings can diverge to infinity as the sample size increases. In particular, it is shown that the asymptotic local power of…
The problem of extrapolating asymptotic perturbation-theory expansions in powers of a small variable to large values of the variable tending to infinity is investigated. The analysis is based on self-similar approximation theory. Several…
We characterize asymptotic collective behaviour of rectangular random matrices, the sizes of which tend to infinity at different rates: when embedded in a space of larger square matrices, independent rectangular random matrices are…
We study proportions of consecutive occurrences of permutations of a given size. Specifically, the feasible limits of such proportions on large permutations form a region, called feasible region. We show that this feasible region is a…
We propose a new nonparametric test for the supposition of independence between two continuous random variables. The test is based on the size of the longest increasing subsequence of a random permutation. We identified the independence…
We consider the set of finite sequences of length n over a finite or countable alphabet C. We consider the function which associate each given sequence with the size of the maximum overlap with a (shifted) copy of itself. We compute the…
We show that the super fixed point property for nonexpansive mappings and for asymptotically nonexpansive mappings in the intermediate sense are equivalent. As a consequence, we obtain fixed point theorems for asymptotically nonexpansive…
We consider singularly perturbed second order elliptic system in the whole space with fast oscillating coefficients. We construct the complete asymptotic expansions for the eigenvalues converging to the isolated ones of the homogenized…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
We introduce the notion of crossings and nestings of a permutation. We compute the generating function of permutations with a fixed number of weak exceedances, crossings and nestings. We link alignments and permutation patterns to these…
In this paper we show that in systems where the probability distribution of the the overlap is non trivial in the infinity volume limit, the property of ultrametricity can be proved in general starting from two very simple and natural…
In this paper, we introduce the notion of asymptotic self-similar sets on general doubling metric spaces by extending the notion of self-similar sets, and determine their Hausdorff dimensions, which gives an extension of Balogh and Rohner…
We develop asymptotic approximations that can be applied to sequential estimation and inference problems, adaptive randomized controlled trials, and related settings. In batched adaptive settings where the decision at one stage can affect…
Two asymptotic configurations on a full $\mathbb{Z}^d$-shift are indistinguishable if for every finite pattern the associated sets of occurrences in each configuration coincide up to a finitely supported permutation of $\mathbb{Z}^d$. We…
Finite decomposition complexity and asymptotic dimension growth are two generalizations of M. Gromov's asymptotic dimension which can be used to prove property A for large classes of finitely generated groups of infinite asymptotic…
We give asymptotic expressions for the number of commuting matrices over finite fields. For this, we use product expansions for the corresponding generating functions.
We obtain an explicit formula for the variance of the number of $k$-peaks in a uniformly random permutation. This is then used to obtain an asymptotic formula for the variance of the length of longest $k$-alternating subsequence in random…
We consider the problem of enumerating permutations in the symmetric group on $n$ elements which avoid a given set of consecutive pattern $S$, and in particular computing asymptotics as $n$ tends to infinity. We develop a general method…
The algebraic properties of formal power series, whose coefficients show factorial growth and admit a certain well-behaved asymptotic expansion, are discussed. It is shown that these series form a subring of $\mathbb{R}[[x]]$. This subring…