Related papers: Hypergeometric polynomials are optimal

We show that every bounded hyperconvex Reinhardt domain can be approximated by special polynomial polyhedra defined by homogeneous polynomial mappings. This is achieved by means of approximation of the pluricomplex Green function of the…

It is known that solutions of the KZ equations can be written in the form of multidimensional hypergeometric integrals. In 2017 in a joint paper of the author with V. Schechtman the construction of hypergeometric solutions was modified, and…

Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…

We consider polynomials on the intersection of the closed positive orthant with the height-$1$ level hypersurface of certain polynomials with positive coefficients. We show that any polynomial strictly positive on such a semi-algebraic set…

We prove that every indefinite quadratic form with non-negative integer coefficients is the volume polynomial of a pair of lattice polygons. This solves the discrete version of the Heine-Shephard problem for two bodies in the plane. As an…

Let H = <n_1,...,n_e> be a numerical semigroup generated by e elements. Let k[H]= k[x_1, .... , x_e]/I_H = S/I_H be the semigroup ring of H over k. We define inverse polynomial J_{H,h} for h in H and express the defining ideal of I_H using…

Let $\Bbbk$ be a field of characteristic $p>0$, $V$ a finite-dimensional $\Bbbk$-vector-space, and $G$ a finite $p$-group acting $\Bbbk$-linearly on $V$. Let $S = \Sym V^*$. We show that $S^G$ is a polynomial ring if and only if the…

We observe that a large part of the volume of a hyperbolic polyhedron is taken by a tubular neighbourhood of its boundary, and use this to give a new proof for the finiteness of arithmetic maximal reflection groups following a recent work…

We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures…

We study the class of polynomials whose Hessians evaluated at any point of a closed convex cone have Lorentzian signature. This class is a generalization to the remarkable class of Lorentzian polynomials. We prove that hyperbolic…

We note that the recent polynomial proofs of the spherical and complex plank covering problems by Zhao and Ortega-Moreno give some general information on zeros of real and complex polynomials restricted to the unit sphere. As a corollary of…

With the goal of obtaining strong relaxations for binary polynomial optimization problems, we introduce the pseudo-Boolean polytope defined as the convex hull of the set of binary points satisfying a collection of equations containing…

Polar weighted homogeneous polynomials are the class of special polynomials of real variables $x_i,y_i, i=1,..., n$ with $z_i=x_i+\sqrt{-1} y_i$, which enjoys a "polar action". In many aspects, their behavior looks like that of complex…

Let $R$ be a commutative Noetherian ring, $I$ an ideal, $M$ and $N$ finitely generated $R$-modules. Assume $V(I)\cap Supp(M)\cap Supp(N)$ consists of finitely many maximal ideals and let ${\l}(\e^i(N/I^nN,M))$ denote the length of…

In this paper we study the following hypergeometric polynomials: $\mathcal{P}_n(x) = \mathcal{P}_n(x;\alpha,\beta,\delta_1,\dots,\delta_\rho,\kappa_1,\dots,\kappa_\rho) = {}_{\rho+2} F_{\rho+1}…

We characterize the class of ideals of a polynomial ring such that the hilbert series of their graded local cohomology modules is maximal.

Let $p(z)$ be a complex polynomial of degree $n\ge 2$. For each $c\in\mathbb{C}$, let $K_c$ denote the convex hull of the zeros of $p(z)+c$, and let $K'$ denote the convex hull of the zeros of $p'(z)$. We prove that…

Given a compact parameter set $Y\subset R^p$, we consider polynomial optimization problems $(P_y$) on $R^n$ whose description depends on the parameter $y\inY$. We assume that one can compute all moments of some probability measure $\phi$ on…

A multivariate polynomial $p(x)=p(x_1,...,x_n)$ is sos-convex if its Hessian $H(x)$ can be factored as $H(x)= M^T(x) M(x)$ with a possibly nonsquare polynomial matrix $M(x)$. It is easy to see that sos-convexity is a sufficient condition…

We show the existence of an FPTAS for the problem of maximizing a non-negative polynomial over mixed-integer sets in convex polytopes, when the number of variables is fixed.