Lattices over Polynomial Rings and Applications to Function Fields
Abstract
This paper deals with lattices (L,~) over polynomial rings, where L is a finitely generated module over k[t], the polynomial ring over the field k in the indeterminate t, and ~ is a discrete real-valued length function on Lk[t]k(t). A reduced basis of (L,~) is a basis of L whose vectors attain the successive minima of (L,~). We develop an algorithm which transforms any basis of L into a reduced basis of (L,~). By identifying a divisor D of an algebraic function field with a lattice (L,~) over a polynomial ring, this reduction algorithm can be addressed to the computation of the Riemann-Roch space of D and the successive minima of (L,~), without the use of any series expansion.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.