Enumeration of integral tetrahedra
Sascha Kurz

TL;DR
This paper presents a comprehensive enumeration of integral tetrahedra up to diameter 1000, providing algorithms for enumeration and canonicity checking, and deriving an exact formula for related matrix classes.
Contribution
It introduces algorithms for enumerating integral tetrahedra and checking their canonicity, along with an exact formula for certain matrix classes, advancing computational geometry methods.
Findings
Enumerated integral tetrahedra up to diameter 1000.
Developed an $O(d^5)$ enumeration algorithm.
Derived an exact formula for specific matrix classes.
Abstract
We determine the numbers of integral tetrahedra with diameter up to isomorphism for all via computer enumeration. Therefore we give an algorithm that enumerates the integral tetrahedra with diameter at most in time and an algorithm that can check the canonicity of a given integral tetrahedron with at most 6 integer comparisons. For the number of isomorphism classes of integral matrices with diameter fulfilling the triangle inequalities we derive an exact formula.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Advanced Mathematical Identities · Advanced Combinatorial Mathematics
