English
Related papers

Related papers: Hilbert's Nullstellensatz is in the Counting Hiera…

200 papers

We consider a system of integer polynomials of the same degree with non-singular local zeros and in many variables. Generalising the work of Birch (1962) we find quantitative asymptotics (in terms of the maximum of the absolute value of the…

Number Theory · Mathematics 2020-11-10 Jan-Willem M. van Ittersum

The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…

Cryptography and Security · Computer Science 2022-09-22 Alessio Caminata , Elisa Gorla

Satisfiability of Boolean circuits is among the most known and important problems in theoretical computer science. This problem is NP-complete in general but becomes polynomial time when restricted either to monotone gates or linear gates.…

Computational Complexity · Computer Science 2017-10-24 Paweł M. Idziak , Jacek Krzaczkowski

We present bounds for the degree and the height of the polynomials arising in some central problems in effective algebraic geometry including the implicitation of rational maps and the effective Nullstellensatz over a variety. Our treatment…

Algebraic Geometry · Mathematics 2012-10-23 Carlos D'Andrea , Teresa Krick , Martin Sombra

This paper presents an expository reverse-mathematical analysis of two fundamental theorems in commutative algebra: Hilbert's Nullstellensatz and Basis Theorem. In addition to its profound significance in commutative algebra and algebraic…

Logic · Mathematics 2024-06-04 Dhruv Kulshreshtha

We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…

Algebraic Geometry · Mathematics 2025-10-20 J. Maurice Rojas

We present sharp estimates for the degree and the height of the polynomials in the Nullstellensatz over $\Z$. The result improves previous work of Philippon, Berenstein-Yger and Krick-Pardo. We also present degree and height estimates of…

Algebraic Geometry · Mathematics 2007-05-23 Teresa Krick , Luis Miguel Pardo , Martin Sombra

In this paper an equation means a homogeneous linear partial differential equation in $n$ unknown functions of $m$ variables which has real or complex polynomial coefficients. The solution set consists of all $n$-tuples of real or complex…

Rings and Algebras · Mathematics 2018-04-24 Jaka Cimprič

The Nullstellensatz, proved by Hilbert in 1893, is a classical result that holds when the base field is algebraically closed. When the base field is finite, a version of Hilbert's Nullstellensatz is given by Terjanian in 1966. Laksov in…

Commutative Algebra · Mathematics 2025-05-09 Rati Ludhani

We introduce and investigate a category-theoretic abstraction of the standard "system-solution" adjunction in affine algebraic geometry. We then look further into these geometric adjunctions at different levels of generality, from syntactic…

Category Theory · Mathematics 2018-03-14 Olivia Caramello , Vincenzo Marra , Luca Spada

The (weak) Nullstellensatz over finite fields says that if $P_1,\ldots,P_m$ are $n$-variate degree-$d$ polynomials with no common zero over a finite field $\mathbb{F}$ then there are polynomials $R_1,\ldots,R_m$ such that…

Combinatorics · Mathematics 2022-09-14 Guy Moshkovitz , Jeffery Yu

We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…

Computational Complexity · Computer Science 2016-06-09 Gabor Ivanyos , Miklos Santha

This article extends the classical Real Nullstellensatz to matrices of polynomials in a free $\ast$-algebra $\RR\axs$ with $x=(x_1, \ldots, x_n)$. This result is a generalization of a result of Cimpri\vc, Helton, McCullough, and the author.…

Operator Algebras · Mathematics 2013-05-06 Christopher S. Nelson

We study the problem of counting the total number of affine solutions of a system of n binomials in n variables over an algebraically closed field of characteristic zero. We show that we may decide in polynomial time if that number is…

Commutative Algebra · Mathematics 2007-05-23 Eduardo Cattani , Alicia Dickenstein

In this expository paper, we present simple proofs of the Classical, Real, Projective and Combinatorial Nullstellens\"atze. Several applications are also presented such as a classical theorem of Stickelberger for solutions of polynomial…

Commutative Algebra · Mathematics 2022-02-25 Kriti Goel , Dilip P. Patil , Jugal Verma

The bivariate difference filed $(\mathbb{F}(\alpha, \beta), \sigma)$ provides an algebraic framework for a sequence satisfying a recurrence of order two and it could transform the summation involving a sequence satisfying a recurrence of…

Combinatorics · Mathematics 2024-01-23 Yarong Wei

In this paper we prove a strong version of the Hilbert Nullstellensatz in the ring $\mathbb H[q_1,\ldots,q_n]$ of slice regular polynomials in several quaternionic variables. Our proof deeply depends on a detailed analysis of the common…

Complex Variables · Mathematics 2025-09-16 Anna Gori , Giulia Sarfatti , Fabio Vlacci

We prove a Nullstellensatz for the ring of polynomial functions in n non-commuting variables over Hamilton's ring of real quaternions. We also characterize the generalized polynomial identities in n variables which hold over the…

Rings and Algebras · Mathematics 2020-09-15 Gil Alon , Elad Paran

Understanding bounds for the effective differential Nullstellensatz is a central problem in differential algebraic geometry. Recently, several bounds have been obtained using Dicksonian and antichains sequences (with a given growth rate).…

Commutative Algebra · Mathematics 2020-11-17 Omar León Sánchez , Alexey Ovchinnikov

The multivariate resultant is a fundamental tool of computational algebraic geometry. It can in particular be used to decide whether a system of n homogeneous equations in n variables is satisfiable (the resultant is a polynomial in the…

Computational Complexity · Computer Science 2012-10-05 Bruno Grenet , Pascal Koiran , Natacha Portier