English
Related papers

Related papers: Polynomial approximation avoiding values in counta…

200 papers

We investigate affine Berkovich spaces over maximally complete fields and prove that they may be approximated by simpler spaces when the only functions we need to evaluate are polynomials of bounded degree. We derive applications to…

Algebraic Geometry · Mathematics 2012-04-17 Jérôme Poineau

Sendov's conjecture asserts that if a complex polynomial $f$ of degree $n \geq 2$ has all of its zeroes in closed unit disk $\{ z: |z| \leq 1 \}$, then for each such zero $\lambda_0$ there is a zero of the derivative $f'$ in the closed unit…

Complex Variables · Mathematics 2022-06-02 Terence Tao

Given a finite simplicial complex $\mathcal{K}$ in $\mathbb{R}^n$ and a real algebraic variety $Y,$ by a $\mathcal{K}$-regular map $|\mathcal{K}|\rightarrow Y$ we mean a continuous map whose restriction to every simplex in $\mathcal{K}$ is…

Algebraic Geometry · Mathematics 2025-03-24 Marcin Bilski , Wojciech Kucharz

We study the solution set to multivariate Chebyshev approximation problem, focussing on the ill-posed case when the uniqueness of solutions can not be established via strict polynomial separation. We obtain an upper bound on the dimension…

Optimization and Control · Mathematics 2019-09-02 Vera Roshchina , Nadia Sukhorukova , Julien Ugon

Let $\cP_n$ be the space of homogeneous polynomials of degree $n$ on $\bbR^{m+1}$. We consider the asymptotic behavior of some coefficients relating to the decomposition of $\cP_n$ into the sum of $\SO(m+1)$-irreducible components. Using…

Classical Analysis and ODEs · Mathematics 2018-02-27 V. Gichev

Recent years have witnessed the introduction and development of extremely fast rational function algorithms. Many ideas in this realm arose from polynomial-based linear-algebraic algorithms. However, polynomial approximation is occasionally…

Numerical Analysis · Mathematics 2025-10-03 James Chok , Geoffrey M. Vasil

Given $k\in N$, a nonnegative function $f\in C^r[a,b]$, $r\ge 0$, an arbitrary finite collection of points $\big\{\alpha_i\big\}_{i\in J} \subset [a,b]$, and a corresponding collection of nonnegative integers $\big\{m_i\big\}_{i\in J}$ with…

Classical Analysis and ODEs · Mathematics 2023-05-04 German Dzyubenko , Kirill A. Kopotun

Let $A(K)$ be the algebra of continuous functions on a compact set $K\subset\mathbb C$ which are analytic on the interior of $K$, and $R(K)$ the closure (with the uniform convergence on $K$) of the functions that are analytic on a…

Classical Analysis and ODEs · Mathematics 2019-02-19 Albert Mas

Let $K\subset\mathbb{C}$ be non-polar, compact and polynomially convex. We study the limits of equilibrium measures on preimages of compact sets, under $K$-regular sequences of polynomials, that center on $K$ and under the sequences of…

Dynamical Systems · Mathematics 2025-12-12 Christian Henriksen , Carsten Lunde Petersen , Eva Uhre

This paper presents a novel method for generating a single polynomial approximation that produces correctly rounded results for all inputs of an elementary function for multiple representations. The generated polynomial approximation has…

Mathematical Software · Computer Science 2022-03-18 Mridul Aanjaneya , Jay P. Lim , Santosh Nagarakatte

In this article, we prove approximation theorems in classes of deep and shallow neural networks with analytic activation functions by elementary arguments. We prove for both real and complex networks with non-polynomial activation that the…

Machine Learning · Computer Science 2022-03-28 Josiah Park , Stephan Wojtowytsch

For the principal eigenvalue of discrete weighted $p$-Laplacian on the set of nonnegative integers, the convergence of an approximation procedure and the inverse iteration is proved. Meanwhile, in the proof of the convergence, the…

Probability · Mathematics 2019-03-11 Yue-Shuang Li

We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the discriminant valuation, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater than…

Number Theory · Mathematics 2019-11-12 Adrien Poteaux , Martin Weimann

We study the approximation capabilities of two families of univariate polynomials that arise in applications of quantum signal processing. Although approximation only in the domain $[0,1]$ is physically desired, these polynomial families…

Classical Analysis and ODEs · Mathematics 2022-04-11 Rahul Sarkar , Theodore J. Yoder

The study of inner and cyclic functions in $\ell^p_A$ spaces requires a better understanding of the zeros of the so-called optimal polynomial approximants. We determine that a point of the complex plane is the zero of an optimal polynomial…

Complex Variables · Mathematics 2021-04-19 Raymond Cheng , William T. Ross , Daniel Seco

A polynomial $p\in\mathbb{R}[z_1,\dots,z_n]$ is real stable if it has no roots in the upper-half complex plane. Gurvits's permanent inequality gives a lower bound on the coefficient of the $z_1z_2\dots z_n$ monomial of a real stable…

Data Structures and Algorithms · Computer Science 2017-02-10 Nima Anari , Shayan Oveis Gharan

In this note, we prove that every open primary basic semialgebraic set is stably equivalent to the realization space of an even-dimensional neighborly polytope. This in particular provides the final step for Mn\"ev's proof of the…

Metric Geometry · Mathematics 2014-10-01 Karim A. Adiprasito , Arnau Padrol

We investigate random compact sets with random functions defined thereon, such as polynomials, rational functions, the pluricomplex Green function and the Siciak extremal function. One surprising consequence of our study is that randomness…

Complex Variables · Mathematics 2020-11-06 Paul M. Gauthier , Thomas Ransford , Simon St-Amant , Jérémie Turcotte

In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…

Commutative Algebra · Mathematics 2016-01-05 Elzbieta Adamus , Pawel Bogdan , Teresa Crespo , Zbigniew Hajto

The problem of finding the distance from a given $n \times n$ matrix polynomial of degree $k$ to the set of matrix polynomials having the elementary divisor $(\lambda-\lambda_0)^j, \, j \geqslant r,$ for a fixed scalar $\lambda_0$ and $2…

Numerical Analysis · Mathematics 2019-11-05 Biswajit Das , Shreemayee Bora
‹ Prev 1 4 5 6 7 8 10 Next ›