{"title":"On the enumeration of integer tetrahedra","authors":"James East , Michael Hendriksen , Laurence Park","doi":"10.1016/j.comgeo.2022.101915","DOIUrl":null,"url":null,"abstract":"<div><p><span>We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding problem for triangles, which has long been solved. We expect there are no closed-form solutions to the tetrahedron enumeration problems, but we explore the extent to which they can be approached via classical methods, such as orbit enumeration. We also discuss algorithms for computing the numbers, and present several tables and figures that can be used to visualise the data. Several intriguing patterns seem to emerge, leading to a number of natural conjectures. The central conjecture is that the number of integer tetrahedra of perimeter </span><em>n</em>, up to congruence, is asymptotic to <span><math><msup><mrow><mi>n</mi></mrow><mrow><mn>5</mn></mrow></msup><mo>/</mo><mi>C</mi></math></span> for some constant <span><math><mi>C</mi><mo>≈</mo><mn>229000</mn></math></span>.</p></div>","PeriodicalId":51001,"journal":{"name":"Computational Geometry-Theory and Applications","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Geometry-Theory and Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S092577212200058X","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding problem for triangles, which has long been solved. We expect there are no closed-form solutions to the tetrahedron enumeration problems, but we explore the extent to which they can be approached via classical methods, such as orbit enumeration. We also discuss algorithms for computing the numbers, and present several tables and figures that can be used to visualise the data. Several intriguing patterns seem to emerge, leading to a number of natural conjectures. The central conjecture is that the number of integer tetrahedra of perimeter n, up to congruence, is asymptotic to for some constant .
期刊介绍：
Computational Geometry is a forum for research in theoretical and applied aspects of computational geometry. The journal publishes fundamental research in all areas of the subject, as well as disseminating information on the applications, techniques, and use of computational geometry. Computational Geometry publishes articles on the design and analysis of geometric algorithms. All aspects of computational geometry are covered, including the numerical, graph theoretical and combinatorial aspects. Also welcomed are computational geometry solutions to fundamental problems arising in computer graphics, pattern recognition, robotics, image processing, CAD-CAM, VLSI design and geographical information systems.
Computational Geometry features a special section containing open problems and concise reports on implementations of computational geometry tools.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
