English
Related papers

Related papers: Hypergeometric polynomials are optimal

200 papers

We prove that if $P(X) \in \mathbb{Z}[X]$ is an integer polynomial of degree $n$ and having $P(0) = 1$, then either $P(X)$ is a product of cyclotomic polynomials, or else at least one of the complex roots of $P$ belongs to the disk $|z|…

Number Theory · Mathematics 2020-01-01 Vesselin Dimitrov

We consider random polynomials of the form $H_n(z)=\sum_{j=0}^n\xi_jq_j(z)$ where the $\{\xi_j\}$ are i.i.d non-degenerate complex random variables, and the $\{q_j(z)\}$ are orthonormal polynomials with respect to a compactly supported…

Probability · Mathematics 2018-03-23 Thomas Bloom , Duncan Dauvergne

In this paper we prove a strong version of the Hilbert Nullstellensatz in the ring $\mathbb H[q_1,\ldots,q_n]$ of slice regular polynomials in several quaternionic variables. Our proof deeply depends on a detailed analysis of the common…

Complex Variables · Mathematics 2025-09-16 Anna Gori , Giulia Sarfatti , Fabio Vlacci

We complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in $\mathbb{R}^2$. Previous work shows that optimizing a quadratic polynomial over the integer points in a polyhedral…

Optimization and Control · Mathematics 2015-05-07 Alberto Del Pia , Robert Hildebrand , Robert Weismantel , Kevin Zemmer

We examine two binary operations on the set of algebraic polynomials, known as multiplicative and additive finite free convolutions, specifically in the context of hypergeometric polynomials. We show that the representation of a…

Classical Analysis and ODEs · Mathematics 2024-05-03 Andrei Martinez-Finkelshtein , Rafael Morales , Daniel Perales

The notion of Ehrhart tensor polynomials, a natural generalization of the Ehrhart polynomial of a lattice polytope, was recently introduced by Ludwig and Silverstein. We initiate a study of their coefficients. In the vector and matrix…

Combinatorics · Mathematics 2017-06-07 Sören Berg , Katharina Jochemko , Laura Silverstein

Let G be a complex reductive algebraic group. We study complete intersections in a spherical homogeneous space G/H defined by a generic collection of sections from G-invariant linear systems. Whenever nonempty, all such complete…

Algebraic Geometry · Mathematics 2015-06-11 Kiumars Kaveh , A. G. Khovanskii

Let $p(z)=a_0+a_1z+a_2z^2+a_3z^3+\cdots+a_nz^n$ be a polynomial of degree $n$ having no zeros in the unit disk. ~Then it is well known that for $R\geq 1,$ $\displaystyle{\max_{|z|=R}|p(z)|}\leq…

Complex Variables · Mathematics 2016-10-27 Eze R. Nwaeze

Let P be an elementary closed semi-algebraic set in R^d, i.e., there exist real polynomials p_1,...,p_s such that P= \{x \in R^d : p_1(x) \ge 0, >..., p_s(x) \ge 0 \}; in this case p_1,...,p_s are said to represent P. Denote by $n$ the…

Algebraic Geometry · Mathematics 2008-04-15 Gennadiy Averkov

We present a Hilbert space geometric approach to the problem of characterizing the positive bivariate trigonometric polynomials that can be represented as the square of a two variable polynomial possessing a certain stability requirement,…

Complex Variables · Mathematics 2016-03-21 Jeffrey S. Geronimo , Plamen Iliev , Greg Knese

We consider the normal matrix model with a cubic potential. The model is ill-defined, and in order to reguralize it, Elbau and Felder introduced a model with a cut-off and corresponding system of orthogonal polynomials with respect to a…

Mathematical Physics · Physics 2015-01-20 Pavel M. Bleher , Arno B. J. Kuijlaars

A polytope in the hyperbolic space $\H^n$ is called an {\it ideal polytope} if all its vertices belong to the boundary of $\H^n$. We prove that no simple ideal Coxeter polytope exist in $\H^n$ for $n>8$.

Metric Geometry · Mathematics 2019-10-30 Anna Felikson , Pavel Tumarkin

We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…

Dynamical Systems · Mathematics 2014-09-29 Vitaly Bergelson , Donald Robertson

Let $E\subset \mathbb Z$ be a set of positive upper density. Suppose that $P_1,P_2,..., P_k\in \mathbb Z[X]$ are polynomials having zero constant terms. We show that the set $E\cap (E-P_1(p-1))\cap ... \cap (E-P_k(p-1))$ is non-empty for…

Dynamical Systems · Mathematics 2015-06-08 Trevor D. Wooley , Tamar D. Ziegler

In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…

Complex Variables · Mathematics 2019-09-11 Sushil Gorai

We use a generalization of Vinogradov's mean value theorem of S. Parsell, S. Prendiville and T. Wooley and ideas of W. Schmidt to give nontrivial bounds for the number of solutions to polynomial congruences, for arbitrary polynomials, when…

Number Theory · Mathematics 2013-02-27 Bryce Kerr

This paper deals with properties of the algebraic variety defined as the set of zeros of a "typical" sequence of polynomials. We consider various types of "nice" varieties: set-theoretic and ideal-theoretic complete intersections,…

Number Theory · Mathematics 2015-12-18 Joachim von zur Gathen , Guillermo Matera

We utilize the same technique as in [arXiv:2205.04254 (2022)] to provide some representations of polynomials non-negative on a basic semi-algebraic set, defined by polynomial inequalities, under more general conditions. Based on each…

Optimization and Control · Mathematics 2022-10-13 Ngoc Hoang Anh Mai

We present a new effective Nullstellensatz with bounds for the degrees which depend not only on the number of variables and on the degrees of the input polynomials but also on an additional parameter called the {\it geometric degree of the…

alg-geom · Mathematics 2008-02-03 Martin Sombra

A polynomial $p\in\mathbb{R}[z_1,\dots,z_n]$ is real stable if it has no roots in the upper-half complex plane. Gurvits's permanent inequality gives a lower bound on the coefficient of the $z_1z_2\dots z_n$ monomial of a real stable…

Data Structures and Algorithms · Computer Science 2017-02-10 Nima Anari , Shayan Oveis Gharan