Classification of Sol lattices
Emil Moln\'ar, Jen\"o Szirmai

TL;DR
This paper classifies $ ext{SOL}$ lattices into 17 types using an algorithmic approach, extending Euclidean lattice classifications, and explores their relations with Minkowskian lattices and $ ext{SOL}$ parallelepipeds.
Contribution
It introduces a novel classification of $ ext{SOL}$ lattices into 17 types and studies their properties and relations with Minkowskian lattices using affine-projective coordinates.
Findings
Classified $ ext{SOL}$ lattices into 17 types.
Established relations between $ ext{SOL}$ and Minkowskian lattices.
Introduced the concept of $ ext{SOL}$ parallelepipeds.
Abstract
geometry is one of the eight homogeneous Thurston 3-geomet-ri-es In \cite{Sz10} the {\it densest lattice-like translation ball packings} to a type (type {\bf I/1} in this paper) of lattices has been determined. Some basic concept of were defined by {\sc{P. Scott}} in \cite{S}, in general. In our present work we shall classify lattices in an algorithmic way into 17 (seventeen) types, in analogy of the 14 Bravais types of the Euclidean 3-lattices, but infinitely many affine equivalence classes, in each type. Then the discrete isometry groups of compact fundamental domain (crystallographic groups) can also be classified into infinitely many classes but finitely many types, left to other publication. To this we shall study relations between lattices and lattices of the pseudoeuclidean (or here…
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
TopicsDigital Image Processing Techniques
