An algorithm for computing isomorphisms of algebraic function fields

DOI10.1007/978-3-540-24847-7_19MaRDI QIDQ5465626zbMATH OpenOpenAlexFDO

Authors Florian Hess

Publication date 12 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98210

Mathematics Subject Classification ID

Arithmetic theory of algebraic function fields (11R58) Algebraic number theory computations (11Y40)

Cited in

(9)

• Projective and affine symmetries and equivalences of rational and polynomial surfaces
• Computing splitting fields using Galois theory and other Galois constructions
• Equivalence of differential equations of order one
• Tschirnhaus-Weierstrass curves
• Maps between curves and arithmetic obstructions
• Computing isomorphisms and embeddings of finite fields
• Numerical computation of endomorphism rings of Jacobians
• Universal-existential theories of fields
• On automorphism groups of cyclotomic function fields over finite fields

This page was built for publication: An algorithm for computing isomorphisms of algebraic function fields

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