English
Related papers

Related papers: On degree bounds for the sparse Nullstellensatz

200 papers

In [4] Sturmfels linked the Hilbert Nullstellensatz to Gr\"obner bases through final polynomials. In (loc. cit.) it was claimed that final polynomials always appear in a lexicographic Gr\"obner basis of a certain ideal. In this paper, we…

Commutative Algebra · Mathematics 2024-05-28 Peter Lundgaard , Andreas Bøgh Poulsen

We study the vanishing sets of slice regular polynomials in several quaternionic variables. We obtain a geometric description of the vanishing sets in two variables, which leads to a new version of the Strong Hilbert Nullstellensatz in the…

Complex Variables · Mathematics 2023-11-10 Anna Gori , Giulia Sarfatti , Fabio Vlacci

We present new bounds for the numerical radius of bounded linear operators and $2\times 2$ operator matrices. We apply upper bounds for the numerical radius to the Frobenius companion matrix of a complex monic polynomial to obtain new…

Functional Analysis · Mathematics 2020-01-28 Pintu Bhunia , Santanu Bag , Raj Kumar Nayak , Kallol Paul

We show that, for a system of univariate polynomials given in sparse encoding, we can compute a single polynomial defining the same zero set, in time quasi-linear in the logarithm of the degree. In particular, it is possible to determine…

Algebraic Geometry · Mathematics 2014-04-15 Francesco Amoroso , Louis Leroux , Martin Sombra

Let $J\subsetneq I$ be two ideals of a polynomial ring $S$ over a field, generated by square free monomials. We show that some inequalities among the numbers of square free monomials of $I\setminus J$ of different degrees give upper bounds…

Commutative Algebra · Mathematics 2012-06-19 Dorin Popescu

In this paper we prove a Nullstellensatz for supersymmetric polynomials. This gives a bijection between radical ideals and superalgebraic sets. These are algebraic sets which are invariant under the Weyl groupoid of Sergeev and Veselov,…

Rings and Algebras · Mathematics 2019-05-13 Ian M. Musson

We establish new results on root separation of integer, irreducible polynomials of degree at least four. These improve earlier bounds of Bugeaud and Mignotte (for even degree) and of Beresnevich, Bernik, and Goetze (for odd degree).

Number Theory · Mathematics 2014-02-26 Yann Bugeaud , Andrej Dujella

Harm Derksen made a conjecture concerning degree bounds for the syzygies of rings of polynomial invariants in the non-modular case. We provide counterexamples to this conjecture, but also prove a slightly weakened version. We also prove…

Commutative Algebra · Mathematics 2014-10-02 Marc Chardin , Peter Symonds

Real Nullstellensatz is a classical result from Real Algebraic Geometry. It has recently been extended to quaternionic polynomials by Alon and Paran. The aim of this paper is to extend their Quaternionic Nullstellensatz to matrix…

Rings and Algebras · Mathematics 2022-01-06 J. Cimprič

In this paper we define the algebraic sets and the ideal of points for bijective skew PBW extensions with coefficients in left Noetherian domains. Some properties of affine algebraic sets of commutative algebraic geometry will be extended,…

Algebraic Geometry · Mathematics 2021-06-25 Oswaldo Lezama

Over finite fields, if the image of a polynomial map is not the entire field, then its cardinality can be bounded above by a significantly smaller value. Earlier results bound the cardinality of the value set using the degree of the…

Number Theory · Mathematics 2015-07-24 Luke Smith

We upper bound the number of common zeros over a finite grid of multivariate polynomials and an arbitrary finite collection of their consecutive Hasse derivatives (in a coordinate-wise sense). To that end, we make use of the tool from…

Information Theory · Computer Science 2017-07-06 Olav Geil , Umberto Martínez-Peñas

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…

Computational Complexity · Computer Science 2025-10-28 Markus Bläser , Sagnik Dutta , Gorav Jindal

We establish doubly-exponential degree bounds for Gr\"obner bases in certain algebras of solvable type over a field (as introduced by Kandri-Rody and Weispfenning). The class of algebras considered here includes commutative polynomial…

Commutative Algebra · Mathematics 2008-11-19 Matthias Aschenbrenner , Anton Leykin

We develop recent ideas of Elsholtz, Proske, and Sauermann to construct denser subsets of $\{1,\dots,N\}$ that lack arithmetic progressions of length $3$. This gives the first quasipolynomial improvement since the original construction of…

Combinatorics · Mathematics 2024-07-03 Zach Hunter

We consider almost-primes of the form $f(p)$ where $f$ is an irreducible polynomial over $\mathbb Z$ and $p$ runs over primes. We improve a result of Richert for polynomials of degree at least $3$. In particular we show that, when the…

Number Theory · Mathematics 2017-05-17 A. J. Irving

We study the problem of determining which integer polynomials divide Newman polynomials. In this vein, we first give results concerning the $8438$ known polynomials with Mahler measure less than $1.3$. We then exhibit a list of polynomials…

Number Theory · Mathematics 2026-04-29 Musbahu Idris , Jean-Marc Sac-Épée

We significantly strengthen and generalize the theorem lifting Nullstellensatz degree to monotone span program size by Pitassi and Robere (2018) so that it works for any gadget with high enough rank, in particular, for useful gadgets such…

Computational Complexity · Computer Science 2020-01-08 Susanna F. de Rezende , Or Meir , Jakob Nordström , Toniann Pitassi , Robert Robere , Marc Vinyals

We study the number of degree $n$ number fields with discriminant bounded by $X$. In this article, we improve an upper bound due to Schmidt on the number of such fields that was previously the best known upper bound for $6 \leq n \leq 94$.

We study two polynomial counting questions in arithmetic statistics via a combination of Fourier analytic and arithmetic methods. First, we obtain new quantitative forms of Hilbert's Irreducibility Theorem for degree $n$ polynomials $f$…