2013
DOI: 10.1090/conm/587/11697
|View full text |Cite
|
Sign up to set email alerts
|

Algorithms for computing maximal lattices in bilinear (and quadratic) spaces over number fields

Abstract: In this paper we describe an algorithm that quickly computes a maximal a-valued lattice in an F -vector space equipped with a non-degenerate bilinear form, where a is a fractional ideal in a number field F . We then apply this construction to give an algorithm to compute an a-maximal lattice in a quadratic space over any number field F where the prime p = 2 is unramified. We also develop the theory of p-neighbors for a-valued quadratic lattices at an arbitrary prime p of O F (including when p | 2) and prove it… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 31 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?