Ideal membership in polynomial rings over the integers
From MaRDI portal
Publication:4461098
DOI10.1090/S0894-0347-04-00451-5zbMath1099.13045arXivmath/0305172MaRDI QIDQ4461098
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
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
11C08: Polynomials in number theory
Related Items
Effective Results for Discriminant Equations over Finitely Generated Integral Domains, Effective results for unit equations over finitely generated integral domains, Model theory of proalgebraic groups, Nullstellensatz via Nonstandard Methods, Effective results for unit points on curves over finitely generated domains, Height bounds, nullstellensatz and primality, Reduction Mod p of Standard Bases, Random arithmetic formulas can be reconstructed efficiently, Explicit polynomial bounds on prime ideals in polynomial rings over fields, Dynamical Gröbner bases, Bounds in polynomial rings over Artinian local rings, Effective results for division points on curves in \(\mathbb{G}_m^2\), Easy intruder deduction problems with homomorphisms, Mixed characteristic homological theorems in low degrees., Difference indices of quasi-prime difference algebraic systems, Proof mining and effective bounds in differential polynomial rings, A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x\)], Finitely generated structures computable in polynomial time, Polynomially computable structures with finitely many generators, Uniform first-order definitions in finitely generated fields, Lefschetz extensions, tight closure and big Cohen-Macaulay algebras, Turing meets Schanuel, Automorphisms mapping a point into a subvariety, Infinite finitely generated fields are biinterpretable with ℕ
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item