Related papers: Universal limits of substitution-closed permutatio…

The class of norm-dependent Random Matrix Ensembles is studied in the presence of an external field. The probability density in those ensembles depends on the trace of the squared random matrices, but is otherwise arbitrary. An exact…

Recent work on the use of dimensional reduction for the regularisation of non--supersymmetric theories is reviewed. It is then shown that there exists a class of theories for which a universal form of the soft supersymmetry breaking terms…

Packing density is a permutation occurrence statistic which describes the maximal number of permutations of a given type that can occur in another permutation. In this article we focus on containment of sets of permutations. Although this…

A class of Emergent Universe (EU) model is studied in the light of recent observational data. Significant constraints on model parameters are obtained from the observational data. Density parameter for a class of model is evaluated. Some of…

There are several approaches to study occurrences of consecutive patterns in permutations such as the inclusion-exclusion method, the tree representations of permutations, the spectral approach and others. We propose yet another approach to…

We provide upper and lower bounds for the expected length $\mathbb E(L_{n,m})$ of the longest common pattern contained in $m$ random permutations of length $n$. We also address the tightness of the concentration of $L_{n,m}$ around $\mathbb…

In this paper, we consider the random plane forest uniformly drawn from all possible plane forests with a given degree sequence. Under suitable conditions on the degree sequences, we consider the limit of a sequence of such forests with the…

We study (asymmetric) $U$-statistics based on a stationary sequence of $m$-dependent variables; moreover, we consider constrained $U$-statistics, where the defining multiple sum only includes terms satisfying some restrictions on the gaps…

It is a classical fact that for any $\varepsilon > 0$, a random permutation of length $n = (1 + \varepsilon) k^2 / 4$ typically contains a monotone subsequence of length $k$. As a far-reaching generalization, Alon conjectured that a random…

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…

Assuming natural variational realization conjectures, we give uniform bounds for the obstruction to the integral Tate conjecture in 1-dimensional families of algebraic varieties over an infinite finitely generated field.

We enumerate permutations that avoid all but one of the $k$ patterns of length $k$ starting with a monotone increasing subsequence of length $k-1$. We compare the size of such permutation classes to the size of the class of permutations…

We compute the limiting distribution, as n approaches infinity, of the number of cycles of length between gamma n and delta n in a permutation of [n] chosen uniformly at random, for constants gamma, delta such that 1/(k+1) <= gamma < delta…

We prove two universality results for random tensors of arbitrary rank D. We first prove that a random tensor whose entries are N^D independent, identically distributed, complex random variables converges in distribution in the large N…

It is widely believed that the celebrated 2D Ising model at criticality has a universal and conformally invariant scaling limit, which is used in deriving many of its properties. However, no mathematical proof of universality and conformal…

We prove a general version of the classical Perron-Frobenius convergence property for reducible matrices. We then apply this result to reducible substitutions and use it to produce limit frequencies for factors and hence invariant measures…

We study the mixing properties of permutations obtained as a product of two uniformly random permutations of fixed cycle types. For instance, we give an exact formula for the probability that elements $1,2,...,k$ are in distinct cycles of…

Nourdin et al. [9] established the following universality result: if a sequence of off-diagonal homogeneous polynomial forms in i.i.d. standard normal random variables converges in distribution to a normal, then the convergence also holds…

We study norm-based uniform convergence bounds for neural networks, aiming at a tight understanding of how these are affected by the architecture and type of norm constraint, for the simple class of scalar-valued one-hidden-layer networks,…

We consider Bienaym\'e-Galton-Watson trees in random environment, where each generation $k$ is attributed a random offspring distribution $\mu_k$, and $(\mu_k)_{k\geq 0}$ is a sequence of independent and identically distributed random…