All Questions
2 questions
4
votes
1
answer
199
views
Computing spinor equivalence for positive definite forms
Given an integral positive-definite rank $n$ quadratic form $f$, one can use the algorithm in Conway and Sloane (Chapter 15, SPLaG) to efficiently determine if the genus of $f$ contains more than one ...
- 323
0
votes
1
answer
123
views
Lower bounds on the rank of a unimodular lattice, given the binlinear pairing of a subset of basis vectors
I have some questions on lower bounds on the rank of unimodular lattices given the bilinear pairing of a subset of its basis is known.
Let $\Lambda$ be an odd, unimodular matrix of signature $(1,T)$. ...
- 424