Discrete Equidecomposability and Ehrhart Theory of Polygons

DISCRETE & COMPUTATIONAL GEOMETRY(2020)

引用 1|浏览6
暂无评分
摘要
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 ℤ^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.
更多
查看译文
关键词
Combinatorics,Discrete geometry,Dissections and valuations,Lattice polytopes
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要