Related papers: Limit theorems for the hierarchy of freeness
We investigate the problem of showing that the values of a given polynomial are smooth (i.e., have no large prime factors) a positive proportion of the time. Although some results exist that bound the number of smooth values of a polynomial…
We introduce a hierarchical classification of theories that describe systems with fundamentally limited information content. This property is introduced in an operational way and gives rise to the existence of mutually complementary…
For a general one-sided nonautonomous dynamics defined by a sequence of linear operators, we consider the notion of a polynomial dichotomy with respect to a sequence of norms and we characterize it completely in terms of the admissibility…
We prove a central limit theorem with aassumptions which are many weak than classical conditions
We examine the behavior of the number of $k$-term arithmetic progressions in a random subset of $\mathbb{Z}/n\mathbb{Z}$. We prove that if a set is chosen by including each element of $\mathbb{Z}/n\mathbb{Z}$ independently with constant…
The occurrence and the distribution of patterns of trees associated to natural numbers are investigated. Bounds from above and below are proven for certain natural quantities.
In this paper, we extend the theory of minimal limit key polynomials of valuations on the polynomial ring $\kx$. We use the theory of cuts on ordered abelian groups to show that the previous results on bounded sets of key polynomials of…
Notions of freedom and independence for hypergraphs of models of a theory are defined. Properties of these notions and their applications to some natural classes of theories are studied.
Here we obtain the exact asymptotics for large and moderate deviations, strong law of large numbers and central limit theorem for chains with unbounded variable length memory.
We use Pesin theory to study possible equilibrium measures for piecewise monotone maps of the interval. The maps may have unbounded derivative.
This short note aims to give an insight to Arveson's boundary theorem by means of non-commutative Poisson boundaries and its applications.
We give a new, self-contained proof of the multidimensional central limit theorem using the technique of ``doubling variables," which is traditionally used to prove uniqueness of solutions of partial differential equations (PDEs). Our…
In a paper from 1995, Wormald gave general criteria for certain parameters in a family of discrete random processes to converge to the solution of a system of differential equations. Based on this method, we show that if some further…
We introduce a new natural notion of convergence for permutations at any specified scale, in terms of the density of patterns of restricted width. In this setting we prove that limits may be chosen independently at a countably infinite…
We define the parametric closure problem, in which the input is a partially ordered set whose elements have linearly varying weights and the goal is to compute the sequence of minimum-weight lower sets of the partial order as the weights…
This paper concerns with mesh restrictions that are needed to satisfy several important mathematical properties -- maximum principles, comparison principles, and the non-negative constraint -- for a general linear second-order elliptic…
We prove matching asymptotic lower and upper bounds on the variances of the intrinsic volumes and the number of $k$-faces of $d$-dimensional random beta-polytopes. Using Stein's methods, we establish central limit theorems for the intrinsic…
Long-range dependence in time series may yield non-central limit theorems. We show that there are analogous time series in free probability with limits represented by multiple Wigner integrals, where Hermite processes are replaced by…
For normalized sums $Z_n$ of i.i.d. random variables, we explore necessary and sufficient conditions which guarantee the normal approximation with respect to the R\'enyi divergence of infinite order. In terms of densities $p_n$ of $Z_n$,…
We provide polynomial upper bounds on the size of a shortest solution for quadratic equations in a free group. A similar bound is given for parametric solutions in the description of solutions sets of quadratic equations in a free group.