Related papers: Values of Random Polynomials at Integer Points
We consider orthogonal polynomials with respect to the weight $|z^2+a^2|^{cN}e^{-N|z|^2}$ in the whole complex plane. We obtain strong asymptotics and the limiting normalized zero counting measure (mother body) of the orthogonal polynomials…
We prove a uniform effective density theorem as well as an effective counting result for a generic system comprising a polynomial with a mild homogeneous condition and several linear forms using Roger's second moment formula for the Siegel…
In this paper non-asymptotic exponential estimates are derived for tail of maximum martingale distribution by naturally norming in the spirit of the classical Law of Iterated Logarithm. Key words: Martingales, exponential estimations,…
Maximum likelihood estimation in statistics leads to the problem of maximizing a product of powers of polynomials. We study the algebraic degree of the critical equations of this optimization problem. This degree is related to the number of…
We study random exponential sums of the form $\sum_{k=1}^nX_k\times\ex p\{i(\lambda_k^{(1)}t_1+...+\lambda_k^{(s)}t_s)\}$, where $\{X_n\}$ is a sequence of random variables and $\{\lambda_n^{(i)}:1\leq i\leq s\}$ are sequences of real…
We give explicit upper bounds for coefficients of polynomials appearing in Gauss-Kra\"{i}tchik formula for cyclotomic polynomials. We use a certain relation between elementary symmetric polynomials and power sums polynomials.
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…
The convergence rates on polynomial interpolation in most cases are estimated by Lebesgue constants. These estimates may be overestimated for some special points of sets for functions of limited regularities. In this paper, by applying the…
The standard approach for finding eigenvalues and eigenvectors of matrix polynomials starts by embedding the coefficients of the polynomial into a matrix pencil, known as linearization. Building on the pioneering work of Nakatsukasa and…
A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…
We consider asymptotics of ratios of random characteristic polynomials associated with orthogonal polynomial ensembles. Under some natural conditions on the measure in the definition of the orthogonal polynomial ensemble we establish a…
We present an algorithm for growing the denominator $r$ polygons containing a fixed number of lattice points and enumerate such polygons containing few lattice points for small $r$. We describe the Ehrhart quasi-polynomial of a rational…
The Robbins-Siegmund theorem establishes the convergence of stochastic processes that are almost supermartingales and is one of the most commonly used approaches for analyzing stochastic iterative algorithms in stochastic approximation and…
Several applications of the moment method in random matrix theory, especially, to local eigenvalue statistics at the spectral edges, are surveyed, with emphasis on a modification of the method involving orthogonal polynomials.
We give upper bounds for volume of sublevel sets of real polynomials. Our method is to combine a version of global Lojasiewicz inequality with some well known estimate on volume of tubes around real algebraic sets. Some applications to…
We study orthogonal and symplectic matrix models with polynomial potentials and multi interval supports of the equilibrium measure. For these models we find the bounds (similar to the case of hermitian matrix models) for the rate of…
In this paper we review and compare the numerical evaluation of those probability distributions in random matrix theory that are analytically represented in terms of Painlev\'e transcendents or Fredholm determinants. Concrete examples for…
In this manuscript, we provide local $L^q$-estimates for the gradient of solutions of a class of quasilinear equations whose principal part lacks strong monotonicity. These estimates are used to establish uniform large-scale $L^q$-estimates…
We consider random hermitian matrices in which distant above-diagonal entries are independent but nearby entries may be correlated. We find the limit of the empirical distribution of eigenvalues by combinatorial methods. We also prove that…
Using the Riemann Hypothesis over finite fields and bounds for the size of spherical codes, we give explicit upper bounds, of polynomial size with respect to the size of the field, for the number of geometric isomorphism classes of…