English
Related papers

Related papers: Bounds on strong unicity for Chebyshev approximati…

200 papers

A uniform bound of intersection multiplicities of curves and divisors on abelian varieties is proved by algebraic geometric methods. It extends and improves a result obtained by A. Buium with a different method based on Kolchin's…

Algebraic Geometry · Mathematics 2007-05-23 Junjiro Noguchi , Joerg Winkelmann

We establish new results of first-order necessary conditions of optimality for finite-dimensional problems with inequality constraints and for problems with equality and inequality constraints, in the form of John's theorem and in the form…

Optimization and Control · Mathematics 2014-09-09 Joël Blot

The Durand-Kerner algorithm is a widely used iterative technique for simultaneously finding all the roots of a polynomial. However, its convergence heavily depends on the choice of initial approximations. This paper introduces two novel…

Numerical Analysis · Mathematics 2025-11-12 B. A. Sanjoyo , M. Yunus , N. Hidayat

In this paper, we address the problem of constructing a uniform probability measure on $\mathbb{N}$. Of course, this is not possible within the bounds of the Kolmogorov axioms and we have to violate at least one axiom. We define a…

Probability · Mathematics 2017-02-02 Timber Kerkvliet , Ronald Meester

The present paper concerns filtered de la Vall\'ee Poussin (VP) interpolation at the Chebyshev nodes of the four kinds. This approximation model is interesting for applications because it combines the advantages of the classical Lagrange…

Numerical Analysis · Mathematics 2021-01-13 D. Occorsio , W. Themistoclakis

Deriving generalization bounds for stable algorithms is a classical question in learning theory taking its roots in the early works by Vapnik and Chervonenkis (1974) and Rogers and Wagner (1978). In a series of recent breakthrough papers by…

Machine Learning · Computer Science 2020-05-27 Olivier Bousquet , Yegor Klochkov , Nikita Zhivotovskiy

A Chebyshev-type quadrature for a probability measure sigma is a distribution which is uniform on n points and has the same first k moments as sigma. We give an upper bound for the minimal n required to achieve a given degree k, for sigma…

Classical Analysis and ODEs · Mathematics 2017-03-14 Ron Peled

We consider probability measures on the real line or unit circle with Jacobi or Verblunsky coefficients satisfying an $\ell^p$ condition and a generalized bounded variation condition. This latter condition requires that a sequence can be…

Spectral Theory · Mathematics 2011-12-19 Milivoje Lukic

Entropic Brenier maps are regularized analogues of Brenier maps (optimal transport maps) which converge to Brenier maps as the regularization parameter shrinks. In this work, we prove quantitative stability bounds between entropic Brenier…

Probability · Mathematics 2024-04-04 Vincent Divol , Jonathan Niles-Weed , Aram-Alexandre Pooladian

Inspired by the work of Bourgain and Garaev (2013), we provide new bounds for certain weighted bilinear Kloosterman sums in polynomial rings over a finite field. As an application, we build upon and extend some results of Sawin and…

Number Theory · Mathematics 2026-01-28 Christian Bagshaw

We study the fundamental challenge of exhibiting explicit functions that have small correlation with low-degree polynomials over $\mathbb{F}_{2}$. Our main contributions include: 1. In STOC 2020, CHHLZ introduced a new technique to prove…

Computational Complexity · Computer Science 2023-11-17 Peter Ivanov , Liam Pavlovic , Emanuele Viola

We study the problem of distinguishing between two symmetric probability distributions over $n$ bits by observing $k$ bits of a sample, subject to the constraint that all $k-1$-wise marginal distributions of the two distributions are…

Computational Complexity · Computer Science 2021-03-16 Christopher Williamson

We generalize an equidistribution theorem \`a la Bader-Muchnik for operator-valued measures constructed from a family of boundary representations associated with Gibbs measures in the context of convex cocompact discrete group of isometries…

Group Theory · Mathematics 2016-01-12 Adrien Boyer , Dustin Mayeda

To improve convergence results obtained using a framework for unsymmetric meshless methods due to Schaback (Preprint G\"ottingen 2006), we extend, in two directions, the Sobolev bound due to Arcang\'eli et al. (Numer Math 107, 181-211,…

Numerical Analysis · Mathematics 2009-05-14 Andrew Corrigan , John Wallin , Thomas Wanner

On the half line we introduce a new sequence of near--best uniform approximation polynomials, easily computable by the values of the approximated function at a truncated number of Laguerre zeros. Such approximation polynomials come from a…

Numerical Analysis · Mathematics 2024-02-14 Occorsio Donatella , Woula Themistoclakis

Suppose that some harmonic analysis arguments have been invoked to show that the indicator function of a set of residue classes modulo some integer has a large Fourier coefficient. To get information about the structure of the set of…

Number Theory · Mathematics 2008-12-31 Øystein J. Rødseth

We study best approximation to a given function, in the least square sense on a subset of the unit circle, by polynomials of given degree which are pointwise bounded on the complementary subset. We show that the solution to this problem, as…

Functional Analysis · Mathematics 2017-10-31 L Baratchart , Juliette Leblond , Fabien Seyfert

We study the Hardy inequality when the singularity is placed on the boundary of a bounded domain in $\mathbb{R}^n$ that satisfies both an interior and exterior ball condition at the singularity. We obtain the sharp Hardy constant $n^2/4$ in…

Analysis of PDEs · Mathematics 2018-04-06 Gerassimos Barbatis , Stathis Filippas , Achilles Tertikas

A common problem in analytic number theory is to bound the sum of an arithmetic function over a set of integers. Nair and Tenenbaum found a very general bound that applies to short sums of a multivariable arithmetic function over polynomial…

Number Theory · Mathematics 2015-05-27 Kevin Henriot

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
‹ Prev 1 8 9 10 Next ›