English
Related papers

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

200 papers

We construct a set $M_d$ whose points parametrize families of Meixner polynomials in $d$ variables. There is a natural bispectral involution $b$ on $M_d$ which corresponds to a symmetry between the variables and the degree indices of the…

Classical Analysis and ODEs · Mathematics 2012-05-25 Plamen Iliev

For a given natural number $n$, the second part of Hilbert's 16th Problem asks whether there exists a finite upper bound for the maximum number of limit cycles that planar polynomial vector fields of degree $n$ can have. This maximum number…

Dynamical Systems · Mathematics 2024-11-15 Claudio A. Buzzi , Douglas D. Novaes

We construct families of explicit polynomials f with rational coefficients that are sums of squares of polynomials over the real numbers, but not over the rational numbers. Whether or not such examples exist was an open question originally…

Algebraic Geometry · Mathematics 2013-06-17 Claus Scheiderer

We consider min-max optimization problems for polynomial functions, where a multivariate polynomial is maximized with respect to a subset of variables, and the resulting maximal value is minimized with respect to the remaining variables.…

Optimization and Control · Mathematics 2023-06-27 Francis Bach

We prove a complex polynomial of degree $n$ has at most $\lceil n/2 \rceil$ attractive fixed points lying on a line. We also consider the general case.

Numerical Analysis · Computer Science 2016-06-09 Terence Coelho , Bahman Kalantari

In this paper, we prove a number of results providing either necessary or sufficient conditions guaranteeing that the number of real roots of real polynomials of a given degree is either less or greater than a given number. We also provide…

Complex Variables · Mathematics 2024-03-20 Olga Katkova , Boris Shapiro , Anna Vishnyakova

The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state…

Combinatorics · Mathematics 2014-03-04 Zipei Nie , Anthony Y. Wang

Assessing non-negativity of multivariate polynomials over the reals, through the computation of {\em certificates of non-negativity}, is a topical issue in polynomial optimization. This is usually tackled through the computation of {\em…

Symbolic Computation · Computer Science 2021-07-27 Victor Magron , Mohab Safey El Din , Trung-Hieu Vu

We present a necessary and sufficient condition for a cubic polynomial to be positive for all positive reals. We identify the set where the cubic polynomial is nonnegative but not all positive for all positive reals, and explicitly give the…

General Mathematics · Mathematics 2020-09-21 Liqun Qi , Yisheng Song , Xinzhen Zhang

Alfeld and Schumaker provide a formula for the dimension of the space of piecewise polynomial functions, called splines, of degree $d$ and smoothness $r$ on a generic triangulation of a planar simplicial complex $\Delta$, for $d \geq 3r+1$.…

Numerical Analysis · Mathematics 2012-10-10 Jan Minac , Stefan O. Tohaneanu

For every positive integer $n$, consider the linear operator $\U_{n}$ on polynomials of degree at most $d$ with integer coefficients defined as follows: if we write $\frac{h(t)}{(1 - t)^{d + 1}} = \sum_{m \geq 0} g(m) t^{m}$, for some…

Combinatorics · Mathematics 2010-09-01 Matthias Beck , Alan Stapledon

We pose and discuss several Hermitian analogues of Hilbert's $17$-th problem. We survey what is known, offer many explicit examples and some proofs, and give applications to CR geometry. We prove one new algebraic theorem: a non-negative…

Complex Variables · Mathematics 2010-12-14 John P. D'Angelo

A simple way to generate a Boolean function is to take the sign of a real polynomial in $n$ variables. Such Boolean functions are called polynomial threshold functions. How many low-degree polynomial threshold functions are there? The…

Probability · Mathematics 2019-07-25 Pierre Baldi , Roman Vershynin

Our probabilistic analysis sheds light to the following questions: Why do random polynomials seem to have few, and well separated real roots, on the average? Why do exact algorithms for real root isolation may perform comparatively well or…

Symbolic Computation · Computer Science 2010-06-01 Ioannis Z. Emiris , André Galligo , Elias Tsigaridas

We prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of semi-algebraically connected components of the realizations of all realizable sign…

Combinatorics · Mathematics 2009-07-14 Saugata Basu , Richard Pollack , Marie-Francoise Roy

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

We consider a tuple $\Phi = (\phi_1,\ldots,\phi_m)$ of commuting maps on a finitary matroid $X$. We show that if $\Phi$ satisfies certain conditions, then for any finite set $A\subseteq X$, the rank of $\{\phi_1^{r_1}\cdots\phi_m^{r_m}(a):a…

Combinatorics · Mathematics 2025-02-06 Antongiulio Fornasiero , Elliot Kaplan

Let $q$ be a power of a prime, let $\mathbb{F}_q$ be the finite field with $q$ elements and let $n \geq 2$. For a polynomial $h(x) \in \mathbb{F}_q[x]$ of degree $n \in \mathbb{N}$ and a subset $W \subseteq [0,n] := \{0, 1, \ldots, n\}$, we…

Number Theory · Mathematics 2016-05-03 Aleksandr Tuxanidy , Qiang Wang

This paper is a systematic study of the Hilbert polynomial of a bigraded algebra R which are generated by elements of bidegrees (1,0), (d_1,1),...,(d_r,1), where d_1,...,d_r are non-negative integers. The obtained results can be applied to…

Commutative Algebra · Mathematics 2007-05-23 Nguyen Duc Hoang , Ngo Viet Trung

The second part of the Hilbert's sixteenth problem consists in determining the upper bound $\mathcal{H}(n)$ for the number of limit cycles that planar polynomial vector fields of degree $n$ can have. For $n\geq2$, it is still unknown…

Dynamical Systems · Mathematics 2022-09-28 Douglas D. Novaes