English
Related papers

Related papers: Sums of Squares on the Hypercube

200 papers

We introduce a method for proving lower bounds on the efficacy of semidefinite programming (SDP) relaxations for combinatorial problems. In particular, we show that the cut, TSP, and stable set polytopes on $n$-vertex graphs are not the…

Computational Complexity · Computer Science 2014-11-25 James R. Lee , Prasad Raghavendra , David Steurer

Artin solved Hilbert's $17^{th}$ problem by showing that every positive semidefinite polynomial can be realized as a sum of squares of rational functions. Pfister gave a bound on the number of squares of rational functions: if $p$ is a…

Rings and Algebras · Mathematics 2011-02-10 Martin Harrison

Any homogeneous polynomial $P(x, y, z)$ of degree $d$, being restricted to a unit sphere $S^2$, admits essentially a unique representation of the form $\lambda_0 + \sum_{k = 1}^d \lambda_k [\prod_{j = 1}^k L_{kj}]$, where $L_{kj}$'s are…

Complex Variables · Mathematics 2007-05-23 Gabriel Katz

Energy functions offer natural extensions of controllability and observability Gramians to nonlinear systems, enabling various applications such as computing reachable sets, optimizing actuator and sensor placement, performing balanced…

Optimization and Control · Mathematics 2024-08-23 Hamza Adjerid , Jeff Borggaard

We develop several notions of multiplicity for linear factors of multivariable polynomials over different arithmetics (hyperfields). The key example is multiplicities over the hyperfield of signs, which encapsulates the arithmetic of…

Algebraic Geometry · Mathematics 2023-07-19 Andreas Gross , Trevor Gunn

The decomposition of the polynomials on the quaternionic unit sphere in $\Hd$ into irreducible modules under the action of the quaternionic unitary (symplectic) group and quaternionic scalar multiplication has been studied by several…

Representation Theory · Mathematics 2024-05-22 Mozhgan Mohammadpour , Shayne Waldron

We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained…

Optimization and Control · Mathematics 2022-04-15 Daniel Bienstock , Alberto del Pia , Robert Hildebrand

Given $p$ polynomials with coefficients in a commutative unitary integral ring $\mathcal{C}$ containing $\mathbb{Q}$, we define the notion of a generic Bernstein-Sato polynomial on an irreducible affine scheme $V \subset…

Algebraic Geometry · Mathematics 2007-05-23 Rouchdi Bahloul

We count algebraic points of bounded height and degree on the graphs of certain functions analytic on the unit disk, obtaining a bound which is polynomial in the degree and in the logarithm of the multiplicative height. We combine this work…

Number Theory · Mathematics 2019-02-12 Gareth Boxall , Gareth Jones , Harry Schmidt

We study the irreducible quotient $\mathcal{L}_{t,c}$ of the polynomial representation of the rational Cherednik algebra $\mathcal{H}_{t,c}(S_n,\mathfrak{h})$ of type $A_{n-1}$ over an algebraically closed field of positive characteristic…

Representation Theory · Mathematics 2021-06-10 Merrick Cai , Daniil Kalinov

Theorem. An irreducible cubic polynomial with rational coefficients has a root in a one step radical extension of Q if and only if the discriminate is a square of a rational number. Theorem. An irreducible polynomial x^4+px^2+qx+s with…

History and Overview · Mathematics 2015-11-16 Danil Akhtyamov , Ilya Bogdanov

Given a polynomial $p$ with no zeros in the polydisk, or equivalently the poly-upper half-plane, we study the problem of determining the ideal of polynomials $q$ with the property that the rational function $q/p$ is bounded near a boundary…

Complex Variables · Mathematics 2025-07-15 Kelly Bickel , Greg Knese , James Eldred Pascoe , Alan Sola

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 sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem.…

Optimization and Control · Mathematics 2013-03-07 Peter Seiler , Qian Zheng , Gary Balas

Let $P_N(R)$ be the space of all real polynomials in $N$ variables with the usual inner product $<, >$ on it, given by integrating over the unit sphere. We start by deriving an explicit combinatorial formula for the bilinear form…

Number Theory · Mathematics 2009-12-14 Lenny Fukshansky

We study nonnegative and sums of squares symmetric (and even symmetric) functions of fixed degree. We can think of these as limit cones of symmetric nonnegative polynomials and symmetric sums of squares of fixed degree as the number of…

Algebraic Geometry · Mathematics 2024-08-09 Jose Acevedo , Grigoriy Blekherman , Sebastian Debus , Cordian Riener

We provide an upper bound on the uniform exponent of approximation to a triple (xi, xi^2, xi^3) by rational numbers with the same denominator, valid for any transcendental real number xi. This upper bound refines a previous result of…

Number Theory · Mathematics 2015-05-13 Damien Roy

This paper solves the rational noncommutative analog of Hilbert's 17th problem: if a noncommutative rational function is positive semidefinite on all tuples of hermitian matrices in its domain, then it is a sum of hermitian squares of…

Rings and Algebras · Mathematics 2021-08-23 Jurij Volčič

Let $k$ be an algebraically closed field, and let $C\subset \mathbb{P}^n_k$ be a reduced closed subscheme with ideal sheaf $\mathcal{I}$. Let $\mathcal{I}^{<2>}$ be the second symbolic power of $\mathcal{I}$. When $C$ is an integral curve,…

Algebraic Geometry · Mathematics 2024-06-04 Kaloyan Slavov

Let g be a cubic polynomial with integer coefficients and n>9 variables, and assume that the congruence g=0 modulo p^k is soluble for all prime powers p^k. We show that the equation g=0 has infinitely many integer solutions when the cubic…

Number Theory · Mathematics 2007-06-19 T. D. Browning , D. R. Heath-Brown