Ideal membership in polynomial rings over the integers

DOI10.1090/S0894-0347-04-00451-5zbMath1099.13045arXivmath/0305172OpenAlexW1859180425MaRDI QIDQ4461098

Matthias Aschenbrenner

Publication date: 29 March 2004

Published in: Journal of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0305172

zbMATH Keywords

boundsideal membership over integers

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Polynomials in number theory (11C08)

Related Items (24)

Nullstellensatz via Nonstandard Methods ⋮ Uniform first-order definitions in finitely generated fields ⋮ Automorphisms mapping a point into a subvariety ⋮ Turing meets Schanuel ⋮ Dynamical Gröbner bases ⋮ Effective Results for Discriminant Equations over Finitely Generated Integral Domains ⋮ Bounds in polynomial rings over Artinian local rings ⋮ Effective results for division points on curves in \(\mathbb{G}_m^2\) ⋮ Difference indices of quasi-prime difference algebraic systems ⋮ Effective results for unit points on curves over finitely generated domains ⋮ Mixed characteristic homological theorems in low degrees. ⋮ Proof mining and effective bounds in differential polynomial rings ⋮ Height bounds, nullstellensatz and primality ⋮ Polynomially computable structures with finitely many generators ⋮ A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x\)] ⋮ Random arithmetic formulas can be reconstructed efficiently ⋮ Effective results for unit equations over finitely generated integral domains ⋮ Lefschetz extensions, tight closure and big Cohen-Macaulay algebras ⋮ Infinite finitely generated fields are biinterpretable with ℕ ⋮ Model theory of proalgebraic groups ⋮ Reduction Mod p of Standard Bases ⋮ Easy intruder deduction problems with homomorphisms ⋮ Explicit polynomial bounds on prime ideals in polynomial rings over fields ⋮ Finitely generated structures computable in polynomial time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial bounds in polynomial rings over fields
• Bounds for the degrees in the division problem
• On constructing bases for ideals in polynomial rings over the integers
• Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
• Gröbner bases and primary decomposition of polynomial ideals
• The membership problem for unmixed polynomial ideals is solvable in single exponential time
• Commutative coherent rings
• A sparse effective Nullstellensatz
• A solution to Kronecker's problem
• Bases of number fields with small height
• The complexity of the word problems for commutative semigroups and polynomial ideals
• Sharp estimates for the arithmetic Nullstellensatz
• The solution of a decision problem for several classes of rings
• Bounds and definability in polynomial rings
• Dénominateurs dans le théorème des zéros de Hilbert
• Small Solutions to Inhomogeneous Linear Equations Over Number Fields
• Rekursive Algebren mit Kettenbedingungen
• What is Noetherian?
• Constructions in Algebra
• Length of Polynomial Ascending Chains and Primitive Recursiveness.
• Sharp Effective Nullstellensatz
• Some Connections between Residual Finiteness, Finite Embeddability and the Word Problem
• A classification of the ordinal recursive functions
• Constructive Aspects of Noetherian Rings

This page was built for publication: Ideal membership in polynomial rings over the integers