Back to Search
Start Over
Computation of unirational fields
- Source :
-
Journal of Symbolic Computation . Nov2006, Vol. 41 Issue 11, p1222-1244. 23p. - Publication Year :
- 2006
-
Abstract
- Abstract: One of the main contributions which Volker Weispfenning made to mathematics is related to Gröbner bases theory. In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational field extension (which in particular includes the zero characteristic case). One of the main tools is Gröbner bases theory. Our algorithm also requires computing primitive elements and factoring over algebraic extensions. Moreover, the method can be extended to finitely generated -algebras. [Copyright &y& Elsevier]
- Subjects :
- *ALGORITHMS
*MATHEMATICS
*MATHEMATICAL programming
*ALGEBRA
Subjects
Details
- Language :
- English
- ISSN :
- 07477171
- Volume :
- 41
- Issue :
- 11
- Database :
- Academic Search Index
- Journal :
- Journal of Symbolic Computation
- Publication Type :
- Academic Journal
- Accession number :
- 22737200
- Full Text :
- https://doi.org/10.1016/j.jsc.2005.05.009