1. Introduction
Lattice theory, as a foundational branch of modern mathematics, serves as a crucial tool for the study of discrete structures, with far-reaching applications in many branches of mathematics. Among its subfields, integral lattices hold special significance as they play key roles in finite groups [1,2], optimizing algorithms [3], and constructing error-correcting codes [4,5]. In addition, such lattices serve to encode solutions for intricate Diophantine equations [6] and contribute to the optimization of communication network designs [7], thereby emphasizing their cross-disciplinary importance. Consequently, the classification of positive definite lattices based on rank and determinant has developed into a central research problem, which carries both theoretical worth and practical relevance.
In the realm of lattice classification, a large portion of existing research has centered on unimodular lattices. Specifically, multiple studies have delved into even unimodular lattices (see [8,9,10]). In [11], Mordell completed the classification of all positive definite unimodular lattices of rank 8, where his proof drew on "two deep theorems" in quadratic forms. Subsequently, R.L. Griess Jr. adopted solely elementary methods to reclassify these lattices in [12]. Later, in his monograph [13], he further extended this work: he classified positive definite lattices with a determinant of 2 and a rank at most of 7, those with a determinant of 3 and a rank at most of 6, and those with a determinant of 4 and a rank at most of 4. Beyond this, Wang Ruiqing investigated additively indecomposable positive definite integral lattices in [14]. Additionally, R.E. Borcherds conducted research on positive definite lattices in [15]: he classified 665 positive definite unimodular lattices in 25 dimensions and identified 121 even lattices with a determinant of 2. More recently, Libo Zhao et al. presented the classification of positive definite lattices of determinant 4 and rank 5 in [16]. Nevertheless, despite these progressions, the classification of lattices with moderate ranks and small determinants (>1) remains incomplete.
Determinant 5, as a small prime, imposes strict arithmetic constraints (e.g., on the discriminant group, vector norms, and duality relations), making it ideal for exploring the interplay between a lattice’s arithmetic and geometric properties. Existing studies on lattices with small prime determinants (e.g., 2, 3) lay a foundation, and extending this to determinant 5 helps build a comprehensive understanding of prime-determinant lattices. Rank 6 is a critical dimension in low-dimensional positive definite lattice research. It balances “simplicity” (facilitating explicit classification) and “non-triviality” (exhibiting structural properties that connect to broader fields like arithmetic geometry and group theory). So lattices of determinant 5 and rank 6 occupy a particularly significant gap.
In this paper, we aim to classify positive definite lattices of determinant 5 and a rank ≤6.
The terminology and the notation in this paper are standard, which can be referred to in [13].
2. Preliminaries
In this section, we give some notations and lemmas, which are useful for the later use and could be found in [13].
A lattice is termed rectangular when it possesses an orthogonal basis. The dual of a lattice M is denoted as .
The determinant of a lattice is defined to be , where G denotes an arbitrary Gram matrix. In particular, a Gram matrix is a square matrix of order (the rank of lattice M), whose entries are given by here, and denotes any basis of the lattice.
Now, suppose that M is an integral lattice, meaning that is an integer for all . We say that M is even if is an even integer for each ; if M fails to meet this condition, it is called an odd lattice.
The discriminant group of M, denoted as , is defined as .
A lattice M is called unimodular when or . For , the order of the discriminant group (denoted as ) equals the absolute value of the lattice’s determinant, that is, .
A positive definite lattice is a free -module with a positive definite inner product .
And we use to denote the integer lattice generated by vector v. For (where n is the dimension of the ambient Euclidean space), consists of all integer scalar multiples of v, forming a one-dimensional sublattice.
([13] pp. 33, 34) Let and . for all , where denotes the bilinear form on L.
Further,
;
;
The lattice is the annihilator in of any sublattice;
The lattice is the annihilator in of any sublattice.
([13] p. 17, Theorem 2.3.3) Suppose that L is a lattice, and M is a sublattice of L of index . Then,
([13] p. 55, Theorem 5.2.1) Suppose that L is a positive definite lattice of determinant 1 and a rank no more than 8. Then, or .
([13] p. 55, Theorem 5.2.2) Suppose that L is a positive definite integral lattice of determinant 2 and rank 7. Then, L is rectangular or .
([13] p. 56, Theorem 5.2.3) Suppose that L is a positive definite integral lattice of determinant 3 and rank 6. Then, L is rectangular, or , or .
([13] p. 18, Theorem 2.4.1) Suppose that L is a nonsingular integral lattice and M is a sublattice which is a direct summand of L. Then,
(1) The natural map is onto.
(2) Define π to be the composition of the quotient map and ψ, then we have and .
(3) is surjective if and are relatively prime.
([13] pp.49, Theorem 5.0.3) Let and . If L is a rational lattice of rank n, then .
3. Main Results
This section focuses on providing the classification of lattices that have a determinant of 5 and a rank of 6. Since rank 1 lattices are straightforward, we initiate our analysis with the rank 2 scenario.
Let X be a positive definite lattice with determinant 5 and rank 2. Then X is rectangular or isometric to , where .
If there exists an unit vector in X, then, by using Lemma 5, the map is onto. And so . Thus X is rectangular.
When there exists no unit vector in X, then, using Lemma 6, we see that X has a root vector u since . The natural map is onto since . Thus, and then has a determinant of 10 by Lemma 1. A nontrivial coset of contains , where . For the norm of to be an integer and , we see and . Then . So , which is lattice in the theorem. □
Let X be a positive definite lattice with determinant 5 and rank 3. Then X is rectangular or isometric to .
If there exists an unit vector in X, then because the map is onto. So X is rectangular or by Theorem 1.
When there exists no unit vector in X, since , X contains a root, say u. By considering , we see that . Since , has a vector v of norm 2 or 3. Define and .
P is a direct summand of X. If not, P is contained in some direct summand and . Then . This implies that contains a unit vector, which is a contradiction.
Suppose that . Also . Then . A nontrivial coset of contains an element with the form , where . Since the norm of must be an integer and , we see and . Then . This is incompatible with . Thus, .
We see that . Then . A nontrivial coset of contains an element g with form , where . For the norm of to be an integer and greater than 1, we see and . Then . This is incompatible with . □
Let X be a positive definite lattice with determinant 5 and rank 4. Then X is rectangular or isometric to or .
If there exists an unit vector in X, then because the map is onto. Then X is rectangular or by Theorem 2.
When there exists no unit vector in X, since and , X contains two orthogonal roots . Let . The natural map is onto by . Then, is of determinant 20 and the image of X in is . So . Then for any vector and . Thus . Let . . So K is rectangular or isometric to by Theorem 1.
Suppose that K is rectangular. Then with .
A nontrivial coset of contains an element g of the form , where . For the norm of to be an integer and greater than 1, we see and . Then . Let .
is an abelian group of order 4 and exponent 2. Assume that , , where . Then is nontrivial in and contains the element , where and So and . Then is also in A. But the sum of any two elements is not in A, which is a contradiction.
So K is isometric to and with A nontrivial coset of has an element g with the form , where . For the norm of to be an integer and greater than 1, we see and . Then . So X is isometric to or . Then is isometric to by the isometry . So . The proof is complete. □
Let X be a positive definite lattice with determinant 5 and rank 5. Then X is rectangular or isometric to or .
If there exists a unit vector in X, then bacause the natural map is onto. Then X is rectangular or isometric to or by Theorem 3.
When there exists no unit vector in X, since , , and , X contains three orthogonal vectors, , with norms or , respectively. Define , . We claim that P is a direct summand of X. In fact, if (where is a direct summand) then . Then or 3. Then is rectangular or and so has a unit vector by Lemma 4 and Lemma 3, which is a contradiction.
The map is onto by . Thus, the image of X in is or . And Q has a rank of 2, so we see , and .
Then Q has a determinant of 60. And the Sylow 2-subgroup of has an exponent of 2. So , where K has a rank of 2 and a determinant of 15. Since and , we see or 4.
If , let with norm 2. Then we claim that . In fact, the map is onto. Then , is with determinant 30. The nontrivial coset has an element with the form , where and . Furthermore, we may arrange for , where . Since the norm of must be an integer and , we see and . Then . So K is isometric to .
If , let be of norm 3. Then we claim that . In fact, by noting the map , we see or 3. If , then . If , then is with determinant 45. A nontrivial coset of has an element with form , where , and . Furthermore we may arrange for , where . Since the norm of must be an integer and , we see and . Then . So K is isometric to .
If , let with norm 4. Then we claim that . In fact, because the natural map is onto, we see . Then is with determinant 60. A nontrivial coset of has an element with form , where and . Furthermore we may arrange for , where . Since the norm of must be an integer and , we see and . Then or . So K is isometric to .
So , or .
Case 1.
A nontrivial coset of has an element g with form , where and . Furthermore we may arrange for , where . Since the norm of must be an integer and , and .
Assume that is an abelian subgroup of order 6 of . Then for any , is also a nontrivial coset of and contains an element , where and So and .
Then
.
Furthermore, if is of order 2, then .
Therefore the abelian 2-group with type is or
If is of order 3 in , then }. Thus the group of order 3 is
or
So ,
,
.
By calculation, we find unit vectors , , and , which are contradictions.
Case 2.
A nontrivial coset of has an element g with form , where and . Furthermore we may arrange for , where . Since the norm of must be an integer and , we see that and .
Assume that is an abelian subgroup of order 6 of . Then for each , is a nontrivial coset of and has an element , where and So and .
Then
}.
Since , we see . Then
}.
Furthermore, if is of order 2 in , then . Thus there exists no abelian 2-group with type , which is a contradiction.
Case 3.
A nontrivial coset of has an element g with form , where and . Thus we may arrange for , where . Since the norm of must be an integer and >1, and .
Assume that is an abelian subgroup of order 6. For each , is a nontrivial coset in and contains , where and So and . Thus or , which contradicts to . The proof is complete. □
Let X be a positive definite lattice with determinant 5 and rank 6. Then X is rectangular or isometric to or .
If there exists a unit vector in X, then because the natural map is onto. Then X is rectangular, or by induction and Theorem 4.
In the following, we try to prove that X contains a unit vector.
Let so that generates . Then (or else the is an integer while ), where k is an integer.
When , we define a new lattice . Then has norm . Set . We see that and so P is a unimodular integral lattice by Lemma 1. Thus by using Lemma 2, so we identify P in . Then for some vector y of norm 5. Then the only possibilities for are , up to monomial transformations. Therefore, X contains a unit vector.
When , we define a new lattice M whose basis gives the Gram matrix . Then whose norm is . Thus is a unimodular integral lattice. Thus or . Since is an even lattice and there is a vector with norm 3 in P, we see . So we identify P with . Then where . The only possibility for such is up to monomial transformations. And is up to monomial transformations. Since , X contains a unit vector.
The remaining cases and are similar to cases and , respectively. □
4. Conclusions
We have classified positive definite integral lattices characterized by determinant 5 and rank in this paper. The main result (Theorem 5) states that such a lattice X must be isometric to one of the following three types:
Rectangular lattices: Lattices with an orthogonal basis, i.e., their Gram matrices are diagonal.
: Here is the rank-2 lattice defined by the Gram matrix (as in Theorem 3.1).
: This is where is the root lattice of rank 4 (Definition 1).
The proof relies on an inductive analysis of lower-rank cases (Theorems 1–4) and a key reduction showing that X must contain a unit vector (otherwise, embedding X into a unimodular lattice leads to a contradiction). This classification bridges a gap in the literature and provides a complete solution for lattices of moderate rank with a small determinant.
5. Future Work and Open Problems
Extend to Higher Ranks: Classify positive definite lattices with determinant 5 and rank . Do structural patterns (e.g., the number of isomorphism classes, automorphism group properties) from rank 6 generalize?
Extend to Higher Determinants: Classify positive definite lattices of rank 6 with larger determinants (e.g., ). Applications in coding theory and Diophantine equations may be explored further.
Applications: Applications in coding theory and Diophantine equations may be explored further.
Software, L.G. and H.G.; Data curation, Y.L.; Writing—original draft, L.Z.; Writing—review & editing, L.Z. All authors have read and agreed to the published version of the manuscript.
Data are contained within the article.
The authors are grateful to R.L. Griess Jr. from the University of Michigan for his guidance and useful comments that have aided in the development of this paper.
The authors declare no conflicts of interest.
Footnotes
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
1. Zhao, L.; Li, Y.; Gong, L.; Guo, X. Finite p-groups in which the normalizer of each nonnormal subgroup is small. Hacet. J. Math. Stat.; 2024; 53, pp. 1642-1646. [DOI: https://dx.doi.org/10.15672/hujms.1362734]
2. Zhao, L.; Gong, L.; Guo, X. Finite p-groups with a trivial core or the normal closure index p for every nonnormal abelian subgroup. Chin. Ann. Math. A; 2021; 42, pp. 419-426.
3. Genise, N.J. Gadgets and Gaussians in Lattice-Based Cryptography; UC: San Diego, CA, USA, 2019.
4. Ebelin, W. Lattices and Codes; 3rd ed. Springer: Cham, Switzerland, 2023.
5. Conway, J.H.; Sloane, N.J.A. Sphere Packings, Lattices and Groups; Springer: Cham, Switzerland, 1988.
6. Segre, B. Lattice points in infinite domains, and asymmetric Diophantine approximations. Duke Math. J.; 1945; 12, pp. 337-365. [DOI: https://dx.doi.org/10.1215/S0012-7094-45-01229-4]
7. Lu, J.; Harshan, J.; Oggier, F. Performance of lattice coset codes on Universal Software Radio Peripherals. Phys. Comm.; 2017; 24, pp. 94-102. [DOI: https://dx.doi.org/10.1016/j.phycom.2017.04.004]
8. Kitazume, M.; Munemasa, A. Even Unimodular Gaussian Lattices of Rank 12. J. Number Theory; 2002; 95, pp. 77-94. [DOI: https://dx.doi.org/10.1006/jnth.2001.2749]
9. Henn, A.; Hentschel, M.; Krieg, A. On the classification of lattices over
10. Ozeki, M. On even unimodular positive definite quadratic lattices of rank 32. Math. Zeitschrift; 1986; 191, pp. 283-291. [DOI: https://dx.doi.org/10.1007/BF01164032]
11. Mordell, L.J. The definite quadratic forms in eight variables with determinant unity. J. Math. Pures Appl.; 1938; 17, pp. 41-46.
12. Griess, R.L., Jr. Positive definite lattices of rank at most 8. J. Number Theory; 2003; 103, pp. 77-84. [DOI: https://dx.doi.org/10.1016/S0022-314X(03)00107-0]
13. Griess, R.L., Jr. An Introduction to Groups and Lattices: Finite Groups and Positive Definite Rational Lattices; Higher Education Press: Beijing, China, 2010.
14. Wang, R. Additively indecomposable positive definite integral lattices. Acta Math. Sin. (Engl. Ser.); 2025; 41, 908C924. [DOI: https://dx.doi.org/10.1007/s10114-025-2562-6]
15. Borcherds, R.E. Classification of positive definite lattices. Duke Math. J.; 1999; 105, pp. 525-567. [DOI: https://dx.doi.org/10.1215/S0012-7094-00-10536-4]
16. Zhao, L.; Li, Y.; Gong, L.; Li, L. The Classification of Lattices of Determinant 4 and Rank 5. Axioms; 2025; 14, 577. [DOI: https://dx.doi.org/10.3390/axioms14080577]
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Abstract
This paper is devoted to providing a classification of positive definite lattices with determinant 5 and a rank less than or equal to 6.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
Details
1 College of Mathematics, Guangdong University of Education, Guangzhou 510310, China; [email protected] (L.Z.); [email protected] (Y.L.)
2 School of Mathematics and Statistics, Nantong University, Nantong 226019, China; [email protected]




