Related papers: Polynomial convexity with degree bounds

In this paper, we obtain new results on the critical points of a polynomial. We discuss the Sendov conjecture for polynomials of degree nine.

Given a univariate polynomial, its abscissa is the maximum real part of its roots. The abscissa arises naturally when controlling linear differential equations. As a function of the polynomial coefficients, the abscissa is H{\"o}lder…

Locating the zeros of quaternionic polynomials is a fundamental problem with significant implications across scientific and engineering disciplines, yet the noncommutative nature of quaternion multiplication makes it fundamentally more…

We present a polynomial partitioning theorem for finite sets of points in the real locus of an irreducible complex algebraic variety of codimension at most two. This result generalizes the polynomial partitioning theorem on the Euclidean…

We introduce the concept of degree to classify the periods in the sense of Kontsevich. Using this notion we give some new understanding of some problems in transcendental number theory.

We present an approach over arbitrary fields to bound the degree of intersection of families of varieties in terms of how these concentrate on algebraic sets of smaller codimension. This provides in particular a substantial extension of the…

In this paper, we establish an angle duality and a gap principle for convex combinations of incomplete polynomials, extending two results of Ge and Gonek in [IMRN, 2024].Our approach is geometric: we introduce an ``angle gain'' mechanism…

We give upper bounds on the minimal degree of a model in $\mathbb{P}^2$ and the minimal bidegree of a model in $\mathbb{P}^1 \times \mathbb{P}^1$ of the curve defined by a given Laurent polynomial, in terms of the combinatorics of the…

In this note, we propose some open problems and questions about bounded convex domains in $\mathbb C^N$, specifically about visibility and iteration theory.

We prove several bounds on the number of incidences between two sets of multivariate polynomials of bounded degree over finite fields. From these results, we deduce bounds on incidences between points and multivariate polynomials, extending…

We show that if a disc triangulation has all internal vertex degrees at least 6, then the full triangulation may be determined from the pairwise graph distance between boundary vertices. A similar result holds for quadrangulations with all…

The topics of Convexity and Concavity and Envelopes are central in Complex Analysis and extensively investigated. The aim of this paper is to find a possible counterpart in Algebraic Geometry. The article presents preliminary results on…

We prove explicit bounds on the number of lattice points on or near a convex curve in terms of geometric invariants such as length, curvature, and affine arclength. In several of our results we obtain the best possible constants. Our…

We show that minimizing a convex function over the integer points of a bounded convex set is polynomial in fixed dimension.

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

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…

We prove that the metric balls of a Hilbert geometry admit a volume growth at least polynomial of degree their dimension. We also characterise the convex polytopes as those having exactly polynomial volume growth of degree their dimension.

For an arbitrary representation $\rho$ of a complex finite-dimensional Lie algebra, we construct a collection of numbers that we call the Jordan-Kronecker invariants of $\rho$. Among other interesting properties, these numbers provide lower…

We study conditions determining the $L^p$ boundedness of multiple Hilbert transforms associated with polynomials.

Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…