A combinatorial proof of the effective Nullstellensatz

DOI10.1006/JSCO.1993.1020MaRDI QIDQ2368067zbMATH OpenOpenAlexFDO

Authors Thomas W. Dubé

Publication date 22 August 1993

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jsco.1993.1020

zbMATH Keywords

effective Nullstellensatz

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Relevant commutative algebra (14A05) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Review text

The degree bound in the effective Nullstellensatz is obtained using combinatorial methods, namely counting arguments for the ideal \(I\).

Cited in

(15)

• A sparse effective Nullstellensatz
• Bounds for the Hilbert function of polynomial ideals and for the degrees in the Nullstellensatz
• Straight-line programs in geometric elimination theory
• Proof mining and effective bounds in differential polynomial rings
• Bounds of traces in complete intersections and degrees in the Nullstellensatz
• A generalized combinatorial nullstellensatz for multisets
• A bound for orders in differential Nullstellensatz
• A footnote to a result of Sturmfels-Trung-Vogel on the effective Nullstellensatz
• Inequalities for Hilbert functions and primary decompositions
• Random arithmetic formulas can be reconstructed efficiently
• Combinatorial nullstellensatz modulo prime powers and the parity argument
• A generalization of combinatorial Nullstellensatz
• Erratum. Punctured combinatorial Nullstellensätze
• Variety evasive subspace families
• New effective differential Nullstellensatz

This page was built for publication: A combinatorial proof of the effective Nullstellensatz

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368067)