On the classification of origin-symmetric convex lattice sets
From MaRDI portal
(Redirected from On the classification of origin-symmetric convex lattice sets)
A subset of the integer lattice in the plane is called convex provided it is the intersection of this lattice and a usual convex set. The authors study the classification of origin-symmetric convex lattice sets with respect to integer unimodular transformations and prove that there are 42 equivalence classes of such sets whose cardinality is between 5 and 17.
Recommendations
Cites work
- A generalization of Winternitz's theorem and its discrete version
- An analogue of the Aleksandrov projection theorem for convex lattice polygons
- Free polygon enumeration and the area of an integral polygon
- Generators and relations for discrete groups. 4th ed.
- On a discrete version of Alexandrov's projection theorem
- On the projections of convex lattice sets
- Sums, projections, and sections of lattice sets, and the discrete covariogram
- Unique determination of convex lattice sets
This page was built for publication: On the classification of origin-symmetric convex lattice sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563297)