Related papers: Proof of Sendov's conjecture
In this article, we are interested in the enumeration of Fully Packed Loops configurations on a grid with a given noncrossing matching. These quantities also appear as the groundstate components of the Completely Packed Loops model as…
Koiran's real $\tau$-conjecture claims that the number of real zeros of a structured polynomial given as a sum of $m$ products of $k$ real sparse polynomials, each with at most $t$ monomials, is bounded by a polynomial in $m,k,t$. This…
This paper investigates asymptotic distribution of complex zeros of random polynomials $P_n(z):=\sum_{k=0}^{n}b(k)\xi_k z^k$, as $n\to\infty$, where $b$ is a regularly varying function at infinity with index $\alpha\in \mathbb{R}$ and…
In 1960, W. Sierpinski proved that there are infinitely many positive odd numbers $k$, such that for any positive integer $n$, $k\times2^n+1$ is a composite number. Such numbers are called "Sierpinski numbers". In this study, by using…
We prove the classical result, which goes back at least to Fourier, that a polynomial with real coefficients has all zeros real and distinct if and only if the polynomial and also all of its nonconstant derivatives have only negative minima…
The Neggers-Stanley conjecture (also known as the Poset conjecture) asserts that the polynomial counting the linear extensions of a partially ordered set on $\{1,2,...,p\}$ by their number of descents has real zeros only. We provide…
It is proved that the Continuum Hypothesis implies that any sequence of rapid P-points of length $<{\mathfrak c}^{+}$ which is increasing with respect to the Rudin-Keisler ordering is bounded above by a rapid P-point. This is an improvement…
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…
In this paper we study the Sobolev embedding theorem for variable exponent spaces with critical exponents. We find conditions on the best constant in order to guaranty the existence of extremals. The proof is based on a suitable refinement…
We prove P. Alexandersson's conjecture that for every complex polynomial $p$ of degree $d \geq 2$ the convex hull $H_p$ of the Julia set $J_p$ of $p$ satisfies $p^{-1}(H_p) \subset H_p$. We further prove that the equality $p^{-1}(H_p) =…
Let $X_1,X_2,\ldots$ be independent and identically distributed random variables in $\mathbb{C}$ chosen from a probability measure $\mu$ and define the random polynomial $$ P_n(z)=(z-X_1)\ldots(z-X_n)\,. $$ We show that for any sequence $k…
We give a proof of the planar case of a longstanding conjecture of Kneser (1955) and Poulsen (1954). In fact, we prove more by showing that if a finite set of disks in the plane is rearranged so that the distance between each pair of…
We prove a recent conjecture due to Deutsch, Sagan, and Wilson stating that the finite sequence obtained from the first p central trinomial coefficients modulo p by replacing nonzero terms by 1's is palindromic, for any prime number p > 3.…
Alexandrov's Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of a unique convex polyhedron. Recent work by Bobenko and Izmestiev describes a…
We review some known inclusion results for the roots of a polynomial, and adapt them to a conjecture recently presented by S. A. Vavasis. In particular, we provide strict upper and lower bounds to the distance of the closest root of a…
Schur studied limits of the arithmetic means $s_n$ of zeros for polynomials of degree $n$ with integer coefficients and simple zeros in the closed unit disk. If the leading coefficients are bounded, Schur proved that $\limsup_{n\to\infty}…
A 1971 conjecture of Graham (later repeated by Erd\H{o}s and Graham) asserts that every set $A \subseteq \mathbb{F}_p \setminus \{0\}$ has an ordering whose partial sums are all distinct. We prove this conjecture for sets of size $|A|…
The purpose of this note is to give an affirmative answer to a conjecture appearing in [Integral Transforms Spec. Funct. 26 (2015) 90-95].
We prove that every 0/1-polytope has a unique Minkowski decomposition into indecomposable polytopes, up to translation of summands. The summands lie in pairwise orthogonal subspaces. Thus, every 0/1-polytope is the Cartesian product of…
We propose a conjecture for exponential sums which generalizes both a conjecture by Igusa and a local variant by Denef and Sperber, in particular, it is without the homogeneity condition on the polynomial in the phase, and with new…