English
Related papers

Related papers: Low degree approximation of random polynomials

200 papers

We study the problem of reconstructing a function on a manifold satisfying some mild conditions, given data on the values and some derivatives of the function at arbitrary points on the manifold. While the problem of finding a polynomial of…

Numerical Analysis · Mathematics 2018-05-09 S. Chandrasekaran , C. H. Gorman , H. N. Mhaskar

Let $k\leq n$. Each polynomial $p\in\oR[x_1,...,x_n]$ can be uniquely written as $p=\sum_{\mu}\mu p_{\mu}$, where $\mu$ ranges over the set $M$ of all monomials in $\oR[x_1,...,x_k]$ and where $p_{\mu}\in\oR[x_{k+1},...,x_n]$. If $p$ is…

Combinatorics · Mathematics 2012-11-16 Alexander Schrijver

We study the question of local testability of low (constant) degree functions from a product domain $S_1 \times \dots \times {S}_n$ to a field $\mathbb{F}$, where ${S_i} \subseteq \mathbb{F}$ can be arbitrary constant sized sets. We show…

Computational Complexity · Computer Science 2024-11-12 Prashanth Amireddy , Srikanth Srinivasan , Madhu Sudan

For any natural $d \ge k \ge 2$ we calculate the cohomology groups of the space of homogeneous polynomials $R^2 \to R$ of degree $d$, which do not vanish with multiplicity $\ge k$ on real lines. For $k=2$ this problem provides the simplest…

Algebraic Topology · Mathematics 2014-07-29 Victor A. Vassiliev

We consider the problem of finding for a given $N$-tuple of polynomials (real or complex) the closest $N$-tuple that has a common divisor of degree at least $d$. Extended weighted Euclidean seminorm of the coefficients is used as a measure…

Optimization and Control · Mathematics 2015-11-05 Konstantin Usevich , Ivan Markovsky

We study the family of intersection graphs of low density objects in low dimensional Euclidean space. This family is quite general, and includes planar graphs. We prove that such graphs have small separators. Next, we present efficient…

Computational Geometry · Computer Science 2016-06-01 Sariel Har-Peled , Kent Quanrud

Polynomial-time deterministic approximation of volumes of polytopes, up to an approximation factor that grows at most sub-exponentially with the dimension, remains an open problem. Recent work on this question has focused on identifying…

Combinatorics · Mathematics 2026-03-16 Hariharan Narayanan , Piyush Srivastava

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…

Numerical Analysis · Mathematics 2010-07-12 Jean-Pierre Dedieu , Gregorio Malajovich

In this monograph, we prove an asymptotic approximation for integrals of probability densities over sets in finite dimensional euclidean space, which are far away from the origin (asymptotic sets). We use this approximation to investigate…

Probability · Mathematics 2009-09-29 Philippe Barbe

This paper is devoted to studying the multiple recurrent property of topologically mildly mixing systems along generalized polynomials. We show that if a minimal system is topologically mildly mixing, then it is mild mixing of higher orders…

Dynamical Systems · Mathematics 2024-01-09 Yang Cao , Jianjie Zhao

A theorem is proved concerning approximation of analytic functions by multivariate polynomials in the $s$-dimensional hypercube. The geometric convergence rate is determined not by the usual notion of degree of a multivariate polynomial,…

Numerical Analysis · Mathematics 2016-08-09 Lloyd N. Trefethen

The $\epsilon$-approximate degree of a Boolean function $f: \{-1, 1\}^n \to \{-1, 1\}$ is the minimum degree of a real polynomial that approximates $f$ to within $\epsilon$ in the $\ell_\infty$ norm. We prove several lower bounds on this…

Computational Complexity · Computer Science 2014-03-25 Mark Bun , Justin Thaler

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

Algebraic Geometry · Mathematics 2009-10-12 Arnaud Bodin

The (weak) Nullstellensatz over finite fields says that if $P_1,\ldots,P_m$ are $n$-variate degree-$d$ polynomials with no common zero over a finite field $\mathbb{F}$ then there are polynomials $R_1,\ldots,R_m$ such that…

Combinatorics · Mathematics 2022-09-14 Guy Moshkovitz , Jeffery Yu

The task of approximating a function of d variables from its evaluations at a given number of points is ubiquitous in numerical analysis and engineering applications. When d is large, this task is challenged by the so-called curse of…

Numerical Analysis · Mathematics 2016-12-21 Albert Cohen , Giovanni Migliorati

We consider degree-d forms on the Euclidean unit sphere. We specialize to our setting a genericity result by Nie obtained in a more general framework. We exhibit an homogeneous polynomial Res in the coefficients of f , such that if Res(f) =…

Algebraic Geometry · Mathematics 2021-05-05 Jean-Bernard Lasserre

We prove that random low-degree polynomials (over $\mathbb{F}_2$) are unbiased, in an extremely general sense. That is, we show that random low-degree polynomials are good randomness extractors for a wide class of distributions. Prior to…

Computational Complexity · Computer Science 2025-04-22 Omar Alrabiah , Jesse Goodman , Jonathan Mosheiff , João Ribeiro

Let $P_1, \ldots, P_m \in K[y]$ be polynomials with distinct degrees, no constant terms and coefficients in a general locally compact topological field $K$. We give a quantitative count of the number of polynomial progressions $x, x+P_1(y),…

Number Theory · Mathematics 2024-11-27 Ben Krause , Mariusz Mirek , Sarah Peluse , James Wright

We prove a criterion on the possible locations of zeros of type I and type II multiple orthogonal polynomials in terms of normality of degree $1$ Christoffel transforms. We provide another criterion in terms of degree $2$ Christoffel…

Classical Analysis and ODEs · Mathematics 2026-01-22 Rostyslav Kozhan , Marcus Vaktnäs

Consider random polynomials of the form $G_n = \sum_{i=0}^n \xi_i p_i$, where the $\xi_i$ are i.i.d.\ non-degenerate complex random variables, and $\{p_i\}$ is a sequence of orthonormal polynomials with respect to a regular measure $\tau$…

Probability · Mathematics 2021-10-29 Duncan Dauvergne