Point Counts of D_k and Some A_k and E_k Integer Lattices Inside Hypercubes
classification
🧮 math.GT
keywords
hypercubesinsideintegerlatticelatticesa-latticesassumebuild
read the original abstract
Regular integer lattices are characterized by k unit vectors that build up their generator matrices. These have rank k for D-lattices, and are rank-deficient for A-lattices, for E_6 and E_7. We count lattice points inside hypercubes centered at the origin for all three types, as if classified by maximum infinity norm in the host lattice. The results assume polynomial format as a function of the hypercube edge length.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.