Related papers: Values of random polynomials in shrinking targets

Associated to each complex-valued random variable satisfying appropriate integrability conditions, we introduce a different generalization of the Stirling numbers of the second kind. Various equivalent definitions are provided. Attention,…

The goal of this paper is to prove that a random polynomial with i.i.d. random coefficients taking values uniformly in $\{1,\ldots, 210\}$ is irreducible with probability tending to $1$ as the degree tends to infinity. Moreover, we prove…

Let $\mathbb{P}_{\kappa}(n)$ be the probability that $n$ points $z_1,\ldots,z_n$ picked uniformly and independently in $\mathfrak{C}_\kappa$, a regular $\kappa$-gon with area $1$, are in convex position, that is, form the vertex set of a…

Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…

We complete the program outlined in the paper of the author with A. Migdal and sum up exactly all the fluctuations around the instanton solution of the randomly large scale driven Burgers equation. We choose the force correlation function…

Let $V$ be a valuation ring of a global field $K$. We show that for all positive integers $k$ and $1 < n_1 \leq \ldots \leq n_k$ there exists an integer-valued polynomial on $V$, that is, an element of $\text{Int}(V) = \{ f \in K[X] \mid…

We prove an asymptotic formula with a power-saving error term for a specific weighted second moment of $\mathrm{GL}(2)\times \mathrm{GL}(2)$ Rankin-Selberg $L$-function, $L(1/2,\pi\otimes \pi_0)$ over any number field $F$ where $\pi$ runs…

We refine a recent heuristic developed by Keating and the second author. Our improvement leads to a new integral expression for the conjectured asymptotic formula for shifted moments of the Riemann zeta-function. This expression is…

We consider the simple random walk on the $N$-dimensional integer lattice from the perspective of evaluating asymptotically the duration of play in the multidimensional gambler\apost s ruin problem. We show that, under suitable rescalings,…

This paper considers a problem that relates to the theories of covering arrays, permutation patterns, Vapnik-Chervonenkis (VC) classes, and probability thresholds. Specifically, we want to find the number of subsets of [n]:={1,2,....,n} we…

We derive a Gaussian approximation result for the maximum of a sum of random vectors under $(2+\iota)$-th moments. Our main theorem is abstract and nonasymptotic, and can be applied to a variety of statistical learning problems. The proof…

In this paper, we establish the existence of the efficient solutions for polynomial vector optimization problems on a nonempty closed constraint set without any convexity and compactness assumptions. We first introduce the relative…

We consider the Bohr radius $R_n$ for the class of complex polynomials in one variable of degree at most $n$. It was conjectured by R. Fournier in 2008 that $R_n={1\over 3}+{\pi^2\over {3n^2}}+o({1\over n^2})$. We shall prove this…

Starting from Montgomery's conjecture, there has been a substantial interest on the connections of random matrix theory and the theory of L-functions. In particular, moments of characteristic polynomials of random matrices have been…

We consider polynomials which take integer values on the integers (IVPs), and satisfy an additional growth condition on the natural numbers. Elkies and Speyer, answering a question by Dimitrov, showed there is a critical exponential growth…

We consider the nonlinear integer programming problem of minimizing a quadratic function over the integer points in variable dimension satisfying a system of linear inequalities. We show that when the Graver basis of the matrix defining the…

We classify all post-critically finite unicritical polynomials defined over the maximal totally real algebraic extension of ${\mathbb Q}$. Two auxiliary results used in the proof of this result may be of some independent interest. The first…

The joint moments of the derivatives of the characteristic polynomial of a random unitary matrix, and also a variant of the characteristic polynomial that is real on the unit circle, in the large matrix size limit, have been studied…

Random tensors can be used to produce random matrices. This idea is, for instance, very natural when one studies random quantum states with the aim of exploring properties that are generically true, or true with some probability. We hereby…

In this work, we exhibit a hierarchy of polynomial time algorithms solving approximate variants of the Closest Vector Problem (CVP). Our first contribution is a heuristic algorithm achieving the same distance tradeoff as HSVP algorithms,…