English
Related papers

Related papers: Quantitative bounds in a popular polynomial Szemer…

200 papers

Let $\mathcal{C}$ be a class of graphs that is closed under taking subgraphs. We prove that if for some fixed $0<\delta\le 1$, every $n$-vertex graph of $\mathcal{C}$ has a balanced separator of order $O(n^{1-\delta})$, then any depth-$k$…

Combinatorics · Mathematics 2017-10-31 Louis Esperet , Jean-Florent Raymond

Let p(t) be a trigonometric polynomial, non-negative on the unit circle. We say that a measure \sigma belongs to a polynomial Szego class, if the logarithm of its density is summable over the circle with the weight p(t). For the associated…

Classical Analysis and ODEs · Mathematics 2007-05-23 S. Denisov , S. Kupin

We show that for every positive integer $k$ there are positive constants $C$ and $c$ such that if $A$ is a subset of $\{1, 2, \dots, n\}$ of size at least $C n^{1/k}$, then, for some $d \leq k-1$, the set of subset sums of $A$ contains a…

Combinatorics · Mathematics 2023-11-03 David Conlon , Jacob Fox , Huy Tuan Pham

A celebrated result of Gowers states that for every \epsilon > 0 there is a graph G so that every \epsilon-regular partition of G (in the sense of Szemeredi's regularity lemma) has order given by a tower of exponents of height polynomial in…

Combinatorics · Mathematics 2013-08-27 Guy Moshkovitz , Asaf Shapira

We generalize a version of Lavrent\'ev's theorem which says that a function that is continuous on a compact set K with connected complement and without interior points can be uniformly approximated as closely as desired by a polynomial…

Complex Variables · Mathematics 2019-07-02 Johan Andersson , Linnea Rousu

A simple way to generate a Boolean function is to take the sign of a real polynomial in $n$ variables. Such Boolean functions are called polynomial threshold functions. How many low-degree polynomial threshold functions are there? The…

Probability · Mathematics 2019-07-25 Pierre Baldi , Roman Vershynin

We characterize the limiting distributions of random variables of the form $P_n\left( (X_i)_{i \ge 1} \right)$, where: (i) $(P_n)_{n \ge 1}$ is a sequence of multivariate polynomials, each potentially involving countably many variables;…

Probability · Mathematics 2024-12-10 Ronan Herry , Dominique Malicet , Guillaume Poly

Let F be a fixed finite field of characteristic at least 5. Let G = F^n be the n-dimensional vector space over F, and write N := |G|. We show that if A is a subset of G with size at least c_F N(log N)^{-c}, for some absolute constant c > 0…

Combinatorics · Mathematics 2014-02-26 Ben Green , Terence Tao

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we obtain improved error bounds for the number of irreducible polynomials and self-reciprocal irreducible monic…

Combinatorics · Mathematics 2021-11-02 Zhicheng Gao

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

Let $f_1,\cdots,f_r\in k[x_1,\cdots,x_n]$ be homogeneous polynomial of degree $d$. Ananyan and Hochster (2016) proved that there exists a bound $N=N(r,d)$ where if collective strength of $f_1,\cdots,f_r\geq N$, then $f_1,\cdots,f_r$ are…

Commutative Algebra · Mathematics 2021-10-01 Chiahui Cheng

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

We prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of semi-algebraically connected components of the realizations of all realizable sign…

Combinatorics · Mathematics 2009-07-14 Saugata Basu , Richard Pollack , Marie-Francoise Roy

We study polynomials with integer coefficients which become Eisenstein polynomials after the additive shift of a variable. We call such polynomials shifted Eisenstein polynomials. We determine an upper bound on the maximum shift that is…

Number Theory · Mathematics 2017-07-12 Randell Heyman , Igor E. Shparlinski

Given finite sets $X_1,\dotsc,X_m$ in $\mathbb{R}^d$ (with $d$ fixed), we prove that there are respective subsets $Y_1,\dotsc,Y_m$ with $|Y_i|\ge \frac{1}{\operatorname{poly}(m)}|X_i|$ such that, for $y_1\in Y_1,\dotsc,y_m\in Y_m$, the…

Combinatorics · Mathematics 2023-09-20 Boris Bukh , Alexey Vasileuski

This is a study of the sequences of Betti numbers of finitely generated modules over a complete intersection local ring, $R$. The subsequences $\{\beta^R_{i}(M)\}_{i\geq 0}$ with even, respectively, odd $i$ are known to be eventually given…

Commutative Algebra · Mathematics 2024-07-16 Luchezar L. Avramov , Alexandra Seceleanu , Zheng Yang

We obtain polynomial decay rates for $C_{0}$-semigroups, assuming that the resolvent grows polynomially at infinity in the complex right half-plane. Our results do not require the semigroup to be uniformly bounded, and for unbounded…

Functional Analysis · Mathematics 2026-05-20 Chenxi Deng , Jan Rozendaal , Mark Veraar

We prove that there is an absolute constant $c > 0$ such that every polynomial $P$ of the form $$P(z) = \sum_{j=0}^{n}{a_jz^j}\,, \quad |a_0| = 1\,, \quad |a_j| \leq M\,, \quad a_j \in \Bbb{C}\,, \quad M \geq 1\,,$$ has at most…

Classical Analysis and ODEs · Mathematics 2024-10-15 Tamás Erdélyi

A precise tie between a univariate spline's knots and its zeros abundance and dissemination is formulated. As an application, a conjecture formulated by De Concini and Procesi is shown to be true in the special univariate, unimodular case.…

Numerical Analysis · Mathematics 2008-10-16 Marco Caminati

In order to reprove an old result of R\'edei's on the number of directions determined by a set of cardinality $p$ in $\mathbb{F}_p^2$, Somlai proved that the non-constant polynomials over the field $\mathbb{F}_p$ whose range sums are equal…

Number Theory · Mathematics 2024-11-12 Gergely Kiss , Ádám Markó , Zoltán Lóránt Nagy , Gábor Somlai
‹ Prev 1 8 9 10 Next ›