Genus computation of global function fields

DOI10.1016/J.JSC.2014.03.001MaRDI QIDQ2252117zbMATH OpenOpenAlexFDO

Authors Jens-Dietrich Bauch

Publication date 16 July 2014

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

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

zbMATH Keywords

Montes algorithmgenus computationRiemann-Roch function field

Mathematics Subject Classification ID

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

Abstract: In this paper we present an algorithm that computes the genus of a global function field. Let F/k be function field over a field k, and let k0 be the full constant field of F/k. By using lattices over subrings of F, we can express the genus g of F in terms of [k0 : k] and the indices of certain orders of the finite and infinite maximal orders of F . If k is a finite field, the Montes algorithm computes the latter indices as a by-product. This leads us to a fast computation of the genus of global function fields. Our algorithm does not require the computation of any basis, neither of finite nor infinite maximal order.

Recommendations

• Publication:4509883
• The genus field of an algebraic function field
• Genus fields of global fields
• Genus and gaps in function fields
• Computing generators of the tame kernel of a global function field

Cites work

• scientific article; zbMATH DE number 3657898 (Why is no real title available?)
• scientific article; zbMATH DE number 1936673 (Why is no real title available?)
• scientific article; zbMATH DE number 945267 (Why is no real title available?)
• Complexity of OM factorizations of polynomials over local fields
• Computing Riemann-Roch spaces in algebraic function fields and related topics.
• Construction and estimation of bases in function fields
• Factoring multivariate polynomials over finite fields
• Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
• Newton polygons of higher order in algebraic number theory
• On lattice reduction for polynomial matrices
• Single-factor lifting and factorization of polynomials over local fields
• The Magma algebra system. I: The user language

Cited in

(7)

• scientific article; zbMATH DE number 6315754 (Why is no real title available?)
• Genus fields of global fields
• A Symbolic-Numeric Algorithm for Genus Computation
• Computing generators of the tame kernel of a global function field
• Solving norm equations in global function fields
• A practical algorithm for the computation of the genus
• A note on the genus of global function fields

Describes a project that uses

Uses Software

• Magma

This page was built for publication: Genus computation of global function fields

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