{"title":"凸刹那集内部的旋转","authors":"Barnabás Janzer","doi":"10.1007/s00454-024-00639-9","DOIUrl":null,"url":null,"abstract":"<p>Let <i>K</i> be a convex body (a compact convex set) in <span>\\(\\mathbb {R}^d\\)</span>, that contains a copy of another body <i>S</i> in every possible orientation. Is it always possible to continuously move any one copy of <i>S</i> into another, inside <i>K</i>? As a stronger question, is it always possible to continuously select, for each orientation, one copy of <i>S</i> in that orientation? These questions were asked by Croft. We show that, in two dimensions, the stronger question always has an affirmative answer. We also show that in three dimensions the answer is negative, even for the case when <i>S</i> is a line segment – but that in any dimension the first question has a positive answer when <i>S</i> is a line segment. And we prove that, surprisingly, the answer to the first question is negative in dimensions four and higher for general <i>S</i>.</p>","PeriodicalId":50574,"journal":{"name":"Discrete & Computational Geometry","volume":"37 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2024-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Rotation Inside Convex Kakeya Sets\",\"authors\":\"Barnabás Janzer\",\"doi\":\"10.1007/s00454-024-00639-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Let <i>K</i> be a convex body (a compact convex set) in <span>\\\\(\\\\mathbb {R}^d\\\\)</span>, that contains a copy of another body <i>S</i> in every possible orientation. Is it always possible to continuously move any one copy of <i>S</i> into another, inside <i>K</i>? As a stronger question, is it always possible to continuously select, for each orientation, one copy of <i>S</i> in that orientation? These questions were asked by Croft. We show that, in two dimensions, the stronger question always has an affirmative answer. We also show that in three dimensions the answer is negative, even for the case when <i>S</i> is a line segment – but that in any dimension the first question has a positive answer when <i>S</i> is a line segment. And we prove that, surprisingly, the answer to the first question is negative in dimensions four and higher for general <i>S</i>.</p>\",\"PeriodicalId\":50574,\"journal\":{\"name\":\"Discrete & Computational Geometry\",\"volume\":\"37 1\",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-03-30\",\"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-00639-9\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete & Computational Geometry","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00454-024-00639-9","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
摘要
让 K 成为 \(\mathbb {R}^d\)中的一个凸体(一个紧凑的凸集),它在每一个可能的方向上都包含另一个凸体 S 的副本。是否总是可以在 K 内连续地把 S 的任何一个副本移动到另一个副本中?更强的问题是,是否总是可以在每个方向上连续选择 S 在该方向上的一个副本?克罗夫特提出了这些问题。我们证明,在二维空间中,更强问题总是有肯定的答案。我们还证明,在三维空间中,即使 S 是一条线段,答案也是否定的--但在任何维度中,当 S 是一条线段时,第一个问题的答案都是肯定的。我们还证明,令人惊讶的是,对于一般的 S,第一个问题的答案在四维和更高维都是否定的。
Let K be a convex body (a compact convex set) in \(\mathbb {R}^d\), that contains a copy of another body S in every possible orientation. Is it always possible to continuously move any one copy of S into another, inside K? As a stronger question, is it always possible to continuously select, for each orientation, one copy of S in that orientation? These questions were asked by Croft. We show that, in two dimensions, the stronger question always has an affirmative answer. We also show that in three dimensions the answer is negative, even for the case when S is a line segment – but that in any dimension the first question has a positive answer when S is a line segment. And we prove that, surprisingly, the answer to the first question is negative in dimensions four and higher for general S.
期刊介绍:
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.