相关论文: Estimates for Norms of Random Polynomials
Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…
Sum rules are elegant formulas that relate entropy functionals to coefficients associated with orthogonal polynomials [Sim11]. In a series of paper (see for example [GNR16], [GNR17], [BSZ18a], [BSZ18b]), interesting connections have been…
We prove uniform estimates for the expected value of averages of order statistics of bivariate functions in terms of their largest values by a direct analysis. As an application, uniform estimates for the expected value of averages of order…
We estimate Gowers uniformity norms for some classical automatic sequences, such as the Thue-Morse and Rudin-Shapiro sequences. The methods can also be extended to other automatic sequences. As an application, we asymptotically count…
In this paper, we analyze the set of all possible aggregate distributions of the sum of standard uniform random variables, a simply stated yet challenging problem in the literature of distributions with given margins. Our main results are…
We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…
This paper introduces the notion of probabilistic zero bounds for random polynomials. It presents new results regarding the probabilistic bounds of random polynomials whose coefficients are independently and identically distributed as…
For two families of random polytopes we compute explicitly the expected sums of the conic intrinsic volumes and the Grassmann angles at all faces of any given dimension of the polytope under consideration. As special cases, we compute the…
We introduce a series of numbers which serve as a generalization of Bernoulli, Euler numbers and binomial coefficients. Their properties are applied to solve a probability problem and suggest a statistical test for independence and…
We obtain the sharp lower bound for the uniform norm of the orthogonal polynomials in the Steklov class. We also prove the sharp estimates for the polynomial entropy in this class.
Keating and Snaith showed that the $2k^{th}$ absolute moment of the characteristic polynomial of a random unitary matrix evaluated on the unit circle is given by a polynomial of degree $k^2$. In this article, uniform asymptotics for the…
We estimate the norms of standard Gaussian random Toeplitz and circulant matrices and their inverses, mostly by means of combining some basic techniques of linear algebra. In the case of circulant matrices we obtain sharp probabilistic…
Let $X_N$ be a random trigonometric polynomial of degree $N$ with iid coefficients and let $Z_N(I)$ denote the (random) number of its zeros lying in the compact interval $I\subset\mathbb{R}$. Recently, a number of important advances were…
This paper contains an answer to the question of existence of regularities of the so called \textit{random in a broad sense} mass phenomena, asked by A. N. Kolmogorov in \cite{Kolmogorov}. It turns out that some family of finitely-additive…
We study the characteristic polynomial of random permutation matrices following some measures which are invariant by conjugation, including Ewens' measures which are one-parameter deformations of the uniform distribution on the permutation…
We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…
We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…
In this article we study asymptotic behavior of the probability that a random monic polynomial with integer coefficients is irreducible over the integers. We consider the cases where the coefficients grow together with the degree of the…
We compute averages of products and ratios of characteristic polynomials associated with Orthogonal, Unitary, and Symplectic Ensembles of Random Matrix Theory. The pfaffian/determinantal formulas for these averages are obtained, and the…
We prove a parametric generalization of the classical Poincare-Perron theorem on stabilizing recurrence relations where we assume that the varying coefficients of a recurrence depend on auxiliary parameters and converge uniformly in these…