Computation of unirational fields

DOI10.1016/J.JSC.2005.05.009MaRDI QIDQ2457397zbMATH OpenOpenAlexFDO

Authors David Sevilla, Jaime Gutierrez

Publication date 23 October 2007

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0804.1679

zbMATH Keywords

computational Galois theoryGröbner basisLüroth's theorempolynomial and rational function decompositionUnirational fields

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to field theory (12-04) Algebraic field extensions (12F05)

Abstract: 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.

Recommendations

• Basic algorithms for rational function fields
• scientific article; zbMATH DE number 1163437
• Gröbner bases applied to finitely generated field extensions
• On multivariate rational function decomposition
• Using Gröbner bases for factoring polynomials over algebraic extension fields

Cites work

• A note on a theorem of Fried and MacRae
• A rational function decomposition algorithm by near-separated polynomials
• Basic algorithms for rational function fields
• Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
• Computing primitive elements of extension fields
• Construction of the Integral Closure of a Finite Integral Domain. II
• Effective computation of the integral closure of a morphism
• Factoring Polynomials over Algebraic Number Fields
• Factoring polynomials with rational coefficients
• scientific article; zbMATH DE number 1588462 (Why is no real title available?)
• scientific article; zbMATH DE number 421665 (Why is no real title available?)
• scientific article; zbMATH DE number 437289 (Why is no real title available?)
• scientific article; zbMATH DE number 3920595 (Why is no real title available?)
• scientific article; zbMATH DE number 3765914 (Why is no real title available?)
• scientific article; zbMATH DE number 3785004 (Why is no real title available?)
• scientific article; zbMATH DE number 3563286 (Why is no real title available?)
• scientific article; zbMATH DE number 1253986 (Why is no real title available?)
• scientific article; zbMATH DE number 1273634 (Why is no real title available?)
• scientific article; zbMATH DE number 481965 (Why is no real title available?)
• scientific article; zbMATH DE number 503186 (Why is no real title available?)
• scientific article; zbMATH DE number 217454 (Why is no real title available?)
• scientific article; zbMATH DE number 3223737 (Why is no real title available?)
• scientific article; zbMATH DE number 3279238 (Why is no real title available?)
• scientific article; zbMATH DE number 3050844 (Why is no real title available?)
• scientific article; zbMATH DE number 3108009 (Why is no real title available?)
• Ideal decompositions and subfields
• Modern computer algebra
• On computing a separating transcendence basis
• On computing subfields
• On multivariate rational function decomposition
• Solvability by radicals is in polynomial time
• Unirational fields of transcendence degree one and functional decomposition

Cited in

(6)

• Computing Beltrami Fields
• scientific article; zbMATH DE number 1303539 (Why is no real title available?)
• Computing the reciprocal of units in Galois rings
• An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography
• Decomposition of ordinary differential polynomials
• Indecomposability of polynomials via Jacobian matrix

This page was built for publication: Computation of unirational fields

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