Classification of positive definite lattices
| dc.creator | Borcherds, R. E. | |
| dc.date | 1999-12-30 | |
| dc.date.accessioned | 2026-07-07T05:32:34Z | |
| dc.date.available | 2026-07-07T05:32:34Z | |
| dc.description | In this paper we describe an algorithm for classifying orbits of vectors in Lorentzian lattices. The main point of this is that isomorphism classes of positive definite lattices in some genus often correspond to orbits of vectors in some Lorentzian lattice, so we can classify some positive definite lattices. As an application we give the classification of the 665 25-dimensional unimodular positive definite lattices and the 121 even 25 dimensional positive definite lattices of determinant 2. We also use this algorithm to show that there is a unique 26 dimensional unimodular positive definite lattice with no roots. | |
| dc.description | 35 pages, plain TeX | |
| dc.identifier | https://arxiv.org/abs/math/9912236 | |
| dc.identifier | http://arxiv.org/abs/math/9912236 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/79700 | |
| dc.subject | Number Theory | |
| dc.subject | Group Theory | |
| dc.title | Classification of positive definite lattices | |
| dc.type | text |