English
Related papers

Related papers: Sendov's conjecture for sufficiently high degree p…

200 papers

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 show that the irreducible variety of 4 x 4 x 4 complex valued tensors of border rank at most 4 is the zero set of polynomial equations of degree 5 (the Strassen commutative conditions), of degree 6 (the Landsberg-Manivel polynomials),…

Algebraic Geometry · Mathematics 2011-05-02 Shmuel Friedland , Elizabeth Gross

Let $q$ be a power of a prime, let $\mathbb{F}_q$ be the finite field with $q$ elements and let $n \geq 2$. For a polynomial $h(x) \in \mathbb{F}_q[x]$ of degree $n \in \mathbb{N}$ and a subset $W \subseteq [0,n] := \{0, 1, \ldots, n\}$, we…

Number Theory · Mathematics 2016-05-03 Aleksandr Tuxanidy , Qiang Wang

Let $s_0,s_1,\dots,s_{m-1}$ be complex numbers and $r_0,\dots,r_{m-1}$ rational integers in the range $0\le r_j\le m-1$. Our first goal is to prove that if an entire function $f$ of sufficiently small exponential type satisfies…

Number Theory · Mathematics 2020-11-11 Michel Waldschmidt

Tuza's Conjecture states that if a graph $G$ does not contain more than $k$ edge-disjoint triangles, then some set of at most $2k$ edges meets all triangles of $G$. We prove Tuza's Conjecture for all graphs $G$ having no subgraph with…

Combinatorics · Mathematics 2015-04-14 Gregory J. Puleo

We prove a Jensen-disc type theorem for polynomials $p\in\mathbb{R}[z]$ having all their zeros in a sector of the complex plane. This result is then used to prove the existence of a collection of linear operators…

Complex Variables · Mathematics 2018-02-09 David A. Cardon , Tamás Forgács , Andrzej Piotrowski , Evan Sorensen , Jason C. White

A famous conjecture of P\'osa from 1962 asserts that every graph on $n$ vertices and with minimum degree at least $2n/3$ contains the square of a Hamilton cycle. The conjecture was proven for large graphs in 1996 by Koml\'os, S\'ark\"ozy…

Combinatorics · Mathematics 2016-11-28 Katherine Staden , Andrew Treglown

Consider a degree-$d$ polynomial $f(\xi_1,\dots,\xi_n)$ of independent Rademacher random variables $\xi_1,\dots,\xi_n$. To what extent can $f(\xi_1,\dots,\xi_n)$ concentrate on a single point? This is the so-called polynomial…

Combinatorics · Mathematics 2025-05-30 Zhihan Jin , Matthew Kwan , Lisa Sauermann , Yiting Wang

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

We apply a variant of the multigrade efficient congruencing method to estimate Vinogradov's integral of degree $3$ for moments of order $2s$, establishing strongly diagonal behaviour for $1\le s\le 6$. Consequently, the main conjecture is…

Number Theory · Mathematics 2022-11-22 Trevor D. Wooley

A classical result states that if $f(z)$ is a polynomial of degree at most $n$ with nonnegative coefficients, then $f(z)$ has no zeros in the sector $|\arg(z)| < \frac{\pi}{n}$ of the complex plane, and the bound $\frac{\pi}{n}$ is tight.…

Classical Analysis and ODEs · Mathematics 2025-09-25 Steven N. Karp

P\'olya's Positivstellensatz on the $1$-simplex says that if $P(x)$ is a real polynomial such that $P(x)>0$ whenever $x \ge 0$, then all the coefficients of $(1+x)^mP(x)$ are positive whenever $m$ is large. Powers-Reznick gave a complexity…

Algebraic Geometry · Mathematics 2018-02-09 Ze Kang Tan

An inverse polynomial has a Chebyshev series expansion 1/\sum(j=0..k)b_j*T_j(x)=\sum'(n=0..oo) a_n*T_n(x) if the polynomial has no roots in [-1,1]. If the inverse polynomial is decomposed into partial fractions, the a_n are linear…

Classical Analysis and ODEs · Mathematics 2016-09-07 Richard J. Mathar

We give a Schinzel-Zassenhaus-type lower bound for the maximum modulus of roots of a monic integer polynomial with all roots symmetric with respect to the unit circle. Our results extend a recent work of Dimitrov, who proved the general…

Number Theory · Mathematics 2021-01-19 Igor E. Pritsker

In this note we aim to give a new, elementary proof of a statement that was first proved by Timofte. It says that a symmetric real polynomial $F$ of degree $d$ in $n$ variables is positive on $\R^n$ (on $\R^{n}_{\geq 0}$) if and only if it…

Algebraic Geometry · Mathematics 2013-03-22 Cordian Riener

In this paper we characterize real bivariate polynomials which have a small range over large Cartesian products. We show that for every constant-degree bivariate real polynomial $f$, either $|f(A,B)|=\Omega(n^{4/3})$, for every pair of…

Computational Geometry · Computer Science 2014-03-20 Orit E. Raz , Micha Sharir , József Solymosi

We show that for Gaussian random SU(2)polynomials of a large degree $N$ the probability that there are no zeros in the disk of radius $r$ is less than $e^{-c_{1,r} N^2}$, and is also greater than $e^{-c_{2,r} N^2}$. Enroute to this result,…

Complex Variables · Mathematics 2007-05-23 Scott Zrebiec

For random polynomials with i.i.d. (independent and identically distribu-ted) zeros following any common probability distribution $\mu$ with support contained in the unit circle, the empirical measures of the zeros of their first and higher…

Complex Variables · Mathematics 2014-09-26 Pak-Leong Cheung , Tuen Wai Ng , Jonathan Tsai , S. C. P. Yam

We show that the Schur polynomials in all primitive $n$th roots of unity are $1$, $0$, or $-1$, if $n$ has at most two distinct odd prime factors. This result can be regarded as a generalization of properties of the coefficients of the…

Combinatorics · Mathematics 2025-09-16 Masaki Hidaka , Minoru Itoh

A conjecture due to Cilleruelo states that for an irreducible polynomial $f$ with integer coefficients of degree $d\geq 2$, the least common multiple $L_f(N)$ of the sequence $f(1), f(2), \dots, f(N)$ has asymptotic growth $\log L_f(N)\sim…

Number Theory · Mathematics 2019-04-16 Zeév Rudnick , Sa'ar Zehavi