English
Related papers

Related papers: The uniform distribution of sequences generated by…

200 papers

In the study of the cyclicity of a function $f$ in reproducing kernel Hilbert spaces an important role is played by sequences of polynomials $\{p_n\}_{n\in \mathbb{N}}$ called \emph{optimal polynomial approximants} (o.p.a.). For many such…

Complex Variables · Mathematics 2021-10-14 Antonio Acuaviva , Daniel Seco

Suppose that $\langle f_n \rangle$ is a sequence of polynomials, $\langle f_n^{(k)}(0)\rangle$ converges for every non-negative integer $k$, and that the limit is not $0$ for some $k$. It is shown that if all the zeros of $f_1, f_2, \dots$…

Complex Variables · Mathematics 2019-03-05 Min-Hee Kim , Young-One Kim , Jungseob Lee

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…

Probability · Mathematics 2022-04-29 Grigory Terlov

We prove large (and moderate) deviations for a class of linear combinations of spacings generated by i.i.d. exponentially distributed random variables. We allow a wide class of coefficients which can be expressed in terms of continuous…

Probability · Mathematics 2021-09-07 Camilla Calì , Maria Longobardi , Claudio Macci , Barbara Pacchiarotti

For a sequence of continuous, monotone functions $f_1,\dots,f_n \colon I \to \mathbb{R}$ ($I$ is an interval) we define the mapping $M \colon I^n \to I^n$ as a Cartesian product of quasi-arithmetic means generated by $f_j$-s. It is known…

Classical Analysis and ODEs · Mathematics 2019-01-14 Paweł Pasteczka

We show that the Riemannian Gaussian distributions on symmetric spaces, introduced in recent years, are of standard random matrix type. We exploit this to compute analytically marginals of the probability density functions. This can be done…

Mathematical Physics · Physics 2021-10-29 Leonardo Santilli , Miguel Tierz

Let A be an n by n random matrix with iid entries taken from the p-adic integers or Z/NZ. Then under mild non-degeneracy conditions the cokernel of A has a universal probability distribution. In particular, the p-part of an iid random…

Combinatorics · Mathematics 2013-07-08 Kenneth Maples

Let $\lambda(n)$ denote the exponent of the multiplicative group modulo $n$. We show that when $q$ is odd, each coprime residue class modulo $q$ is hit equally often by $\lambda(n)$ as $n$ varies. Under the stronger assumption that…

Number Theory · Mathematics 2023-03-27 Paul Pollack

Let f(x) be a primitive irreducible polynomial with integer coefficients of degree greater than one. In 1964, Hooley showed that the sequence of normalized roots u/n, where f(u) = 0(n), ordered in the obvious way, is uniformly distributed…

Number Theory · Mathematics 2020-03-31 Sa'ar Zehavi

We consider a non-commutative polynomial in several independent $N$-dimensional random unitary matrices, uniformly distributed over the unitary, orthogonal or symmetric groups, and assume that the coefficients are $n$-dimensional matrices.…

Probability · Mathematics 2024-01-11 Charles Bordenave , Benoit Collins

We consider the empirical eigenvalue distribution of an $m\times m$ principle submatrix of an $n\times n$ random unitary matrix distributed according to Haar measure. Earlier work of Petz and R\'effy identified the limiting spectral measure…

Probability · Mathematics 2019-04-12 Elizabeth Meckes , Kathryn Stewart

The Newton polytope $P_f$ of a polynomial $f$ is well known to have a strong impact on its zeros, as in the Kouchnirenko-Bernstein theorem on the number of simultaneous zeros of $m$ polynomials with given Newton polytopes. In this article,…

Algebraic Geometry · Mathematics 2007-05-23 Bernard Shiffman , Steve Zelditch

Generalized polynomials are mappings obtained from the conventional polynomials by the use of operations of addition, multiplication and taking the integer part. Extending the classical theorem of H. Weyl on equidistribution of polynomials,…

Dynamical Systems · Mathematics 2019-11-15 Vitaly Bergelson , Inger J. Håland Knutson , Younghwan Son

Given a subset $\mathcal{S}\subseteq \mathbb{F}_q[x]$ and fixed integers $n,m\in \mathbb{N}$, we study the distribution of the smallest denominator $Q\in \mathcal{S}$ for which there exists $\mathbf{P}\in \mathbb{F}_q[x]^m$ such that…

Number Theory · Mathematics 2026-03-25 Noy Soffer Aranov

Denote by $x$ a random infinite path in the graph of Pascal's triangle (left and right turns are selected independently with fixed probabilities) and by $d_n(x)$ the binomial coefficient at the $n$'th level along the path $x$. Then for a…

Dynamical Systems · Mathematics 2007-05-23 Terrence M. Adams , Karl E. Petersen

If the coefficients of polynomials are selected by some random process, the zeros of the resulting polynomials are in some sense random. In this paper the author rephrases the above in more precise language, and calculates the joint…

Probability · Mathematics 2012-11-26 Kerry M. Soileau

If f is a polynomial with integer coefficients and q is an integer, we may regard f as a map from Z/qZ to Z/qZ. We show that the distribution of the (normalized) spacings between consecutive elements in the image of these maps becomes…

Number Theory · Mathematics 2007-05-23 P. Kurlberg

Let $\mathscr{C}_\mathbb{Z}([0,1])$ be the metric space of real-valued continuous functions on $[0,1]$ with integer values at $0$ and $1$, equipped with the uniform (supremum) metric $d_\infty$. It is a classical theorem in approximation…

Number Theory · Mathematics 2023-11-21 C. Sinan Güntürk , Weilin Li

We show that the expected value of the mean width of a random polytope generated by $N$ random vectors ($n\leq N\leq e^{\sqrt n}$) uniformly distributed in an isotropic convex body in $\R^n$ is of the order $\sqrt{\log N} L_K$. This…

Functional Analysis · Mathematics 2012-05-29 David Alonso-Gutierrez , Joscha Prochno

We characterize the symmetric distributions that can be (approximately) generated by shallow Boolean circuits. More precisely, let $f\colon \{0,1\}^m \to \{0,1\}^n$ be a Boolean function where each output bit depends on at most $d$ input…

Computational Complexity · Computer Science 2025-11-19 Daniel M. Kane , Anthony Ostuni , Kewen Wu