Fragmenting any Parallelepiped into a Signed Tiling

IF 0.6 3区 数学 Q4 COMPUTER SCIENCE, THEORY & METHODS Discrete & Computational Geometry Pub Date : 2024-06-11 DOI:10.1007/s00454-024-00664-8
Joseph Doolittle, Alex McDonough
{"title":"Fragmenting any Parallelepiped into a Signed Tiling","authors":"Joseph Doolittle, Alex McDonough","doi":"10.1007/s00454-024-00664-8","DOIUrl":null,"url":null,"abstract":"<p>It is broadly known that any parallelepiped tiles space by translating copies of itself along its edges. In earlier work relating to higher-dimensional sandpile groups, the second author discovered a novel construction which fragments the parallelepiped into a collection of smaller tiles. These tiles fill space with the same symmetry as the larger parallelepiped. Their volumes are equal to the components of the multi-row Laplace determinant expansion, so this construction only works when all of these signs are non-negative (or non-positive). In this work, we extend the construction to work for all parallelepipeds, without requiring the non-negative condition. This naturally gives tiles with negative volume, which we understand to mean canceling out tiles with positive volume. In fact, with this cancellation, we prove that every point in space is contained in exactly one more tile with positive volume than tile with negative volume. This is a natural definition for a signed tiling. Our main technique is to show that the net number of signed tiles doesn’t change as a point moves through space. This is a relatively indirect proof method, and the underlying structure of these tilings remains mysterious.</p>","PeriodicalId":50574,"journal":{"name":"Discrete & Computational Geometry","volume":"1 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2024-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete & Computational Geometry","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00454-024-00664-8","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

It is broadly known that any parallelepiped tiles space by translating copies of itself along its edges. In earlier work relating to higher-dimensional sandpile groups, the second author discovered a novel construction which fragments the parallelepiped into a collection of smaller tiles. These tiles fill space with the same symmetry as the larger parallelepiped. Their volumes are equal to the components of the multi-row Laplace determinant expansion, so this construction only works when all of these signs are non-negative (or non-positive). In this work, we extend the construction to work for all parallelepipeds, without requiring the non-negative condition. This naturally gives tiles with negative volume, which we understand to mean canceling out tiles with positive volume. In fact, with this cancellation, we prove that every point in space is contained in exactly one more tile with positive volume than tile with negative volume. This is a natural definition for a signed tiling. Our main technique is to show that the net number of signed tiles doesn’t change as a point moves through space. This is a relatively indirect proof method, and the underlying structure of these tilings remains mysterious.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
将任意平行六面体分割成有符号平铺法
众所周知,任何平行四边形都是通过沿其边缘平移自身的副本来平铺空间的。在早先有关高维沙堆群的研究中,第二位作者发现了一种新颖的构造,它能将平行六面体分割成一系列较小的瓦片。这些瓦片以与较大的平行六面体相同的对称性填充空间。它们的体积等于多行拉普拉斯行列式展开的分量,因此只有当所有这些符号都是非负(或非正)时,这种构造才有效。在这项工作中,我们扩展了该构造,使其适用于所有平行四边形,而无需非负条件。这自然会产生负体积的瓦片,我们将其理解为抵消正体积的瓦片。事实上,通过这种抵消,我们可以证明空间中的每个点包含在正体积瓦片中的数量比包含在负体积瓦片中的数量多出一个。这是有符号瓦片的自然定义。我们的主要技巧是证明有符号瓦片的净数量不会随着点在空间中的移动而改变。这是一种相对间接的证明方法,这些瓦片的底层结构仍然是个谜。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Discrete & Computational Geometry
Discrete & Computational Geometry 数学-计算机:理论方法
CiteScore
1.80
自引率
12.50%
发文量
99
审稿时长
6-12 weeks
期刊介绍: Discrete & Computational Geometry (DCG) is an international journal of mathematics and computer science, covering a broad range of topics in which geometry plays a fundamental role. It publishes papers on such topics as configurations and arrangements, spatial subdivision, packing, covering, and tiling, geometric complexity, polytopes, point location, geometric probability, geometric range searching, combinatorial and computational topology, probabilistic techniques in computational geometry, geometric graphs, geometry of numbers, and motion planning.
期刊最新文献
The Complexity of Order Type Isomorphism Volume Computation for Meissner Polyhedra and Applications Erdős–Szekeres-Type Problems in the Real Projective Plane The Structure of Metrizable Graphs Estimating the Convex Hull of the Image of a Set with Smooth Boundary: Error Bounds and Applications
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1