Computational ideal theory in finitely generated extension rings

DOI10.1016/S0304-3975(00)00172-9zbMath0945.68197MaRDI QIDQ1575702

Joachim Apel

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Gröbner bases

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

68W05: Nonnumerical algorithms

13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)

Related Items

Differential algebra for derivations with nontrivial commutation rules, Letterplace ideals and non-commutative Gröbner bases., Looking for Gröbner basis theory for (almost) skew 2-nomial algebras., Degree bounds for Gröbner bases in algebras of solvable type, Non-associative Gröbner bases

Uses Software

• Felix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-commutative Gröbner bases in algebras of solvable type
• On the construction of Gröbner bases using syzygies
• On the theory of graded structures
• New constructive methods in classical ideal theory
• A generalization of reduction rings
• An extension of Buchberger's algorithm and calculations in enveloping fields of Lie algebras
• Über B. Buchbergers Verfahren, Systeme algebraischer Gleichungen zu lösen
• An algorithm for constructing Gröbner and free Schreier bases in free group algebras
• A generalization of Gröbner basis algorithms to polycyclic group rings
• Resolution of singularities of an algebraic variety over a field of characteristic zero. I