Enumeration of integral tetrahedra
| dc.creator | Kurz, Sascha | |
| dc.date | 2008-04-08 | |
| dc.date.accessioned | 2026-07-07T09:31:05Z | |
| dc.date.available | 2026-07-07T09:31:05Z | |
| dc.description | We determine the numbers of integral tetrahedra with diameter $d$ up to isomorphism for all $d\le 1000$ via computer enumeration. Therefore we give an algorithm that enumerates the integral tetrahedra with diameter at most $d$ in $O(d^5)$ 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 $4\times 4$ matrices with diameter $d$ fulfilling the triangle inequalities we derive an exact formula. | |
| dc.description | 10 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/0804.1310 | |
| dc.identifier | http://arxiv.org/abs/0804.1310 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/158338 | |
| dc.subject | Combinatorics | |
| dc.subject | 33F05;05A15 | |
| dc.title | Enumeration of integral tetrahedra | |
| dc.type | text |