Discrete equidecomposability and Ehrhart theory of polygons
DOI10.1007/S00454-020-00211-1zbMATH Open1456.52019arXiv1412.0196OpenAlexW3189467910MaRDI QIDQ2223628FDOQ2223628
Authors: Paxton Turner, Yuhuai Wu
Publication date: 29 January 2021
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.0196
Recommendations
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Dissections and valuations (Hilbert's third problem, etc.) (52B45)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing the Continuous Discretely
- Triangulations of integral polytopes and Ehrhart polynomials
- The minimum period of the Ehrhart quasi-polynomial of a rational polytope
- Quasi-period collapse and GL_n(Z)-scissors congruence in rational polytopes
- Lattice invariant valuations on rational polytopes
- Piecewise SL 2 Z Geometry
- Ehrhart-equivalent 3-polytopes are equidecomposable
- Cubic graphs, their Ehrhart quasi-polynomials, and a scissors congruence phenomenon
Cited In (5)
- Spectrality of Polytopes and Equidecomposability by Translations
- Ehrhart-equivalent 3-polytopes are equidecomposable
- THE EULER NUMBER OF DISCRETISED SETS – SURPRISING RESULTS IN THREE DIMENSIONS
- Equidecomposability of polyhedra: a solution of Hilbert's third problem in Kraków before ICM 1900
- Period collapse in Ehrhart quasi-polynomials of \(\{1,3\}\)-graphs
This page was built for publication: Discrete equidecomposability and Ehrhart theory of polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2223628)