English
Related papers

Related papers: A Proof of Sendov's Conjecture

200 papers

The following selection theorem is established:\\ Let $X$ be a compactum possessing a binary normal subbase $\mathcal S$ for its closed subsets. Then every set-valued $\mathcal S$-continuous map $\Phi\colon Z\to X$ with closed $\mathcal…

General Topology · Mathematics 2013-11-05 Vesko Valov

Let $S=(a_1)\cdots(a_k)$ be a minimal zero-sum sequence over a finite cyclic group $G$. The index conjecture states that if $k=4$ and $\gcd(|G|,6)=1$, then $S$ has index $1$. In this paper we prove that if $S$ is singular then the index of…

Number Theory · Mathematics 2017-09-15 Fan Ge

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 any unitary matrix there exists a ZXZ decomposition, according to a theorem by Idel and Wolf. For any even-dimensional unitary matrix there exists a block-ZXZ decomposition, according to a theorem by F\"uhr and Rzeszotnik. We conjecture…

Quantum Physics · Physics 2021-12-02 Alexis De Vos , Martin Idel , Stijn De Baerdemacker

The Schinzel Hypothesis is a celebrated conjecture in number theory linking polynomial values and prime numbers. In the same vein we investigate the common divisors of values $P_1(n),\ldots, P_s(n)$ of several polynomials. We deduce this…

Number Theory · Mathematics 2020-05-04 Arnaud Bodin , Pierre Dèbes , Salah Najib

We consider polynomials in R[x] which map the set of nonnegative (element-wise) matrices of a given order into itself. Let n be a positive integer and define P(n)= {p in R[x] : p(A) is nonnegative (element-wise), for all A, A an n-by-n…

Rings and Algebras · Mathematics 2022-02-02 Raphael Loewy

A classical theorem of Wendroff shows that one may reconstructs a sequence of orthogonal polynomials on the real line from two non-constant polynomials of consecutive degrees whose zeros strictly interlace on the real line. In this note we…

Classical Analysis and ODEs · Mathematics 2026-02-25 K. Castillo , G. Gordillo-Núñez

The Schwartz-Zippel Lemma states that if a low-degree multivariate polynomial with coefficients in a field is not zero everywhere in the field, then it has few roots on every finite subcube of the field. This fundamental fact about…

Computational Complexity · Computer Science 2024-11-13 Albert Atserias , Iddo Tzameret

The polynomial Szemer\'{e}di theorem implies that, for any $\delta \in (0,1)$, any family $\{P_1,\ldots, P_m\} \subset \mathbb{Z}[y]$ of nonconstant polynomials with constant term zero, and any sufficiently large $N$, every subset of…

Combinatorics · Mathematics 2025-03-21 Vitaly Bergelson , Andrew Best

We estimate non-asymptotically the probability of uniform clustering around the unit circle of the zeros of the $[m,n]$-Pad\'e approximant of a random power series $f(z) = \sum_{j=0}^\infty a_j z^j$ for $a_j$ independent, with finite first…

Complex Variables · Mathematics 2024-01-23 Stamatis Dostoglou , Petros Valettas

Given a complex polynomial $p(z)$ of degree $n$ and an ellipse, we find an algorithm of determining the number of zeros of $p$ in the interior and exterior of the ellipse. Our results generalize the previous results of Pt\'ak and Young…

Complex Variables · Mathematics 2018-06-26 Priya Garg , Sourav Pal

If $P(z)=\sum_{j=0}^{n}a_jz^j$ is a polynomial of degree $n$ having no zero in $|z|<1,$ then it was recently proved that for every $p\in[0,+\infty]$ and $s=0,1,\ldots,n-1,$ \begin{align*} \left\|a_nz+\frac{a_s}{\binom{n}{s}}\right\|_{p}\leq…

Complex Variables · Mathematics 2024-12-02 Suhail Gulzar , N. A. Rather , M. S Wani

We prove in particular that for any sufficiently large prime $p$ there is $1\le a<p$ such that all partial quotients of $a/p$ are bounded by $O(\log p/\log \log p)$. For composite denominators a similar result is obtained. This improves the…

Number Theory · Mathematics 2023-01-02 Nikolay Moshchevitin , Brendan Murphy , Ilya Shkredov

We prove Polya's conjecture of 1943: For a real entire function of order greater than 2, with finitely many non-real zeros, the number of non-real zeros of the n-th derivative tends to infinity with n. We use the saddle point method and…

Complex Variables · Mathematics 2018-01-08 Walter Bergweiler , Alexandre Eremenko

For any polynomial map with a single critical point, we prove that its lower Lyapunov exponent at the critical value is negative if and only if the map has an attracting cycle. Similar statement holds for the exponential maps and some other…

Dynamical Systems · Mathematics 2015-12-15 Genadi Levin , Feliks Przytycki , Weixiao Shen

Let n_d denote the degree d Veronese embedding of a projective space P^r. For any symmetric tensor P, the 'symmetric tensor rank' sr(P) is the minimal cardinality of a subset A of P^r, such that n_d(A) spans P. Let S(P) be the space of all…

Algebraic Geometry · Mathematics 2012-02-15 Edoardo Ballico , Luca Chiantini

We consider T(x), a tensor of arbitrary rank that is symmetric in all of its indices and conserved in the sense that the divergence on any one index vanishes. Our conjecture is that all integral moments of this tensor will vanish if the…

Mathematical Physics · Physics 2013-07-12 Charles Schwartz

Let $(Z_k)_{k\geq 1}$ be a sequence of independent and identically distributed complex random variables with common distribution $\mu$ and let $P_n(X):=\prod_{k=1}^n (X-Z_k)$ the associated random polynomial in $\mathbb C[X]$. In [Kab15],…

Probability · Mathematics 2024-03-06 Jürgen Angst , Dominique Malicet , Guillaume Poly

A beautiful conjecture of Erd\H{o}s-Simonovits and Sidorenko states that if H is a bipartite graph, then the random graph with edge density p has in expectation asymptotically the minimum number of copies of H over all graphs of the same…

Combinatorics · Mathematics 2010-06-09 David Conlon , Jacob Fox , Benny Sudakov

We strengthen the Weierstrass approximation theorem by proving that any real-valued continuous function on an interval $I \subset \mathbb{R}$ can be uniformly approximated by a real-valued polynomial whose only (possibly complex) critical…

Classical Analysis and ODEs · Mathematics 2025-01-07 David L. Bishop