English
Related papers

Related papers: On the Gauss-Lucas theorem in the quaternionic set…

200 papers

We prove a theorem on distortion of cross ratio of four points under the mapping effected by a complex polynomial with restricted critical values. Its corollaries include inequalities involving the absolute value and certain coefficients of…

Complex Variables · Mathematics 2013-01-18 V. N. Dubinin

In this article, we survey the the recent literature surrounding the geometry of complex polynomials. Specific areas surveyed are i) Generalizations of the Gauss--Lucas Theorem, ii) Geometry of Polynomials Level Sets, and iii) Shape…

Complex Variables · Mathematics 2020-01-14 Trevor J. Richards

Given a finite set of lattice points, we compare its sumsets and lattice points in its dilated convex hulls. Both of these are known to grow as polynomials. Generally, the former are subsets of the latter. In this paper, we will see that…

Number Theory · Mathematics 2007-05-23 Jaewoo Lee

This paper is purely expository. We present short elementary proofs of * the Gauss Theorem on constructibility of regular polygons; * the existence of a cubic equation unsolvable in real radicals; * the existence of a quintic equation…

General Mathematics · Mathematics 2026-01-08 A. Skopenkov

In this paper, we give results that partially prove a conjecture which was discussed in our previous work (arXiv:1307.4991). More precisely, we prove that as $n\to \infty,$ the zeros of the polynomial$${}_{2}\text{F}_{1}\left[…

Complex Variables · Mathematics 2016-03-27 Addisalem Abathun , Rikard Bøgvad

One can associate to any bivariate polynomial P(X,Y) its Newton polygon. This is the convex hull of the points (i,j) such that the monomial X^i Y^j appears in P with a nonzero coefficient. We conjecture that when P is expressed as a sum of…

Computational Complexity · Computer Science 2014-05-14 Pascal Koiran , Natacha Portier , Sébastien Tavenas , Stéphan Thomassé

Let T be the unit circle in the complex plane C. This paper proves the existence of analytic structure in a compact subset K of T X C^n, where K has so-called "lineally convex" or "hypoconvex" fibers over T. It also addresses a related…

Complex Variables · Mathematics 2007-05-23 Marshall A. Whittlesey

The point selection theorem says that the convex hull of any finite point set contains a point that lies in a positive proportion of the simplices determined by that set. This paper proves several new volumetric versions of this theorem…

Metric Geometry · Mathematics 2025-08-26 Travis Dillon

In this paper, we are concerned with the problem of locating the zeros of polynomials of a quaternionic variable with quaternionic coefficients. We derive some new Cauchy bounds for the zeros of a polynomial by virtue of maximum modulus…

Complex Variables · Mathematics 2025-02-25 N. A. Rather , Tanveer Bhat

Let $f$ be a Gaussian random field on $\mathbb{R}^d$ and let $X$ be the number of critical points of $f$ contained in a compact subset. A long-standing conjecture is that, under mild regularity and non-degeneracy conditions on $f$, the…

Probability · Mathematics 2023-07-21 Louis Gass , Michele Stecconi

The line of phase transitions, separating the confinement and the Coulomb phases in the four-dimensional pure compact U(1) gauge theory with extended Wilson action, is reconsidered. We present new numerical evidence that a part of this…

High Energy Physics - Lattice · Physics 2009-10-28 J. Jersak , C. B. Lang , T. Neuhaus

Let $K$ be a smooth convex set with volume one in $\BBR^d$. Choose $n$ random points in $K$ independently according to the uniform distribution. The convex hull of these points, denoted by $K_n$, is called a {\it random polytope}. We prove…

Probability · Mathematics 2007-05-23 Van Vu

Call a Laurent polynomial $W$ `complete' if its Newton polytope is full-dimensional with zero in its interior. We show that if $W$ is any complete Laurent polynomial with coefficients in the positive part of the field $K$ of generalised…

Algebraic Geometry · Mathematics 2025-10-03 Jamie Judd , Konstanze Rietsch

Critical points of an invariant function may or may not be symmetric. We prove, however, that if a symmetric critical point exists, those adjacent to it are generically symmetry breaking. This mathematical mechanism is shown to carry…

Machine Learning · Computer Science 2024-08-27 Yossi Arjevani

Assuming an integral quadratic polynomial with nonsingular quadratic part has a nontrivial zero on an integer lattice outside of a union of finite-index sublattices, we prove that there exists such a zero of bounded norm and provide an…

Number Theory · Mathematics 2024-11-22 Lenny Fukshansky , Sehun Jeong

Choose $n$ random, independent points in $\R^d$ according to the standard normal distribution. Their convex hull $K_n$ is the {\sl Gaussian random polytope}. We prove that the volume and the number of faces of $K_n$ satisfy the central…

Combinatorics · Mathematics 2007-05-23 I. Barany , V. H. Vu

This paper proves that if points $Z_1,Z_2,...$ are chosen independently and identically using some measure $\mu$ from the unit circle in the complex plane, with $p_n(z) = (z-Z_1)(z-Z_2)...(z-Z_n)$, then the empirical distribution of the…

Probability · Mathematics 2012-10-22 Sneha Dey Subramanian

The Sendovs conjecture asserts that if all the zeros of a polynomial p(z) lie in the closed unit disk, then there must be a critical point of p(z) within unit distance of each zero. The conjecture has been proved to be true for many special…

General Mathematics · Mathematics 2020-03-06 G. M. Sofi

In this paper, we shall present an interesting and significant refinement of a classical result of Cauchy about the moduli of the zeros of a quaternionic polynomial. As an application of this result we shall obtain zero-free regions of…

Complex Variables · Mathematics 2025-02-18 Nisar Ahmad Rather , Danish Rashid Bhat , Tanveer Bhat

A celebrated theorem of Balas gives a linear mixed-integer formulation for the union of two nonempty polytopes whose relaxation gives the convex hull of this union. The number of inequalities in Balas formulation is linear in the number of…

Optimization and Control · Mathematics 2017-11-06 Michele Conforti , Marco Di Summa , Yuri Faenza