Computation of unirational fields

DOI10.1016/j.jsc.2005.05.009zbMath1149.12001arXiv0804.1679OpenAlexW2165225265MaRDI QIDQ2457397

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

Gröbner basiscomputational Galois theoryLüroth's theorempolynomial and rational function decompositionUnirational fields

Mathematics Subject Classification ID

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

Related Items

Decomposition of ordinary differential polynomials ⋮ Indecomposability of polynomials via Jacobian matrix ⋮ An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On multivariate rational function decomposition
• Computing primitive elements of extension fields
• Solvability by radicals is in polynomial time
• Factoring polynomials with rational coefficients
• Basic algorithms for rational function fields
• On computing subfields
• A note on a theorem of Fried and MacRae
• A rational function decomposition algorithm by near-separated polynomials
• Ideal decompositions and subfields
• Effective computation of the integral closure of a morphism
• Unirational fields of transcendence degree one and functional decomposition
• Factoring Polynomials over Algebraic Number Fields
• Construction of the Integral Closure of a Finite Integral Domain. II
• On computing a separating transcendence basis
• Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman