A Correction on a Proof of a Combinatorial Property of the Set of Minimal Vectors in Root Lattices \mathbbA_n

2023/07/02 by Xiaoran Kong, Kong, Xiaoran
Computer Science · Engineering · #Advanced Algebra and Logic #Combinatorics (math.CO) #FOS: Mathematics #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2307.00512

openalex publication_date 2023/07/02 · openalex created_date 2023/07/05 · openalex updated_date 2026/07/28

Abstract

In this papar, we point out some mistakes in a proof of an important combinatorial property of S(\mathbbA_n), the set of all minimal vectors of lattice \mathbbA_n, and correct them in the last section. This property plays an essential role in classifying perfect lattices in euclidean space.

Related

• Perfect but not generating Delaunay polytopes
• On the Shortest Lattice Vector vs. the Shortest Basis
• Bases of minimal vectors in tame lattices
• On the coordinates of minimal vectors in a Minkowski-reduced basis
• A Bound on the Norm of Shortest Vectors in Lattices Arising from CM Number Fields