Refine
Year of publication
- 2007 (3) (remove)
Document Type
- Preprint (2)
- Working Paper (1)
Keywords
- ordnungstreues Erzeugen (3) (remove)
Institute
- Mathematik (3)
- Informatik (1)
-
Enumeration of integral tetrahedra
(2007)
- 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.
-
On the minimum diameter of plane integral point sets
(2007)
- Since ancient times mathematicians consider geometrical objects with integral side lengths. We consider plane integral point sets P, which are sets of n points in the plane with pairwise integral distances where not all the points are collinear. The largest occurring distance is called its diameter. Naturally the question about the minimum possible diameter d(2,n) of a plane integral point set consisting of n points arises. We give some new exact values and describe state-of-the-art algorithms to obtain them. It turns out that plane integral point sets with minimum diameter consist very likely of subsets with many collinear points. For this special kind of point sets we prove a lower bound for d(2,n) achieving the known upper bound n^{c_2loglog n} up to a constant in the exponent.
-
Integral point sets over Z_n^m
(2007)
- There are many papers studying properties of point sets in the Euclidean space or on integer grids, with pairwise integral or rational distances. In this article we consider the distances or coordinates of the point sets which instead of being integers are elements of Z_n, and study the properties of the resulting combinatorial structures.
