English
Related papers

Related papers: Sendov's Conjecture: A note on a paper of D\'{e}go…

200 papers

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

Number Theory · Mathematics 2014-07-21 David Krumm

According to a classical result of Spencer, Szemer\'edi, and Trotter (1984), the maximum number of times the unit distance can occur among $n$ points in the plane is $O(n^{4/3})$. This is far from Erd\H{o}s's lower bound, $n^{1+O(1/\log\log…

Combinatorics · Mathematics 2025-07-22 János Pach , Orit E. Raz , József Solymosi

We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very recent work of a team at OpenAI, who proved the…

Combinatorics · Mathematics 2026-05-21 Will Sawin

Let $f_i(P)$ denote the number of $i$-dimensional faces of a convex polytope $P$. Furthermore, let $S(n,d)$ and $C(n,d)$ denote, respectively, the stacked and the cyclic $d$-dimensional polytopes on $n$ vertices. Our main result is that for…

Combinatorics · Mathematics 2007-05-23 Anders Björner

In this paper we prove two results concerning Vinogradov's three primes theorem with primes that can be called almost twin primes. First, for any $m$, every sufficiently large odd integer $N$ can be written as a sum of three primes $p_1,…

Number Theory · Mathematics 2019-02-20 Kaisa Matomäki , Xuancheng Shao

It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…

Number Theory · Mathematics 2017-07-24 Acquaah Peter

The famous Koebe $\frac14$ theorem deals with univalent (i.e., injective) analytic functions $f$ on the unit disk $\mathbb D$. It states that if $f$ is normalized so that $f(0)=0$ and $f'(0)=1$, then the image $f(\mathbb D)$ contains the…

Complex Variables · Mathematics 2021-04-30 Dmitriy Dmitrishin , Konstantin Dyakonov , Alex Stokolos

In 2021, J.~Agler and J.~E. McCarthy proposed a two-step programme toward the celebrated Krzy\.z conjecture. The first step is to prove an entropy conjecture for polynomials whose zeros all lie on the unit circle; the second is to establish…

Complex Variables · Mathematics 2026-05-07 Jialin Lei , Teng Zhang

It is proved that for every complex quadratic polynomial $f$ with Cremer's fixed point $z_0$ (or periodic orbit) for every $\delta>0$, there is at most one periodic orbit of minimal period $n$ for all $n$ large enough, entirely in the disc…

Dynamical Systems · Mathematics 2025-05-06 Feliks Przytycki

In this paper we show that the number of distinct distances determined by a set of $n$ points on a constant-degree two-dimensional algebraic variety $V$ (i.e., a surface) in $\mathbb R^3$ is at least $\Omega\left(n^{7/9}/{\rm polylog}…

Combinatorics · Mathematics 2016-04-07 Micha Sharir , Noam Solomon

In these notes, we consider self-maps of degree > 1 on a weak del Pezzo surface X of degree < 8. We show that there are exactly 12 such X, modulo isomorphism. In particular, K_X^2 > 2, and if X has one self-map of degree > 1 then for every…

Algebraic Geometry · Mathematics 2018-06-20 D. -Q. Zhang

A remarkable conjecture of Feige (2006) asserts that for any collection of $n$ independent non-negative random variables $X_1, X_2, \dots, X_n$, each with expectation at most $1$, $$ \mathbb{P}(X < \mathbb{E}[X] + 1) \geq \frac{1}{e}, $$…

Probability · Mathematics 2023-09-20 Abdulmajeed Alqasem , Heshan Aravinda , Arnaud Marsiglietti , James Melbourne

Let $X_1,X_2,...$ be independent identically distributed random variables with values in $\C$. Denote by $\mu$ the probability distribution of $X_1$. Consider a random polynomial $P_n(z)=(z-X_1)...(z-X_n)$. We prove a conjecture of Pemantle…

Probability · Mathematics 2012-10-02 Zakhar Kabluchko

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

Let $F\in\mathbb{C}[x,y,s,t]$ be an irreducible constant-degree polynomial, and let $A,B,C,D\subset\mathbb{C}$ be finite sets of size $n$. We show that $F$ vanishes on at most $O(n^{8/3})$ points of the Cartesian product $A\times B\times…

Combinatorics · Mathematics 2016-11-03 Orit E. Raz , Micha Sharir , Frank de Zeeuw

We address the Uniform Boundedness Conjecture of Morton and Silverman in the case of unicritical polynomials, assuming a generalization of the $abc$-conjecture. For unicritical polynomials of degree at least five, we require only the…

Number Theory · Mathematics 2019-01-15 Nicole Looper

An important quantity associated with a complex polynomial $p(z)$ is $\Vert p \Vert_\infty$, the maximum of its modulus over the unit disc $D$. We prove, $z_* \in D$ is a local maximum of $|p(z)|$ if and only if $a_*$ satisfies,…

Numerical Analysis · Computer Science 2016-05-03 Bahman Kalantari

We show that if $A$ is a finite set of non-negative integers then the number of zeros of the function \[ f_A(\theta) = \sum_{a \in A} \cos(a\theta), \] in $[0,2\pi]$, is at least $(\log \log \log |A|)^{1/2-\varepsilon}$. This gives the…

Classical Analysis and ODEs · Mathematics 2019-02-07 Julian Sahasrabudhe

The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead…

Combinatorics · Mathematics 2016-08-03 Jonad Pulaj , Annie Raymond , Dirk Theis

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