Nearly unimodular quadratic forms
A \(\mathbb Z\)-lattice \(L\) is called nearly unimodular if it has a Gram matrix of the form \[ \left( \begin{smallmatrix} a_1 &1 \\ 1 &a_2 & \ddots\\ & \ddots &\ddots \\ &&&a_{n-1} &1\\ &&&1 &a_n \end{smallmatrix} \right)=: [a_1, \dots, a_n ]=: A \] (then we denote \(L\cong A)\). The main result is the following classification theorem: Let \(A= [a_1, \dots, a_n ]\) and \(B= [b_1, \dots, b_n ]\). Suppose \(L\) and \(M\) are positive definite nearly unimodular \(\mathbb Z\)-lattices with \(L\cong A\) and \(M\cong B\). Then \(L\) is isometric to \(M\) if and only if \(B= A\) or \(B= [a_n, \dots, a_1]\).
- Even unimodular 12-dimensional quadratic forms over \({\mathbb{Q}}(\sqrt{5})\)
- On the classification of unimodular quadratic forms
- Definite quadratic forms over \({\mathbb F}_q[x]\)
- The lens space realization problem
- Ribbon cobordisms between lens spaces
- Unimodular embeddings
- scientific article; zbMATH DE number 4101296 (Why is no real title available?)
- Normal Forms for Definite Integer Unimodular Quadratic Forms
- Characteristic Elements of Unimodular -lattices
- A note on unimodular lattices with trivial automorphism groups
- Embedding theory of lattices and its application for $2$-integrable lattices
- The critical polynomial of a graph
This page was built for publication: Nearly unimodular quadratic forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1906007)
