| dc.contributor.author | Turner, Paxton | |
| dc.contributor.author | Wu, Yuhuai | |
| dc.date.accessioned | 2021-01-13T19:20:27Z | |
| dc.date.available | 2021-01-13T19:20:27Z | |
| dc.date.issued | 2020-06 | |
| dc.date.submitted | 2020-02 | |
| dc.identifier.issn | 0179-5376 | |
| dc.identifier.issn | 1432-0444 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/129408 | |
| dc.description.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. | en_US |
| dc.publisher | Springer Science and Business Media LLC | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1007/s00454-020-00211-1 | en_US |
| dc.rights | 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. | en_US |
| dc.source | Springer US | en_US |
| dc.title | Discrete Equidecomposability and Ehrhart Theory of Polygons | en_US |
| dc.type | Article | en_US |
| dc.identifier.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 | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | en_US |
| dc.relation.journal | Discrete & Computational Geometry | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
| dc.date.updated | 2021-01-04T04:10:47Z | |
| dc.language.rfc3066 | en | |
| dc.rights.holder | Springer Science+Business Media, LLC, part of Springer Nature | |
| dspace.embargo.terms | Y | |
| dspace.date.submission | 2021-01-04T04:10:46Z | |
| mit.journal.volume | 65 | en_US |
| mit.journal.issue | 1 | en_US |
| mit.license | PUBLISHER_CC | |
| mit.metadata.status | Complete | |