• About
  • Members
  • Seminar
  • Visitors
  • Publications
  • Conferences
  • Magma
  • Login
Computational Algebra Group
Computational Algebra Seminar
  • 2000-2004
  • 2005-2009
  • 2010-2014
  • 2015
  • 2016
  • 2017
  • 2018
  • 2024
  • 2025
  • Jens Bauch
  • Montes Algorithm In Function Fields
  • 4pm–5pm, Thursday 26th April, 2018
  • Carslaw 535A
  • Let A = k[t] be the polynomial ring over the perfect field k and f∈A[x] be a monic irreducible separable polynomial. Denote by F/k the function field determined by f and consider a given non-zero prime ideal \mathfrak{p} of A. The Montes algorithm determines a new representation, so called OM-representation, of the prime ideals of the (finite) maximal order of F lying over \mathfrak{p}. This yields a new representation of places of function fields. In this talk we summarize briefly some applications of this new representation; that are the computation of the genus, the computation of the maximal order, and the improvement of the computation of Riemann-Roch spaces.

The Computational Algebra Group is a research group within the School of Mathematics and Statistics, University of Sydney.
Copyright © 2010-2025 Computational Algebra Group.