English
Related papers

Related papers: Hypergeometric polynomials are optimal

200 papers

We study the polynomial optimization problem of minimizing a multihomogeneous polynomial over the product of spheres. This polynomial optimization problem models the tensor optimization problem of finding the best rank one approximation of…

Optimization and Control · Mathematics 2025-12-16 Sami Halaseh , Victor Magron , Mateusz Skomra

Let $f, f_1, \ldots, f_\nV$ be polynomials with rational coefficients in the indeterminates $\bfX=X_1, \ldots, X_n$ of maximum degree $D$ and $V$ be the set of common complex solutions of $\F=(f_1,\ldots, f_\nV)$. We give an algorithm…

Symbolic Computation · Computer Science 2014-05-08 Aurélien Greuet , Mohab Safey El Din

The breakthrough paper of Croot, Lev, Pach \cite{CLP} on progression-free sets in $\Z_4^n$ introduced a polynomial method that has generated a wealth of applications, such as Ellenberg and Gijswijt's solutions to the cap set problem…

Combinatorics · Mathematics 2017-01-26 Pierre-Yves Bienvenu

We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…

Optimization and Control · Mathematics 2024-06-17 Martin Plávala , Laurens T. Ligthart , David Gross

We explicitly characterize when the Milnor number at the origin of a polynomial or power series (over an algebraically closed field k of arbitrary characteristic) is the minimum of all polynomials with the same Newton diagram, which…

Algebraic Geometry · Mathematics 2016-12-16 Pinaki Mondal

We illustrate an efficient new method for handling polynomial systems with degenerate solution sets. In particular, a corollary of our techniques is a new algorithm to find an isolated point in every excess component of the zero set (over…

Algebraic Geometry · Mathematics 2009-09-25 J. Maurice Rojas

In this paper we obtain quite general and definitive forms for Hardy-Littlewood type inequalities. Moreover, when restricted to the original particular cases, our approach provides much simpler and straightforward proofs and we are able to…

Functional Analysis · Mathematics 2014-06-24 Nacib Albuquerque , Frédéric Bayart , Daniel Pellegrino , Juan B. Seoane-Sepúlveda

We study some systems of polynomials whose support lies in the convex hull of a circuit, giving a sharp upper bound for their numbers of real solutions. This upper bound is non-trivial in that it is smaller than either the Kouchnirenko or…

Algebraic Geometry · Mathematics 2010-03-29 Benoit Bertrand , Frederic Bihan , Frank Sottile

Let K be F_q((T)), or more generally any field of characteristic p equipped with a valuation having a finite residue field of q elements. Then a polynomial f(x) in K[x] having k+1 nonzero coefficients has at most q^k distinct zeros in K. We…

Number Theory · Mathematics 2017-04-03 Bjorn Poonen

Let d>2 and let p be a prime coprime to d. Let Z_pbar be the ring of integers of Q_pbar. Suppose f(x) is a degree-d polynomial over Qbar and Z_pbar. Let P be a prime ideal over p in the ring of integers of Q(f), where Q(f) is the number…

Number Theory · Mathematics 2007-05-23 Hui June Zhu

The cut polytope of a graph is an important object in several fields, such as functional analysis, combinatorial optimization, and probability. For example, Sturmfels and Sullivant showed that the toric ideals of cut polytopes are useful in…

Combinatorics · Mathematics 2020-04-13 Ryuichi Sakamoto

Let $p(x_1,...,x_n) = p(X), X \in R^{n}$ be a homogeneous polynomial of degree $n$ in $n$ real variables, $e = (1,1,..,1) \in R^n$ be a vector of all ones . Such polynomial $p$ is called $e$-hyperbolic if for all real vectors $X \in R^{n}$…

Combinatorics · Mathematics 2007-05-23 Leonid Gurvits

Let $S=K[x_1, \ldots,x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and $I(G) \subset S$ the edge ideal of a finite graph $G$ on $n$ vertices. Given a vector $\mathfrak{c}\in\mathbb{N}^n$ and an integer $q\geq 1$, we…

Commutative Algebra · Mathematics 2025-10-14 Takayuki Hibi , Seyed Amin Seyed Fakhari

We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…

Mathematical Physics · Physics 2023-07-20 Danilo Latini , Ian Marquette , Yao-Zhong Zhang

We propose a new property of the zeros of exceptional orthogonal polynomials. It has been known that exceptional orthogonal polynomials (XOP) have both real and complex zeros. By fixing m variables at the imaginary parts of the complex…

Classical Analysis and ODEs · Mathematics 2017-07-18 Yu Luo

A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…

Mathematical Physics · Physics 2007-05-23 Nicolae Cotfas

About two decades ago, Tsfasman and Boguslavsky conjectured a formula for the maximum number of common zeros that $r$ linearly independent homogeneous polynomials of degree $d$ in $m+1$ variables with coefficients in a finite field with $q$…

Algebraic Geometry · Mathematics 2018-01-30 Peter Beelen , Mrinmoy Datta , Sudhir R. Ghorpade

Hyperbolic polynomials have been of recent interest due to applications in a wide variety of fields. We seek to better understand these polynomials in the case when they are symmetric, i.e. invariant under all permutations of variables. We…

Algebraic Geometry · Mathematics 2023-08-21 Grigoriy Blekherman , Julia Lindberg , Kevin Shu

We prove several results on homogeneous plurisubharmonic polynomials on $\mathbb{C}^n$, $n\in\mathbb{Z}_{\geq 2}$. Said results are relevant to the problem of constructing local bumpings at boundary points of pseudoconvex domains of finite…

Complex Variables · Mathematics 2021-03-15 Lars Simon

We develop numerical homotopy algorithms for solving systems of polynomial equations arising from the classical Schubert calculus. These homotopies are optimal in that generically no paths diverge. For problems defined by hypersurface…

alg-geom · Mathematics 2025-10-20 Birkett Huber , Frank Sottile , Bernd Sturmfels
‹ Prev 1 8 9 10 Next ›