相关论文: Early proofs of Hilbert's Nullstellensatz

Using the Rabinowitsch trick, we prove a version of Nullstellensatz over quaternions, which generalizes Hilbert's Nullstellensatz over complex numbers.

The aim of this note is to present an easy proof of Hilbert's Nullstellensatz using Groebner basis. I believe, that the proof has some methodical advantage in a course on Groebner bases. Key words: Hilbert's Nullstellensatz, Groebner bases.

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…

In this note we give a short, direct proof of the well known Combinatorial Nullstellensatz.

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…

We give an undergraduate short and simple proof for Zariski's lemma.

We show that Hilbert's Nullstellensatz, the problem of deciding if a system of multivariate polynomial equations has a solution in the algebraic closure of the underlying field, lies in the counting hierarchy. More generally, we show that…

Using polynomial equations to model combinatorial problems has been a popular tool both in computational combinatorics as well as an approach to proving new theorems. In this paper, we look at several combinatorics problems modeled by…

Almost from the inception of Hilbert's program, foundational and structural efforts in proof theory have been directed towards the goal of clarifying the computational content of modern mathematical methods. This essay surveys various…

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…

Hilbert's Irreducibility Theorem is a cornerstone that joins areas of analysis and number theory. Both the genesis and genius of its proof involved combining real analysis and combinatorics. We try to expose the motivations that led Hilbert…

In the 1920s, Ackermann and von Neumann, in pursuit of Hilbert's Programme, were working on consistency proofs for arithmetical systems. One proposed method of giving such proofs is Hilbert's epsilon-substitution method. There was, however,…

Hilbert's Nullstellensatz is one of the most fundamental correspondences between algebra and geometry, and has inspired a plethora of noncommutative analogs. In last two decades, there has been an increased interest in understanding…

We compile a long list of equivalent formulations of Hilbert's Nullstellensatz in infinite dimensions, and prove a persistence result for the strong Nullstellensatz in large polynomial rings.

Given a set of integers W, the Partition problem determines whether W can be divided into two disjoint subsets with equal sums. We model the Partition problem as a system of polynomial equations, and then investigate the complexity of a…

A Nullstellensatz is a theorem providing information on polynomials that vanish on a certain set: David Hilbert's Nullstellensatz (1893) is a cornerstone of algebraic geometry, and Noga Alon's Combinatorial Nullstellensatz (1999) is a…

This paper contains an alternate proof of the Schanuel Nullstellensatz for Zilber's Pseudoexponentiation. Furthermore, in an algebraically closed exponential field whose exponential map is surjective with standard kernel, this property…

We discuss here some computational aspects of the Combinatorial Nullstellensatz argument. Our main result shows that the order of magnitude of the symmetry group associated with permutations of the variables in algebraic constraints,…

The geometric form of Hilbert's Nullstellensatz may be understood as a property of "geometric saturation" in algebraically closed fields. We conceptualise this property in the language of first order logic, following previous approaches and…

In this expository note we show how combinatorial Nullstellensatz by N. Alon naturally appears in solutions of elementary problems. Simple ideas gradually and naturally appear in such solutions, thus bringing a reader to generalizations.…