arXiv subjects
Publications and source records attributed to Igor E. Pritsker.
In this note we study the number of real roots of a wide class of random orthogonal polynomials with gaussian coefficients. Using the method of Wiener Chaos we show that the fluctuation in the bulk is asymptotically gaussian, even when the local correlations are not necessarily the same.
We give a Schinzel-Zassenhaus-type lower bound for the maximum modulus of roots of a monic integer polynomial with all roots symmetric with respect to the unit circle. Our results extend a recent work of Dimitrov, who proved the general Schinzel-Zassenhaus conjecture by using the Pólya rationality theorem for a power series with integer coefficients, and some estimates for logarithmic capacity (transfinite diameter) of sets. We use an enhancement of Pólya's result obtained by Robinson, which involves Laurent-type rational functions with small supremum norms, thereby replacing the logarithmic capacity with a smaller quantity. This smaller quantity is expressed via a weighted Chebyshev constant for the set associated with Dimitrov's function used in Robinson's rationality theorem. Our lower bound for the house confirms a conjecture of Boyd.
We determine the asymptotics for the variance of the number of zeros of random linear combinations of orthogonal polynomials of degree $\leq n$ in subintervals $\left [ a,b\right ] $ of the support of the underlying orthogonality measure $μ$. We show that, as $n\rightarrow \infty $, this variance is asymptotic to $cn$, for some explicit constant $c>0$.
We study the expected number of real zeros for random linear combinations of orthogonal polynomials. It is well known that Kac polynomials, spanned by monomials with i.i.d. Gaussian coefficients, have only $(2/π+ o(1))\log{n}$ expected real zeros in terms of the degree $n$. If the basis is given by the orthonormal polynomials associated with a compactly supported Borel measure on the real line, or associated with a Freud weight defined on the whole real line, then random linear combinations have $n/\sqrt{3} + o(n)$ expected real zeros. We prove that the same asymptotic relation holds for all random orthogonal polynomials on the real line associated with a large class of weights, and give local results on the expected number of real zeros. We also show that the counting measures of properly scaled zeros of these random polynomials converge weakly to either the Ullman distribution or the arcsine distribution.
We study global distribution of zeros for a wide range of ensembles of random polynomials. Two main directions are related to almost sure limits of the zero counting measures, and to quantitative results on the expected number of zeros in various sets. In the simplest case of Kac polynomials, given by the linear combinations of monomials with i.i.d. random coefficients, it is well known that their zeros are asymptotically uniformly distributed near the unit circumference under mild assumptions on the coefficients. We give estimates of the expected discrepancy between the zero counting measure and the normalized arclength on the unit circle. Similar results are established for polynomials with random coefficients spanned by different bases, e.g., by orthogonal polynomials. We show almost sure convergence of the zero counting measures to the corresponding equilibrium measures for associated sets in the plane, and quantify this convergence. Random coefficients may be dependent and need not have identical distributions in our results.
We study the expected number of real zeros for random linear combinations of orthogonal polynomials. It is well known that Kac polynomials, spanned by monomials with i.i.d. Gaussian coefficients, have only $(2/π+ o(1))\log{n}$ expected real zeros in terms of the degree $n$. On the other hand, if the basis is given by orthonormal polynomials associated to a finite Borel measure with compact support on the real line, then random linear combinations have $n/\sqrt{3} + o(n)$ expected real zeros under mild conditions. We prove that the latter asymptotic relation holds for all random orthogonal polynomials on the real line associated with Freud weights, and give local results on the expected number of real zeros. We also show that the counting measures of properly scaled zeros of random Freud polynomials converge weakly to the Ullman distribution.
Zeros of many ensembles of polynomials with random coefficients are asymptotically equidistributed near the unit circumference. We give quantitative estimates for such equidistribution in terms of the expected discrepancy and expected number of roots in various sets. This is done for polynomials with coefficients that may be dependent, and need not have identical distributions. We also study random polynomials spanned by various deterministic bases.
Schur introduced the problem on the smallest limit point for the arithmetic means of totally positive conjugate algebraic integers. This area was developed further by Siegel, Smyth and others. We consider several generalizations of the problem that include questions on the smallest limit points of symmetric means. The key tool used in the study is the asymptotic distribution of algebraic numbers understood via the weak* limits of their counting measures. We establish interesting properties of the limiting measures, and find the smallest limit points of symmetric means for totally positive algebraic numbers of small height.
We study several related problems on polynomials with integer coefficients. This includes the integer Chebyshev problem, and the Schur problems on means of algebraic numbers. We also discuss interesting applications to approximation by polynomials with integer coefficients, and to the growth of coefficients for polynomials with roots located in prescribed sets. The distribution of zeros for polynomials with integer coefficients plays an important role in all of these problems.
We study asymptotic clustering of zeros of random polynomials, and show that the expected discrepancy of roots of a polynomial of degree $n$, with not necessarily independent coefficients, decays like $\sqrt{\log n/n}$. Our proofs rely on discrepancy results for deterministic polynomials, and order statistics of a random variable. We also consider the expected number of zeros lying in certain subsets of the plane, such as circles centered on the unit circumference, and polygons inscribed in the unit circumference.
We study inequalities for the infima of Green potentials on a compact subset of an arbitrary domain in the complex plane. The results are based on a new representation of the pseudohyperbolic farthest-point distance function via a Green potential. We also give applications to sharp inequalities for the supremum norms of Blaschke products.
Schur studied limits of the arithmetic means $s_n$ of zeros for polynomials of degree $n$ with integer coefficients and simple zeros in the closed unit disk. If the leading coefficients are bounded, Schur proved that $\limsup_{n\to\infty} |s_n| \le 1-\sqrt{e}/2.$ We show that $s_n \to 0$, and estimate the rate of convergence by generalizing the Erdős-Turán theorem on the distribution of zeros.
Schur studied limits of the arithmetic means $A_n$ of zeros for polynomials of degree $n$ with integer coefficients and simple zeros in the closed unit disk. If the leading coefficients are bounded, Schur proved that $\limsup_{n\to\infty} |A_n| \le 1-\sqrt{e}/2.$ We show that $A_n \to 0$, and estimate the rate of convergence by generalizing the Erdős-Turán theorem on the distribution of zeros. As an application, we show that integer polynomials have some unexpected restrictions of growth on the unit disk. Schur also studied problems on means of algebraic numbers on the real line. When all conjugate algebraic numbers are positive, the problem of finding the sharp lower bound for $\liminf_{n\to\infty} A_n$ was developed further by Siegel and others. We provide a solution of this problem for algebraic numbers equidistributed in subsets of the real line. Potential theoretic methods allow us to consider distribution of algebraic numbers in or near general sets in the complex plane. We introduce the generalized Mahler measure, and use it to characterize asymptotic equidistribution of algebraic numbers in arbitrary compact sets of capacity one. The quantitative aspects of this equidistribution are also analyzed in terms of the generalized Mahler measure.
We study the asymptotic equidistribution of points near arbitrary compact sets of positive capacity in $\R^d,\ d\ge 2$. Our main tools are the energy estimates for Riesz potentials. We also consider the quantitative aspects of this equidistribution in the classical Newtonian case. In particular, we quantify the weak convergence of discrete measures to the equilibrium measure, and give the estimates of convergence rates for discrete potentials to the equilibrium potential.
We study the asymptotic equidistribution of points with discrete energy close to Robin's constant of a compact set in the plane. Our main tools are the energy estimates from potential theory. We also consider the quantitative aspects of this equidistribution. Applications include estimates of growth for the Fekete and Leja polynomials associated with large classes of compact sets, convergence rates of the discrete energy approximations to Robin's constant, and problems on the means of zeros of polynomials with integer coefficients.
The original Gelfond-Schnirelman method, proposed in 1936, uses polynomials with integer coefficients and small norms on $[0,1]$ to give a Chebyshev-type lower bound in prime number theory. We study a generalization of this method for polynomials in many variables. Our main result is a lower bound for the integral of Chebyshev's $ψ$-function, expressed in terms of the weighted capacity. This extends previous work of Nair and Chudnovsky, and connects the subject to the potential theory with external fields generated by polynomial-type weights. We also solve the corresponding potential theoretic problem, by finding the extremal measure and its support.
We study the uniform approximation of the canonical conformal mapping, for a Jordan domain onto the unit disk, by polynomials generated from the partial sums of the Szegő kernel expansion. These polynomials converge to the conformal mapping uniformly on the closure of any Smirnov domain. We prove estimates for the rate of such convergence on domains with piecewise analytic boundaries, expressed through the smallest exterior angle at the boundary. Furthermore, we show that the rate of approximation on compact subsets inside the domain is essentially the square of that on the closure. Two standard applications to the rate of decay for the contour orthogonal polynomials inside the domain, and to the rate of locally uniform convergence of Fourier series are also given.
We consider a version of height on polynomial spaces defined by the integral over the normalized area measure on the unit disk. This natural analog of Mahler's measure arises in connection with extremal problems for Bergman spaces. It inherits many nice properties such as the multiplicative one. However, this height is a lower bound for Mahler's measure, and it can be substantially lower. We discuss some similarities and differences between the two.