English
Related papers

Related papers: Sign uncertainty principles and low-degree polynom…

200 papers

Let $f$ be a polynomial of degree $d$ in $n$ variables over a finite field $\mathbb{F}$. The polynomial is said to be unbiased if the distribution of $f(x)$ for a uniform input $x \in \mathbb{F}^n$ is close to the uniform distribution over…

Discrete Mathematics · Computer Science 2022-01-21 Abhishek Bhowmick , Shachar Lovett

We prove super-polynomial lower bounds on the size of propositional proof systems operating with constant-depth algebraic circuits over fields of zero characteristic. Specifically, we show that the subset-sum variant…

Computational Complexity · Computer Science 2022-05-17 Nashlen Govindasamy , Tuomas Hakoniemi , Iddo Tzameret

We refine upper bounds for the classical exponents of uniform approximation for a linear form on the Veronese curve in dimension from $3$ to $9$. For dimension three, this in particular shows that a bound previously obtained by two…

Number Theory · Mathematics 2024-11-05 Johannes Schleischitz

We consider extremal polynomials with respect to a Sobolev-type $p$-norm, with $1<p<\infty$ and measures supported on compact subsets of the real line. For a wide class of such extremal polynomials with respect to mutually singular measures…

Classical Analysis and ODEs · Mathematics 2017-10-10 A. Diaz Gonzalez , G. Lopez Lagomasino , H. Pijeira Cabrera

The celebrated (First) Borwein Conjecture predicts that for all positive integers~$n$ the sign pattern of the coefficients of the ``Borwein polynomial'' $$(1-q)(1-q^2)(1-q^4)(1-q^5) \cdots(1-q^{3n-2})(1-q^{3n-1})$$ is $+--+--\cdots$. It was…

Combinatorics · Mathematics 2022-02-01 Chen Wang , Christian Krattenthaler

The Umbral Moonshine Conjectures assert that there are infinite-dimensional graded modules, for prescribed finite groups, whose McKay-Thompson series are certain distinguished mock modular forms. Gannon has proved this for the special case…

Representation Theory · Mathematics 2015-12-31 John F. R. Duncan , Michael J. Griffin , Ken Ono

We consider the series of the Bergman orthogonal polynomials associated with a bounded simply-connected domain in the complex plane, whose boundary is a Jordan curve. These are the polynomials that are orthonormal with respect to the area…

Complex Variables · Mathematics 2009-05-27 Nikos Stylianopoulos

We study some systems of polynomials whose support lies in the convex hull of a circuit, giving a sharp upper bound for their numbers of real solutions. This upper bound is non-trivial in that it is smaller than either the Kouchnirenko or…

Algebraic Geometry · Mathematics 2010-03-29 Benoit Bertrand , Frederic Bihan , Frank Sottile

We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…

Number Theory · Mathematics 2021-11-10 Borys Kuca

We consider the Bohr radius $R_n$ for the class of complex polynomials in one variable of degree at most $n$. It was conjectured by R. Fournier in 2008 that $R_n={1\over 3}+{\pi^2\over {3n^2}}+o({1\over n^2})$. We shall prove this…

Complex Variables · Mathematics 2014-04-07 Cheng Chu

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…

alg-geom · Mathematics 2008-02-03 M. Giusti , J. Heintz , K. Hägele , J. E. Morais , L. M. Pardo , J. L. Montaña

It is often useful to have polynomial upper or lower bounds on a one-dimensional function that are valid over a finite interval, called a trust region. A classical way to produce polynomial bounds of degree $k$ involves bounding the range…

Numerical Analysis · Mathematics 2023-08-24 Matthew Streeter , Joshua V. Dillon

We study the asymptotic behavior of the Bergman orthogonal polynomials $(p_n)_{n=0}^{\infty}$ for a class of bounded simply connected domains $D$. The class is defined by the requirement that conformal maps $\varphi$ of $D$ onto the unit…

Complex Variables · Mathematics 2024-04-16 Erwin Miña-Díaz , Aron Wennman

In this paper, we prove a number of results providing either necessary or sufficient conditions guaranteeing that the number of real roots of real polynomials of a given degree is either less or greater than a given number. We also provide…

Complex Variables · Mathematics 2024-03-20 Olga Katkova , Boris Shapiro , Anna Vishnyakova

Defect characterizes the depth of factorization of terms in differential (cyclotomic) expansions of knot polynomials, i.e. of the non-perturbative Wilson averages in the Chern-Simons theory. We prove the conjecture that the defect can be…

High Energy Physics - Theory · Physics 2023-03-16 E. Lanina , A. Morozov

We study the asymptotic distribution of critical values of random holomorphic `polynomials' s_n on a Kaehler manifold M as the degree n tends to infinity. By `polynomial' of degree n we mean a holomorphic section of the nth power of a…

Probability · Mathematics 2014-10-14 Renjie Feng , Steve Zelditch

We examine the maximal number of zeros a polynomial of degree at most n with constrained coefficients may have at 1. Our results are essentially sharp and extend earlier results of this variety. An interesting connection to certain…

Number Theory · Mathematics 2014-06-11 Tamas Erdelyi

In this paper we study the asymptotic zero distribution of eigenpolynomials for degenerate exactly-solvable operators. We present an explicit conjecture and partial results on the growth of the largest modulus of the roots of the unique and…

Spectral Theory · Mathematics 2007-05-23 Tanja Bergkvist

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

Submodular and fractionally subadditive (or equivalently XOS) functions play a fundamental role in combinatorial optimization, algorithmic game theory and machine learning. Motivated by learnability of these classes of functions from random…

Data Structures and Algorithms · Computer Science 2015-08-04 Vitaly Feldman , Jan Vondrak