vix.ing · top · new · best · stats · spec

On the classification of lattice polytopes via affine equivalence

2024/09/16 by Zhanyuan Cai, Yuqin Zhang, Cai, Zhanyuan +3
Computer Science · Mathematics · #Computational Geometry and Mesh Generation #Point processes and geometric inequalities #Advanced Combinatorial Mathematics

paper · pdf · doi:10.48550/arxiv.2409.09985

Abstract

In 1980, V. I. Arnold studied the classification problem for convex lattice polygons of a given area. Since then, this problem and its analogues have been studied by many authors, including Bárány, Lagarias, Pach, Santos, Ziegler and Zong. Despite extensive study, the structure of the representative sets in the classifications remains unclear, indicating a need for refined classification methods. In this paper, we propose a novel classification framework based on affine equivalence, which offers a fresh perspective on the problem. Our approach yields several classification results that extend and complement Bárány's work on volume and Zong's work on cardinality. These new results provide a more nuanced understanding of the structure of the representative set, offering deeper insights into the classification problem.

Related