Latest documents http://opus4.kobv.de/opus4-ubbayreuth/index/index/ Tue, 15 Apr 2008 10:37:27 +0200 Tue, 15 Apr 2008 10:37:27 +0200 http://opus4.kobv.de/opus4-ubbayreuth/frontdoor/index/index/docId/367 We determine the numbers of integral tetrahedra with diameter d up to isomorphism for all d<=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 4x4 matrices with diameter d fulfilling the triangle inequalities we derive an exact formula. Sascha Kurz workingpaper http://opus4.kobv.de/opus4-ubbayreuth/frontdoor/index/index/docId/367 Tue, 15 Apr 2008 10:37:27 +0200