New invariants for integral lattices
Ryota Hayasaka, Tsuyoshi Miezaki, Masahiko Toki

TL;DR
This paper introduces new invariants for integral lattices based on hyperspheres passing through a specific number of lattice points, with computational insights for 2D lattices of class number one.
Contribution
The paper presents novel lattice invariants derived from hypersphere properties and applies them to classify two-dimensional lattices with class number one.
Findings
Existence of hyperspheres passing through exactly n lattice points for all n>0
Introduction of new invariants based on these hyperspheres
Computational results for 2D lattices of class number one
Abstract
Let be any integral lattice in Euclidean space. It has been shown that for every integer , there is a hypersphere that passes through exactly points of . Using this result, we introduce new lattice invariants and give some computational results related to two-dimensional Euclidean lattices of class number one.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Digital Image Processing Techniques · Mathematical Dynamics and Fractals
New invariants for integral lattices
Ryota Hayasaka, Tsuyoshi Miezaki , and Masahiko Toki
Drecom Co., Ltd. [email protected] of Education, University of the Ryukyus, Okinawa 903–0213, Japan [email protected] Oita National College of Technology, [email protected]
Abstract
Let be any integral lattice in Euclidean space. It has been shown that for every integer , there is a hypersphere that passes through exactly points of . Using this result, we introduce new lattice invariants and give some computational results related to two-dimensional Euclidean lattices of class number one.
Key Words and Phrases. quadratic fields, lattices, lattice invariant.
2010 Mathematics Subject Classification. Primary 05E99; Secondary 11R04; Tertiary 11F11.
1 Introduction
We consider the following condition on lattices .
Definition 1.1** ([5, 1]).**
If there is a hypersphere in that passes through exactly points of for every integer , then is called “universally concyclic.”
A lattice generated by , , is denoted by . In [5], Maehara introduced the term “universally concyclic.” Then, he and others showed the following results. In [7] and [4], Schinzel, Maehara, and Matsumoto proved that , that is, , is universally concyclic. Moreover, if are such that is a prime and , then is universally concyclic. The equilateral triangular lattice and the rectangular lattice are universally concyclic. In [1], it was shown that all integral lattices in with are universally concyclic.
Remark 1.1**.**
We remark that there exist some nonintegral lattices that are not universally concyclic. Maehara also proved in [5] that if is a transcendental number, then cannot contain four concyclic points, and hence, it is not universally concyclic. The rectangular lattice does not contain five concyclic points if and only if is an irrational number. Hence, some additional integrality conditions are necessary to ensure this property.
Let be an imaginary quadratic field, and let be its ring of algebraic integers. Let be the ideal classes of . In this paper, we only consider the cases , namely, is in the following set: .
We denote by the discriminant of :
[TABLE]
Theorem 1.1** (cf. [9, p. 87]).**
Let be a positive square-free integer, and let . Then
[TABLE]
Therefore, we consider to be a lattice in with the basis
[TABLE]
denoted by , , respectively. Note that is the lattice.
The main purpose of this paper is to introduce the new lattice invariants (Definition 1.2) and to give some computational results related to two-dimensional Euclidean lattices of class number one (Theorem 1.2).
We introduce the following new lattice invariants .
Definition 1.2**.**
Let be an integral lattice. For , the universally concyclic number (or for short) is defined by the square of the minimum value among the radii of the hyperspheres that pass through exactly points of .
If two lattices and are isomorphic, then for all . Therefore, is an invariant of the lattice . In [3], Maehara proposed the following problem:
Problem 1.1**.**
Determine the for .
In this paper, we determine the for some and whose class number is one.
The following table provides the computational results.
Theorem 1.2**.**
Let as in Theorem 1.1. Concyclic numbers of two-dimensional Euclidean lattices of class number one for if are determined as indicated in Table 1.
We calculated the integer sequences and for small , and speculated that they have simple rules. Therefore, we have the following problem:
Problem 1.2**.**
Determine and for all .
In this paper, we give a partial answer of Problem 1.2. Namely, we give an exact upperbound of and .
Theorem 1.3**.**
Let and be nonnegative integers, let be the -th smallest prime that is congruent to set p_{0}:=1$$), and let be the -th smallest prime that is congruent to set q_{0}:=1$$).
- (1)
There exists a circle that passes through exactly points of :
[TABLE]
Therefore, we have
[TABLE] 2. (2)
The number of the integer solutions of the following equation
[TABLE]
is . This means that the circle
[TABLE]
passes through exactly points of . Therefore, we have
[TABLE]
In Section 2, we give the computational algorithm used in Theorem 1.2. In Section 3, we provide the proof of Theorem 1.3. In Section 4, we present further problems.
All the computer calculations in this paper were done by Mathematica [8] and C Programming Language [6].
2 Algorithm
In this section, we give the algorithm used to find the square of the minimum value among the radii of the hyperspheres that pass through exactly points of .
Assume that is one of in Theorem 1.2. Let be a positive integer, and let be the set of that satisfies , and if (if , then let be the set of that satisfies , and ). We shall try to create a hypersphere by taking three vertices on . Notice that a hypersphere is determined uniquely by taking three vertices over .
First, we shall explain how to plot the three vertices on . Let be the -th vertex . Set , and let vary such that it plots every vertex such that on . Then, we let vary such that it plots every vertex , except for such that on . This algorithm will provide every hypersphere passing through that can be generated by any on .
Next, we shall explain how to obtain the coordinates for the center and the square of the radius of a hypersphere. Let be the center of a hypersphere, and let be the square of the radius of the hypersphere. Then,
[TABLE]
where .
Next, we explain how to enumerate the number of lattice points such that . Let move from to , where is the Gauss symbol. For the equation , solve for : . Set . If and , or if and , then (in the case of ). If and , then (in the case of ). It is seen that denotes the number of lattice points such that after moving from to . Therefore, we can obtain the hypersphere that passes through exactly points.
Using the above method, since we can find the hyperspheres that pass through exactly points for any , we can obtain the square of the minimum value of the radius by selecting the smallest radius of any of the hyperspheres that pass through exactly points of .
3 Proof of Theorem 1.3
First, we claim that the circle passes through exactly points of . By Fermat’s Theorem, for all , there exists , such that . Therefore, . Notice that and are irreducible elements over . Since , . Hence , where . We consider the number of possible outcomes for . We can express as follows:
, where , and .
It is easily seen that the choice of or does not depend on the number of possible outcomes of , since the absolute value of the real part and the imaginary part of and is the same.
Consequently, the number of possible outcomes of is over . From this, the number of such that is .
Next, we claim that they all correspond to the lattice point such that . Since and , implies that and Y^{2}\equiv 1$$\pmod{4}. Moreover, it implies that and . Therefore, the number of lattice points such that is equivalent to the number of such that , and .
Thus, the number of lattice points such that is just .
Next, we claim that the number of the integer solutions of the following equation
[TABLE]
is .
The proof is similar to the first part. Set . Then, for all , there exists , such that
[TABLE]
Notice that and are irreducible elements over , and , where . We consider the number of possible outcomes for . We can express as follows: , where , .
As a consequence, the number of possible outcomes of is over . From this, the number of such that is . Now, since it can be seen that is equivalent to , the circle
[TABLE]
passes through exactly points of .
Remark 3.1**.**
We remark that the conditions in Theorem 1.3 “the -th smallest prime” and “the -th smallest prime” do not use in the proof of Theorem 1.3. For example, the number of solutions (points of ) is determined by the number of primes appearing in the product
[TABLE]
On the other hand, we need these conditions in order to answer Problem 1.2.
4 Further problems
- (1)
Find a law in the table of Theorem 1.2. 2. (2)
For , determine the for and . 3. (3)
Let
[TABLE]
Then, we define the two lattices, and , where
[TABLE]
In [2], it was shown that the theta series of and are the same, namely, the number of lattice vectors of norm are the same for all . However, these two lattices are nonisomorphic, and the proof of this fact is not easy [2].
Therefore, we have the following problem: Determine the and for some , and show that and are nonisomorphic.
Acknowledgments
The authors would like to thank the anonymous reviewers for their beneficial comments on an earlier version of the manuscript. This work was supported by JSPS KAKENHI (18K03217).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] E. Bannai and T. Miezaki, On a property of 2-dimensional integral Euclidean lattices, J. Number Theory 132 (2012), no. 3, 371–378.
- 2[2] J.H. Conway and N.J.A. Sloane, Four-dimensional lattices with the same theta series, Internat. Math. Res. Notices (1992), no. 4, 93–96.
- 3[3] H. Maehara, Seisu Koshi No Shoto Kika, Proceedings of the Combinatorics Summer school 2008 http://infoshako.sk.tsukuba.ac.jp/~hachi/COS/combin.jp/maebara_08.pdf
- 4[4] H. Maehara and M. Matsumoto, Is there a circle that passes through a given number of lattice points?, Europ. J. Combinatorics 19 (1998), 591–592, doi:10.1006/eujc.1997.0189.
- 5[5] H. Maehara, On the number of concyclic points in planar lattices, Research Institute of Educational Development, Tokai University , 5 (2009) 3–16.
- 6[6] B. Kernighan and D. Ritchie, C Programming Language , Prentice Hall (1988).
- 7[7] A. Schinzel, Sur l’existence d’un cercle passant par un nombre donné de points aux coordonnées entières. (French), Enseignement Math. ( 2 ) 2 (2) 4 (1958), 71–72.
- 8[8] Wolfram Research, Inc., Mathematica, Version 10.3, Wolfram Research, Inc. (2015).
