2000 character limit reached
Finite quadratic modules and lattices
Published 13 Oct 2021 in math.NT | (2110.06783v1)
Abstract: We give a new proof of the fact that any finite quadratic module can be decomposed into indecomposable ones. For any indecomposable finite quadratic module, we construct a lattice, and a positive definite lattice, both of which are of the least rank, whose discriminant module is the given one. The resulting lattices are given by their Gram matrices explicitly.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.