Unique determination of convex lattice sets
This paper investigates certain questions from discrete tomography, analogous to some classical results in geometric tomography. Specifically, the well-known theorem of Aleksandrov states that a convex \(0\)-symmetric set in a Euclidean space is uniquely determined by the areas of its projections. A discrete analogue of Aleksandrov's theorem has been proposed in [\textit{R. J. Gardner} et al., Discrete Comput. Geom. 34, No. 3, 391--409 (2005; Zbl 1093.52008)]: given two \(0\)-symmetric convex lattice sets \(K\) and \(L\) in \(\mathbb Z^n\), \(n \geq 2\), such that for every \(u \in \mathbb Z^n\), \(\left| K \mid u^{\perp} \right| = \left| L \mid u^{\perp} \right|\), is it necessarily true that \(K=L\)? Here \(K \mid u^{\perp}\) stands for the projection of the set \(K\) into the hyperplane normal to the vector \(u\), and \(\left| K \mid u^{\perp} \right|\) for its cardinality. In fact, in the same paper this question is answered negatively when~\(n=2\). The paper under review addresses a related question: given two full-dimensional \(0\)-symmetric convex lattice sets \(K\) and \(L\) in \(\mathbb Z^n\) such that for every \(u \in \mathbb Z^n\), \(\left| \partial(K \mid u^{\perp}) \right| = \left| \partial(L \mid u^{\perp}) \right|\), is it necessarily true that \(K=L\)? Here \(\partial (K \mid u^{\perp})\) is the discrete boundary of the projection, i.e. it consists of the points of \(K \mid u^{\perp}\) that lie on the boundary of the convex hull of \(K \mid u^{\perp}\). The main results of this paper answer this question in the affirmative when \(n=3\), as well as when \(n \geq 4\) and convex hulls of \(K\) and \(L\) are zonotopes (finite Minkowski sums of line segments). The proofs employ tools from the geometry of numbers and discrete geometry, including Pick's theorem and Minkowski uniqueness theorem (up to translation) for convex polytopes with given facet areas and normals.
- On a discrete version of Alexandrov's projection theorem
- On the projections of convex lattice sets
- An analogue of the Aleksandrov projection theorem for convex lattice polygons
- Uniqueness in discrete tomography: Three remarks and a corollary
- Discrete tomography: Determination of finite sets by X-rays
- An analogue of the Aleksandrov projection theorem for convex lattice polygons
- Computing the Continuous Discretely
- Convex and Discrete Geometry
- Geometric tomography
- scientific article; zbMATH DE number 481054 (Why is no real title available?)
- scientific article; zbMATH DE number 236540 (Why is no real title available?)
- Integer points in polyhedra
- 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
- Topics in hyperplane arrangements, polytopes and box-splines
- Discrete analogues of John's theorem
- On a discrete version of Alexandrov's projection theorem
- Sums, projections, and sections of lattice sets, and the discrete covariogram
- An analogue of the Aleksandrov projection theorem for convex lattice polygons
- A generalization of Winternitz's theorem and its discrete version
- On the projections of convex lattice sets
- Geometric and functional inequalities for log-concave probability sequences
- Unique determination of convex polytopes by non-central sections
- On the classification of origin-symmetric convex lattice sets
- A remark on discrete Brunn-Minkowski type inequalities via transportation of measure
This page was built for publication: Unique determination of convex lattice sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q527438)
