English
Related papers

Related papers: On Hilbert's 17th problem in low degree

200 papers

For any real polynomial $p(x)$ of even degree $n$, Shapiro [{\it Arnold Math. J.} 1(1) (2015), 91--99] conjectured that the sum of the number of real zeros of $(n-1)(p')^2 - np p''$ and the number of real zeros of $p$ is positive. We…

Complex Variables · Mathematics 2025-10-13 Lande Ma , Zhaokun Ma

A polynomial $p \in \mathbb{R}[z_1, \cdots, z_n]$ is called real stable if it is non-vanishing whenever all the variables take values in the upper half plane. A well known result of Elliott Lieb and Alan Sokal states that if $p$ and $q$ are…

Functional Analysis · Mathematics 2017-04-21 Mohan Ravichandran

In Ehrhart theory, the well-known sign pattern problem asks: given a positive integer $d\geq 3$ and integers $1 \leq i_1 < \cdots < i_k \leq d-2$, does there exist a $d$-dimensional integral polytope $\mathcal{P}$ such that in its Ehrhart…

Combinatorics · Mathematics 2026-05-26 Feihu Liu , Sihao Tao , Guoce Xin

We show that positivity on $\mathbb{R}_+^n$ and on $\mathbb{R}^n$ of real symmetric polynomials of degree at most $p$ in $n\ge2$ variables is solvable by algorithms running in $\mathrm{poly}(n)$ time. For real symmetric quartics, we find…

Algebraic Geometry · Mathematics 2020-11-10 Vlad Timofte , Aida Timofte

This article investigates the existence of an $r$-primitive $k$-normal polynomial, defined as the minimal polynomial of an $r$-primitive $k$-normal element in $\mathbb{F}_{q^n}$, with a specified degree $n$ and two given coefficients over…

Number Theory · Mathematics 2024-06-03 Avnish K. Sharma , Mamta Rani , Sharwan K. Tiwari , Anupama Panigrahi

For each $n$, let RD$(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In this paper, we recover an algorithm of Sylvester for determining…

Algebraic Geometry · Mathematics 2022-11-15 Curtis Heberle , Alexander J. Sutherland

Let $\RR$ be a real closed field (e.g. the field of real numbers) and $\mathscr{S} \subset \RR^n$ be a semi-algebraic set defined as the set of points in $\RR^n$ satisfying a system of $s$ equalities and inequalities of multivariate…

Symbolic Computation · Computer Science 2013-09-20 Mohab Safey El Din , Elias Tsigaridas

David Hilbert proved that a non-negative real quartic form f(x,y,z) is the sum of three squares of quadratic forms. We give a new proof which shows that if the complex plane curve Q defined by f is smooth, then f has exactly 8 such…

Algebraic Geometry · Mathematics 2010-03-29 Victoria Powers , Bruce Reznick , Claus Scheiderer , Frank Sottile

The Schm\"udgen's Positivstellensatz gives a certificate to verify positivity of a strictly positive polynomial $f$ on a compact, basic, semi-algebraic set $\mathbf{K} \subset \mathbb{R}^n$. A Positivstellensatz of this type is called…

Optimization and Control · Mathematics 2024-12-19 Etienne de Klerk , Juan Vera Lizcano

Let $P_1,...,P_n$ be generic homogeneous polynomials in $n$ variables of degrees $d_1,...,d_n$ respectively. We prove that if $\nu$ is an integer satisfying ${\sum_{i=1}^n d_i}-n+1-\min\{d_i\}<\nu,$ then all multivariate subresultants…

Algebraic Geometry · Mathematics 2007-05-23 Laurent Busé , Carlos D'Andrea

We provide a new degree bound on the weighted sum-of-squares (SOS) polynomials for Putinar-Vasilescu's Positivstellensatz. This leads to another Positivstellensatz saying that if $f$ is a polynomial of degree at most $2 d_f$ nonnegative on…

Optimization and Control · Mathematics 2021-05-28 Ngoc Hoang Anh Mai , Victor Magron

I investigate on the number t of real eigenvectors of a real symmetric tensor. In particular, given a homogeneous polynomial f of degree d in 3 variables, i prove that t is greater or equal than 2c+1, if d is odd and t is greater or equal…

Algebraic Geometry · Mathematics 2016-12-16 Mauro Maccioni

This paper investigates the number of monic integer polynomials of degree $n$ whose roots are all real and positive. We establish an asymptotic formula for the case of fixed trace by estimating the number of integer sequences satisfying…

Number Theory · Mathematics 2025-09-19 Pavlo Yatsyna , Błażej Żmija

Let $B_{n}(t)$ be a $n$-th Stern polynomial and let $e(n)=\op{deg}B_{n}(t)$ be its degree. In this note we continue our study started in \cite{Ul} of the arithmetic properties of the sequence of Stern polynomials and the sequence…

Combinatorics · Mathematics 2011-02-28 Maciej Ulas

Schm\"udgen's Theorem says that if a basic closed semialgebraic set K = {g_1 \geq 0, ..., g_s \geq 0} in R^n is compact, then any polynomial f which is strictly positive on K is in the preordering generated by the g_i's. Putinar's Theorem…

Algebraic Geometry · Mathematics 2009-11-09 Victoria Powers

A polynomial of degree $n$ in two variables is shown to be uniquely determined by its Radon projections taken over $[n/2]+1$ parallel lines in each of the $(2[(n+1)/2]+1)$ equidistant directions along the unit circle.

Numerical Analysis · Mathematics 2007-05-23 Borislav Bojanov , Yuan Xu

Let $K$ be a number field and $f_1,\ldots,f_s\in K[x_1,\ldots,x_n]$ forms of odd degrees. In 1957, Birch proved that if $n$ is sufficiently large then the forms always have a nontrivial zero in $K^n$. Apart from some small degrees, the…

Number Theory · Mathematics 2025-12-02 Amichai Lampert , Andrew Snowden , Tamar Ziegler

Hilbert's ternary quartic theorem states that every nonnegative degree 4 homogeneous polynomial in three variables can be written as a sum of three squares of homogeneous quadratic polynomials. We give a linear-algebraic approach to…

Algebraic Geometry · Mathematics 2019-05-14 Anatolii Grinshpan , Hugo J. Woerdeman

In 2008, M. Marshall settled a long-standing open problem by showing that if f(x,y) is a polynomial that is non-negative on the strip [0,1] x R, then there exist sums of squares s(x,y) and t(x,y) such that f(x,y) = s(x,y) + (x - x^2)…

Algebraic Geometry · Mathematics 2010-09-21 Ha Nguyen , Victoria Powers

In this paper, two structural results concerning low degree polynomials over finite fields are given. The first states that over any finite field $\mathbb{F}$, for any polynomial $f$ on $n$ variables with degree $d \le \log(n)/10$, there…

Computational Complexity · Computer Science 2014-04-03 Gil Cohen , Avishay Tal