Gröbner bases applied to finitely generated field extensions

DOI10.1006/JSCO.1999.0417zbMATH Open0997.12005OpenAlexW2029267855MaRDI QIDQ1588034FDOQ1588034

Authors: Joern Mueller-Quade, Rainer Steinwandt 

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

Recommendations

• Basic algorithms for rational function fields
• scientific article; zbMATH DE number 503186
• On computing a separating transcendence basis
• Computing restrictions of ideals in finitely generated \(k\)-algebras by means of Buchberger's algorithm
• Computing primitive elements of extension fields

zbMATH Keywords

transcendence degreealgorithms for field extensionsGröbner bases

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Transcendental field extensions (12F20)

Cites Work

• The Magma algebra system. I: The user language
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Gröbner bases and primary decomposition of polynomial ideals
• Title not available (Why is that?)
• An implicitization algorithm with fewer variables
• Converting bases with the Gröbner walk
• Initial complexes of prime ideals
• Title not available (Why is that?)
• Computing dimension and independent sets for polynomial ideals
• Basic algorithms for rational function fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algebra

Cited In (10)

• Grobner bases and extension of scalars
• Enhancing the Extended Hensel Construction by Using Gröbner Bases
• Gröbner bases over fields with valuations
• Every finitely generated regular field extension has a stable transcendence base
• Recognizing simple subextensions of purely transcendental field extensions
• Symmetric functions and the phase problem in crystallography
• Realization theory for rational systems: minimal rational realizations
• Computing restrictions of ideals in finitely generated \(k\)-algebras by means of Buchberger's algorithm
• Computation of unirational fields
• Enhancing the extended hensel construction by using Gröbner basis

Uses Software

• Magma

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

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