English
Related papers

Related papers: On uniform polynomial approximation

200 papers

The study of finite approximations of probability measures has a long history. In (Xu and Berger, 2017), the authors focus on constrained finite approximations and, in particular, uniform ones in dimension $d=1$. The present paper gives an…

Probability · Mathematics 2018-01-10 Julien Chevallier

We investigate approximation to a given real number by algebraic numbers and algebraic integers of prescribed degree. We deal with both best and uniform approximation, and highlight the similarities and differences compared with the…

Number Theory · Mathematics 2018-12-31 Johannes Schleischitz

It is known that, for each real number x such that 1,x,x^2 are linearly independent over Q, the uniform exponent of simultaneous approximation to (1,x,x^2) by rational numbers is at most (sqrt{5}-1)/2 (approximately 0.618) and that this…

Number Theory · Mathematics 2013-01-07 Stéphane Lozier , Damien Roy

We prove that the upper bound for the van der Corput property of the set of perfect squares is O((log n)^{-1/3}), giving an answer to a problem considered by Ruzsa and Montgomery. We do it by constructing non-negative valued, normed…

Number Theory · Mathematics 2010-03-22 Sinisa Slijepcevic

We give the first super-polynomial (in fact, mildly exponential) lower bounds for tolerant testing (equivalently, distance estimation) of monotonicity, unateness, and juntas with a constant separation between the "yes" and "no" cases.…

Computational Complexity · Computer Science 2023-09-25 Xi Chen , Anindya De , Yuhao Li , Shivam Nadimpalli , Rocco A. Servedio

A pair of probability distributions over $\{0,1\}^n$ is said to be $(k,\delta)$-wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $\delta$. Previous works introduced this concept and study when…

Computational Complexity · Computer Science 2026-05-14 Christopher Williamson

The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…

Commutative Algebra · Mathematics 2023-09-18 Ada Boralevi , Jasper van Doornmalen , Jan Draisma , Michiel E. Hochstenbach , Bor Plestenjak

In 1991, Baker and Harman proved, under the assumption of the generalized Riemann hypothesis, that $\max_{ \theta \in [0,1) }\left|\sum_{ n \leq x } \mu(n) e(n \theta) \right| \ll_\epsilon x^{3/4 + \epsilon}$. The purpose of this note is to…

Number Theory · Mathematics 2017-12-01 Sam Porritt

We study exponential sums whose coefficients are completely multiplicative and belong to the complex unit disc. Our main result shows that such a sum has substantial cancellation unless the coefficient function is essentially a Dirichlet…

Number Theory · Mathematics 2010-10-25 Leo Goldmakher

We show that the greatest prime factor of $n^2+h$ is at least $n^{1.312}$ infinitely often. This gives an unconditional proof for the range previously known under the Selberg eigenvalue conjecture. Furthermore, we get uniformity in $h \leq…

Number Theory · Mathematics 2025-06-02 Lasse Grimmelt , Jori Merikoski

We extend the proximity technique of Solymosi and Zahl [J. Combin. Theory, Ser. A (2024)] to the setting of trivariate polynomials. In particular, we prove the following result: Let $f(x,y,z)=(x-y)^2+(\varphi(x)-z)^2$, where $\varphi(x)\in…

Combinatorics · Mathematics 2025-10-15 Orit E. Raz

An upper bound for the Lebesgue constant (the supremum norm) of the operator of interpolation of a function in equally spaced points of a triangle by a polynomial of total degree less than or equal to n is obtained. Earlier, the rate of…

Numerical Analysis · Mathematics 2022-09-22 N Baidakova

We use Gale duality for polynomial complete intersections and adapt the proof of the fewnomial bound for positive solutions to obtain the bound (e^4+3) 2^(k choose 2) n^k/4 for the number of non-zero real solutions to a system of n…

Algebraic Geometry · Mathematics 2007-10-04 Daniel J. Bates , Frédéric Bihan , Frank Sottile

For $X(n)$ a Rademacher or Steinhaus random multiplicative function, we consider the random polynomials $$ P_N(\theta) = \frac1{\sqrt{N}} \sum_{n\leq N} X(n) e(n\theta), $$ and show that the $2k$-th moments on the unit circle $$ \int_0^1…

Number Theory · Mathematics 2023-11-23 Jacques Benatar , Alon Nishry , Brad Rodgers

A point (x1, x2) with coordinates in a subfield of R of transcendence degree one over Q, with 1, x1, x2 linearly independent over Q, may have a uniform exponent of approximation by elements of Q^2 that is strictly larger than the lower…

Number Theory · Mathematics 2012-05-22 Damien Roy

In this paper, we provide an efficient method for computing the Taylor coefficients of $1-p_n f$, where $p_n$ denotes the optimal polynomial approximant of degree $n$ to $1/f$ in a Hilbert space $H^2_\omega$ of analytic functions over the…

Complex Variables · Mathematics 2019-11-22 Catherine Bénéteau , Myrto Manolaki , Daniel Seco

We consider the convex hull of a finite sample of i.i.d. points uniformly distributed in a convex body in $\R^d$, $d\geq 2$. We prove an exponential deviation inequality, which leads to rate optimal upper bounds on all the moments of the…

Statistics Theory · Mathematics 2013-11-13 Victor-Emmanuel Brunel

We approximate intersection numbers $\big\langle \psi_1^{d_1}\cdots \psi_n^{d_n}\big\rangle_{g,n}$ on Deligne-Mumford's moduli space $\overline{\mathcal M}_{g,n}$ of genus $g$ stable complex curves with $n$ marked points by certain…

Geometric Topology · Mathematics 2020-10-19 Vincent Delecroix , Élise Goujard , Peter Zograf , Anton Zorich

In this paper, we obtain a sharp upper bound for the sum of the first $k$-th eigenvalues for this Dirichlet problem of poly-Laplacian with any order, which is viewed as an extension of the result due to Cheng and Wei (Journal of…

Differential Geometry · Mathematics 2016-05-13 Lingzhong Zeng

Considering simultaneous approximation to three numbers, we study the geometry of the sequence of best approximations. We provide a sharper lower bound for the ratio between ordinary and uniform exponent of Diophantine approximation,…

Number Theory · Mathematics 2024-01-18 Antoine Marnat , Nikolay Moshchevitin
‹ Prev 1 3 4 5 6 7 10 Next ›