Discrete Equidecomposability and Ehrhart Theory of Polygons

Abstract

Motivated by questions from Ehrhart theory, we present new results on discrete equidecomposability. Two rational polygons P and Q are said to be discretely equidecomposable if there exists a piecewise affine-unimodular bijection (equivalently, a piecewise affine-linear bijection that preserves the integer lattice Z 2 ) from P to Q. We develop an invariant for a particular version of this notion called rational finite discrete equidecomposability. We construct triangles that are Ehrhart equivalent but not rationally finitely discretely equidecomposable, thus providing a partial negative answer to a question of Haase-McAllister on whether Ehrhart equivalence implies discrete equidecomposability. Surprisingly, if we delete an edge from each of these triangles, there exists an infinite rational discrete equidecomposability relation between them. Our final section addresses the topic of infinite equidecomposability with concrete examples and a potential setting for further investigation of this phenomenon.

Period collapse in Ehrhart quasi-polynomials of \(\{1,3\}\)-graphs

“…It is an open problem to characterize those rational polytopes for which it is possible to carry out this reassembling process [HM08]. Turner and Wu [TW21] gave examples in R 2 of rational polygons with the same Ehrhart quasi-polynomial for which such process is not possible.…”