Related papers: Values of Random Polynomials at Integer Points

We establish effective equidistribution theorems, with a polynomial error rate, for orbits of unipotent subgroups in quotients of quasi-split, almost simple Linear algebraic groups of absolute rank 2. As an application, inspired by the…

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

We prove effective versions of Oppenheim's conjecture for generic inhomogeneous forms in the S-arithmetic setting. We prove an effective result for fixed rational shifts and generic forms and we also prove a result where both the quadratic…

Relying on the classical second moment formula of Rogers we give an effective asymptotic formula for the number of integer vectors $v$ in a ball of radius $t$, with value $Q(v)$ in a shrinking interval of size $t^{-\kappa}$, that is valid…

The celebrated result of Eskin, Margulis and Mozes (1998) and Dani and Margulis (1993) on quantitative Oppenheim conjecture says that for irrational quadratic forms $q$ of rank at least 5, the number of integral vectors $\mathbf v$ such…

We prove higher moment formulas for Siegel transforms defined over the space of unimodular $S$-lattices in $\mathbb Q_S^d$, $d\ge 3$, where in the real case, the formulas are introduced by Rogers (1955). As applications, we obtain the…

In recent developments, a general approach for solving Riemann--Hilbert problems numerically has been developed. We review this numerical framework, and apply it to the calculation of orthogonal polynomials on the real line. Combining this…

We propose an algebraic method for proving estimates on moments of stochastic integrals. The method uses qualitative properties of roots of algebraic polynomials from certain general classes. As an application, we give a new proof of a…

We give an effective method to compute the entropy for polynomials orthogonal on a segment of the real axis that uses as input data only the coefficients of the recurrence relation satisfied by these polynomials. This algorithm is based on…

The number of lattice points in $d$-dimensional hyperbolic or elliptic shells $\{m : a<Q[m]<b\}$, which are restricted to rescaled and growing domains $r\;\Omega$, is approximated by the volume. An effective error bound of order…

The paper deals with different properties of polynomials in random elements: bounds for characteristics functionals of polynomials, stochastic generalization of the Vinogradov mean value theorem, characterization problem, bounds for…

We establish that the optimal bound for the size of the smallest integral solution of the Oppenheim Diophantine approximation problem $\abs{Q(x)-\xi}< \epsilon$ for a generic ternary form $Q$ is $\abs{x}\ll \epsilon^{-1}$. We also establish…

We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…

Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…

We show that kernel-based quadrature rules for computing integrals can be seen as a special case of random feature expansions for positive definite kernels, for a particular decomposition that always exists for such kernels. We provide a…

We make explicit the exponential bound on the degrees of the polynomials appearing in the Effective Quillen-Suslin Theorem, and apply it jointly with the Hilbert-Burch Theorem to show that the syzygy module of a sequence of m polynomials in…

We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…

This paper contains some estimates for the {\it integral-uniform} norm and the uniform norm of a wide class of random polynomials. The family of integral-uniform norms introduced by Kasin and Tzafriri is a natural generalization of the…

We prove a sharp upper bound on the number of boundary lattice points of a rational polygon in terms of its denominator and the number of interior lattice points, generalizing Scott's inequality. We then give sharp lower and upper bounds on…

For any $\varepsilon > 0$ we derive effective estimates for the size of a non-zero integral point $m \in \mathbb{Z}^d \setminus \{0\}$ solving the Diophantine inequality $\lvert Q[m] \rvert < \varepsilon$, where $Q[m] = q_1 m_1^2 + \ldots +…