Computation of unirational fields
| dc.creator | Gutierrez, Jaime | |
| dc.creator | Sevilla, David | |
| dc.date | 2008-04-10 | |
| dc.date.accessioned | 2026-07-07T09:38:43Z | |
| dc.date.available | 2026-07-07T09:38:43Z | |
| dc.description | One of the main contributions which Volker Weispfenning made to mathematics is related to Groebner 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 Groebner bases theory. Our algorithm also requires computing primitive elements and factoring over algebraic extensions. Moreover, the method can be extended to finitely generated K-algebras. | |
| dc.description | 28 pages | |
| dc.identifier | https://arxiv.org/abs/0804.1679 | |
| dc.identifier | http://arxiv.org/abs/0804.1679 | |
| dc.identifier | Computation of unirational fields. J. Symbolic Comput. 41 (2006), no. 11, 1222--1244. MR2267134 (2007g:12003) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/160912 | |
| dc.subject | Symbolic Computation | |
| dc.subject | Commutative Algebra | |
| dc.subject | I.1.1; I.1.2 | |
| dc.title | Computation of unirational fields | |
| dc.type | text |