arXiv (All)
open access
Automorphisms and canonical forms of integer lattices
We improve the Plesken--Souvignier algorithm for computing automorphism groups and isometries of positive definite integer quadratic lattices by exploiting characteristic sublattices and refining vector enumeration. For lattices with roots, we also use the Weyl group to accelerate the computation of
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The algebraic lattice isomorphism problem#1367011
- Adelic framed form class groups and explicit class field theory#924122
- Adelic framed form class groups and explicit class field theory#919893
- Remarks on Lattice Actions Corresponding to Automorphism Groups of Smooth Cubic Fourfolds#1344984
- Real quadratic basis changes for GL(3) and integer relations of automorphic periods#643147
Record · ID 1341638
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive