Computing restrictions of ideals in finitely generated k-algebras by means of Buchberger's algorithm

Authors:
Thomas Beth;Jörn Müller-Quade;Rainer Steinwandt
Affiliations:
Institut für Algorithmen und Kognitive Systeme, Fakultät für Informatik, Am Fasanengarten 5, Universität Karlsruhe, 76128 Karlsruhe, Germany;Institut für Algorithmen und Kognitive Systeme, Fakultät für Informatik, Am Fasanengarten 5, Universität Karlsruhe, 76128 Karlsruhe, Germany;Institut für Algorithmen und Kognitive Systeme, Fakultät für Informatik, Am Fasanengarten 5, Universität Karlsruhe, 76128 Karlsruhe, Germany
Venue:
Journal of Symbolic Computation
Year:
2006

Citing 9
Cited 0

Gröbner bases and primary decomposition of polynomial ideals

Journal of Symbolic Computation
A completion procedure for computing canonical basis for a k-Subalgebra

Proceedings of the third conference on Computers and mathematics
Gro¨bner bases: a computational approach to commutative algebra

Gro¨bner bases: a computational approach to commutative algebra
The MAGMA algebra system I: the user language

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Deciding linear disjointness of finitely generated fields

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Basic algorithms for rational function fields

Journal of Symbolic Computation
Gröbner bases applied to finitely generated field extensions

Journal of Symbolic Computation - Special issue on applications of the Gröbner basis method
Computing the Intersection of finitely generated fields

ACM SIGSAM Bulletin
Using Groebner Bases to Determine the Algebraic and Transcendental Nature of Field Extensions: Return of the Killer Tag Variables

AAECC-10 Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Quantified Score

Hi-index	0.00

Visualization

Abstract

Grobner bases can be used to solve various algorithmic problems in the context of finitely generated field extensions. One key idea is the computation of a certain kind of restriction of an ideal to a subring. With this restricted ideal many problems concerning function fields reduce to ideal theoretic problems which can be solved by means of Buchberger's algorithm. In this contribution this approach is generalized to allow the computation of the restriction of an arbitrary ideal to a subring.