Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Discrete Equidecomposability and Ehrhart Theory of Polygons

Discrete Equidecomposability and Ehrhart Theory of Polygons

Thumbnail Image
Download
Name

454_2020_211_ReferencePDF.pdf

Size

407.82 KB

Format

Adobe PDF

Checksum (MD5)

56c38cba6e4000ef9b706976787a9667

Download all files submitted through automated deposit
art_1573884720072447778.zip (351.43 KB)
Author(s)
Turner, Paxton
•
Wu, Yuhuai
Date Issued
June 2020
Journal
Discrete & Computational Geometry
Publisher
Springer Science and Business Media LLC
Citation
Turner, Paxton and Yuhuai Wu. "Discrete Equidecomposability and Ehrhart Theory of Polygons." Discrete & Computational Geometry 65, 1 (June 2020): 90–115 © 2020 Springer Science Business Media
Version
Author's final manuscript
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²) 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.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
https://hdl.handle.net/1721.1/129408
DOI of Published Version
https://doi.org/10.1007/s00454-020-00211-1
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.