English
Related papers

Related papers: Steiner polynomials via ultra-logconcave sequences

200 papers

In this paper we study the structure of polynomials of degree three and four that have high bias or high Gowers norm, over arbitrary prime fields. In particular we obtain the following results. 1. We give a canonical representation for…

Combinatorics · Mathematics 2010-01-01 Elad Haramaty , Amir Shpilka

We are generalizing to higher dimensions the Bavard-Ghys construction of the hyperbolic metric on the space of polygons with fixed directions of edges. The space of convex d-dimensional polyhedra with fixed directions of facet normals has a…

Geometric Topology · Mathematics 2019-02-20 Francois Fillastre , Ivan Izmestiev

This is a straightforward introduction to the properties of polynomials in many variables that do not vanish in the open upper half plane. Such polynomials generalize many of the well-known properties of polynomials with all real roots.

Classical Analysis and ODEs · Mathematics 2007-11-27 Steve Fisk

It is shown that rational and polynomial convexity of totally real submanifolds is in general unstable under perturbations that are $C^\alpha$-small for any H\"older exponent $\alpha<1$. This complements the result of L{\o}w and Wold that…

Complex Variables · Mathematics 2021-07-12 Stefan Nemirovski

We give a new proof that the empirical measures of the roots of Eulerian polynomials converge to a certain log-Cauchy distribution. To do so, we show that each moment of the roots of a related family of polynomials not only converge, but in…

Combinatorics · Mathematics 2025-11-14 Paul Melotti

The classical Steinitz theorem states that if the origin belongs to the interior of the convex hull of a set $S \subset \mathbb{R}^d$, then there are at most $2d$ points of $S$ whose convex hull contains the origin in the interior.…

Metric Geometry · Mathematics 2024-03-06 Grigory Ivanov , Márton Naszódi

We identify a structural pattern in the construction of known infinite families of trees whose independence polynomials are not log-concave. Using this pattern and properties of polynomial ring ideals, we derive linear recurrences for these…

Combinatorics · Mathematics 2026-03-17 César Bautista-Ramos , Carlos Guillén-Galván , Paulino Gómez-Salgado

We prove that projective spaces of Lorentzian and real stable polynomials are homeomorphic to closed Euclidean balls. This solves a conjecture of June Huh and the author. The proof utilizes and refines a connection between the symmetric…

Combinatorics · Mathematics 2023-06-22 Petter Brändén

Let $m$ and $k \geq 2$ be positive integers. We show that polynomial $P = (1+x)^m(1+x^k)$ is strongly unimodal (frequently known as {\it log concave\/}) if and only if $m \geq k^2 -3$; this is also the criterion for $P$ to be merely…

Combinatorics · Mathematics 2018-04-05 David Handelman

This note is an introduction to the properties of stable polynomials in several variables with real or complex coefficients. These polynomials are defined in terms of where the polynomial is non-vanishing. We do not cover well-known topics…

Classical Analysis and ODEs · Mathematics 2008-03-04 Steve Fisk

This article establishes the existence of Lyapunov functions for analyzing the stability of a class of state-constrained systems, and it describes algorithms for their numerical computation. The system model consists of a differential…

Optimization and Control · Mathematics 2021-04-14 Marianne Souaiby , Aneel Tanwani , Didier Henrion

An infinitely smooth convex body in $\mathbb R^n$ is called polynomially integrable of degree $N$ if its parallel section functions are polynomials of degree $N$. We prove that the only smooth convex bodies with this property in odd…

Metric Geometry · Mathematics 2017-02-03 Alexander Koldobsky , Alexander Merkurjev , Vladyslav Yaskin

Let $P$ be a convex polyhedron in $\mathbb{R}^3$. The skeleton of $P$ is the graph whose vertices and edges are the vertices and edges of $P$, respectively. We prove that, if these vertices are on the unit-sphere, the skeleton is a $(0.999…

Computational Geometry · Computer Science 2016-09-05 Prosenjit Bose , Paz Carmi , Mirela Damian , Jean-Lou De Carufel , Darryl Hill , Anil Maheshwari , Yuyang Liu , Michiel Smid

We give a self-contained proof of the strongest version of Mason's conjecture, namely that for any matroid the sequence of the number of independent sets of given sizes is ultra log-concave. To do this, we introduce a class of polynomials,…

Combinatorics · Mathematics 2018-11-06 Nima Anari , Kuikui Liu , Shayan Oveis Gharan , Cynthia Vinzant

If a real polynomial $f(x)=p(x^2)+xq(x^2)$ is Hurwitz stable (every root if $f$ lies in the open left half-plane), then the Hermite-Biehler Theorem says that the polynomials $p(-x^2)$ and $q(-x^2)$ have interlacing real roots. We extend…

Classical Analysis and ODEs · Mathematics 2017-01-30 Richard Ellard , Helena Šmigoc

The work proves that, for three-dimensional upper triangular groups over a field of odd characteristic with an abelian unipotent subgroup, the ring of invariants is polynomial if and only if the unipotent subgroup is generated by…

Group Theory · Mathematics 2025-10-24 Abdulkadyr Buchaev

A polynomial $f(x)$ over a field $K$ is said to be stable if all its iterates are irreducible over $K$. L. Danielson and B. Fein have shown that over a large class of fields $K$, if $f(x)$ is an irreducible monic binomial, then it is stable…

Number Theory · Mathematics 2022-12-21 Mohamed Ayad , Boualem Benseba , Mohamed Madi

We introduce the notion of interlacing log-concavity of a polynomial sequence $\{P_m(x)\}_{m\geq 0}$, where $P_m(x)$ is a polynomial of degree m with positive coefficients $a_{i}(m)$. This sequence of polynomials is said to be interlacing…

Combinatorics · Mathematics 2010-08-03 William Y. C. Chen , Larry X. W. Wang , Ernest X. W. Xia

We apply the techniques developed by Marcus, Spielman and Srivastava, working with principal submatrices in place of rank $1$ decompositions to give an alternate proof of their results on restricted invertibility. We show that one can find…

Functional Analysis · Mathematics 2017-03-16 Mohan Ravichandran

We present two different proofs that positive polynomials on closed boxes of $\mathbb{R}^2$ can be written as bivariate Bernstein polynomials with strictly positive coefficients. Both strategies can be extended to prove the analogous result…

Classical Analysis and ODEs · Mathematics 2020-06-16 Marcio Alves Diniz , Luis Ernesto Salasar , Rafael Bassi Stern