Gröbner bases applied to finitely generated field extensions

DOI10.1006/jsco.1999.0417zbMath0997.12005OpenAlexW2029267855MaRDI QIDQ1588034

Rainer Steinwandt, Jörn Müller-Quade

Publication date: 11 November 2002

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

Full work available at URL: https://semanticscholar.org/paper/00dcf1f2507db792e1cf207cc03e5aab1fb8adf3

zbMATH Keywords

Gröbner basestranscendence degreealgorithms for field extensions

Mathematics Subject Classification ID

Related Items (3)

Computing restrictions of ideals in finitely generated \(k\)-algebras by means of Buchberger's algorithm ⋮ Symmetric functions and the phase problem in crystallography ⋮ Realization theory for rational systems: minimal rational realizations

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An implicitization algorithm with fewer variables
• Computing dimension and independent sets for polynomial ideals
• Gröbner bases and primary decomposition of polynomial ideals
• Basic algorithms for rational function fields
• The Magma algebra system. I: The user language
• Converting bases with the Gröbner walk
• Initial complexes of prime ideals
• Algebra

This page was built for publication: Gröbner bases applied to finitely generated field extensions