English
Related papers

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

200 papers

Sign tests are among the most successful procedures in multivariate nonparametric statistics. In this paper, we consider several testing problems in multivariate analysis, directional statistics and multivariate time series analysis, and we…

Statistics Theory · Mathematics 2016-03-31 Davy Paindaveine , Thomas Verdebout

We give new bounds on the cosystolic expansion constants of several families of high dimensional expanders, and the known coboundary expansion constants of order complexes of homogeneous geometric lattices, including the spherical building…

Combinatorics · Mathematics 2024-10-18 Yotam Dikstein , Irit Dinur

Consider a family of Boolean models, indexed by integers $n \ge 1$, where the $n$-th model features a Poisson point process in ${\mathbb{R}}^n$ of intensity $e^{n \rho_n}$ with $\rho_n \to \rho$ as $n \to \infty$, and balls of independent…

Probability · Mathematics 2014-08-13 Venkat Anantharam , François Baccelli

We study the asymptotic properties of monic orthogonal polynomials (OPs) with respect to some Freud weights when the degree of the polynomial tends to infinity, including the asymptotics of the recurrence coefficients, the nontrivial…

Classical Analysis and ODEs · Mathematics 2023-11-16 Chao Min , Liwei Wang , Yang Chen

We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\{1, ..., N\}\to\{1, ..., M\}$, its polynomial degree is the same for all…

Quantum Physics · Physics 2008-05-12 Andris Ambainis

We provide asymptotically sharp bounds for the Gaussian surface area and the Gaussian noise sensitivity of polynomial threshold functions. In particular we show that if $f$ is a degree-$d$ polynomial threshold function, then its Gaussian…

Computational Complexity · Computer Science 2009-12-15 Daniel M. Kane

We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the…

Number Theory · Mathematics 2016-05-25 Andreas Weingartner

We present quasi-diagonal preconditioners for piecewise polynomial discretizations of pseudodifferential operators of order minus two in any space dimension. Here, quasi-diagonal means diagonal up to a sparse transformation. Considering…

Numerical Analysis · Mathematics 2018-06-22 Thomas Führer , Norbert Heuer

The main results of this article are asymptotic formulas for the variance of the number of zeros of a Gaussian random polynomial of degree $N$ in an open set $U \subset C$ as the degree $N \to \infty$, and more generally for the zeros of…

Complex Variables · Mathematics 2007-05-23 Bernard Shiffman , Steve Zelditch

We study a natural stratification of certain affine slices of univariate hyperbolic polynomials. We look into which posets of strata can be realized and show that the dual of the poset of strata is a shellable simplicial complex and in…

Algebraic Geometry · Mathematics 2024-02-09 Arne Lien , Robin Schabert

We consider random trigonometric polynomials with general dependent coefficients. We show that under mild hypotheses on the structure of dependence, the asymptotics as the degree goes to infinity of the expected number of real zeros…

Probability · Mathematics 2024-09-24 Jürgen Angst , Oanh Nguyen , Guillaume Poly

This paper studies the asymptotic growth and decay properties of solutions of the stochastic pantograph equation with multiplicative noise. We give sufficient conditions on the parameters for solutions to grow at a polynomial rate in $p$-th…

Probability · Mathematics 2016-07-05 John A. D. Appleby , Evelyn Buckwar

Harm Derksen made a conjecture concerning degree bounds for the syzygies of rings of polynomial invariants in the non-modular case. We provide counterexamples to this conjecture, but also prove a slightly weakened version. We also prove…

Commutative Algebra · Mathematics 2014-10-02 Marc Chardin , Peter Symonds

The class of the fine moduli space of stable $n$-pointed curves of genus zero, $\overline{\mathcal{M}_{0,n}}$, in the Grothendieck ring of varieties encodes its Poincar\'e polynomial. Aluffi-Chen-Marcolli conjecture that the Grothendieck…

Algebraic Geometry · Mathematics 2025-09-16 Eduardo Nascimento

In this paper, we present a new method for computing bounded-degree factors of lacunary multivariate polynomials. In particular for polynomials over number fields, we give a new algorithm that takes as input a multivariate polynomial f in…

Symbolic Computation · Computer Science 2016-02-01 Bruno Grenet

Many machine learning applications require learning a function with a small worst-case error over the entire input domain, that is, the $L_\infty$-error, whereas most existing theoretical works only guarantee recovery in average errors such…

Machine Learning · Computer Science 2023-05-02 Kefan Dong , Tengyu Ma

We study an infinite class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. This generalizes a sequence of sparse polynomials which arises in a natural way as graph theoretic…

Classical Analysis and ODEs · Mathematics 2020-08-05 Karl Dilcher , Maciej Ulas

Symmetric ideals in increasingly larger polynomial rings that form an ascending chain are investigated. We focus on the asymptotic behavior of codimensions and projective dimensions of ideals in such a chain. If the ideals are graded it is…

Commutative Algebra · Mathematics 2020-09-09 Dinh Van Le , Uwe Nagel , Hop D. Nguyen , Tim Roemer

A kind of self-dual quasi-abelian codes of index $2$ over any finite field $F$ is introduced. By counting the number of such codes and the number of the codes of this kind whose relative minimum weights are small, such codes are proved to…

Information Theory · Computer Science 2021-08-18 Liren Lin , Yun Fan

We consider multilinear Littlewood polynomials, polynomials in $n$ variables in which a specified set of monomials $U$ have $\pm 1$ coefficients, and all other coefficients are $0$. We provide upper and lower bounds (which are close for $U$…

Combinatorics · Mathematics 2021-07-21 Gil Kalai , Leonard J. Schulman