Problems from Optimization and Computational Algebra Equivalent to Hilbert's Nullstellensatz
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917041297948672 |
|---|---|
| author | Bläser, Markus Dutta, Sagnik Jindal, Gorav |
| author_facet | Bläser, Markus Dutta, Sagnik Jindal, Gorav |
| contents | Efficient algorithms for many problems in optimization and computational algebra often arise from casting them as systems of polynomial equations. Blum, Shub, and Smale formalized this as Hilbert's Nullstellensatz Problem $HN_R$: given multivariate polynomials over a ring $R$, decide whether they have a common solution in $R$. We can also view $HN_R$ as a complexity class by taking the downward closure of the problem $HN_R$ under polynomial-time many-one reductions. In this work, we show that many important problems from optimization and algebra are complete or hard for this class.
We first consider the Affine Polynomial Projection Problem: given polynomials $f,g$, does an affine projection of the variables transform $f$ into $g$? We show that this problem is at least as hard as $HN_F$ for any field $F$. Then we consider the Sparse Shift Problem: given a polynomial, can its number of monomials be reduced by an affine shift of the variables? Prior $HN_R$-hardness for this problem was known for non-field integral domains $R$, which we extend to fields.
For the special case of the real field, HN captures the existential theory of the reals and its complement captures the universal theory of the reals. We prove that the problems of deciding real stability, convexity, and hyperbolicity of a given polynomial are all complete for the universal theory of the reals, thereby pinning down their exact complexity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_19704 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Problems from Optimization and Computational Algebra Equivalent to Hilbert's Nullstellensatz Bläser, Markus Dutta, Sagnik Jindal, Gorav Computational Complexity I.1.2; G.1.6; F.1.3 Efficient algorithms for many problems in optimization and computational algebra often arise from casting them as systems of polynomial equations. Blum, Shub, and Smale formalized this as Hilbert's Nullstellensatz Problem $HN_R$: given multivariate polynomials over a ring $R$, decide whether they have a common solution in $R$. We can also view $HN_R$ as a complexity class by taking the downward closure of the problem $HN_R$ under polynomial-time many-one reductions. In this work, we show that many important problems from optimization and algebra are complete or hard for this class. We first consider the Affine Polynomial Projection Problem: given polynomials $f,g$, does an affine projection of the variables transform $f$ into $g$? We show that this problem is at least as hard as $HN_F$ for any field $F$. Then we consider the Sparse Shift Problem: given a polynomial, can its number of monomials be reduced by an affine shift of the variables? Prior $HN_R$-hardness for this problem was known for non-field integral domains $R$, which we extend to fields. For the special case of the real field, HN captures the existential theory of the reals and its complement captures the universal theory of the reals. We prove that the problems of deciding real stability, convexity, and hyperbolicity of a given polynomial are all complete for the universal theory of the reals, thereby pinning down their exact complexity. |
| title | Problems from Optimization and Computational Algebra Equivalent to Hilbert's Nullstellensatz |
| topic | Computational Complexity I.1.2; G.1.6; F.1.3 |
| url | https://arxiv.org/abs/2510.19704 |