کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
402012 676790 2006 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Computing restrictions of ideals in finitely generated k-algebras by means of Buchberger’s algorithm
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
Computing restrictions of ideals in finitely generated k-algebras by means of Buchberger’s algorithm
چکیده انگلیسی

Gröbner 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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Symbolic Computation - Volume 41, Issues 3–4, March–April 2006, Pages 372-380