Latest documents http://opus4.kobv.de/opus4-ubbayreuth/index/index/ Tue, 15 Apr 2008 11:07:00 +0200 Tue, 15 Apr 2008 11:07:00 +0200 http://opus4.kobv.de/opus4-ubbayreuth/frontdoor/index/index/docId/377 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. Axel Kohnert; Sascha Kurz preprint http://opus4.kobv.de/opus4-ubbayreuth/frontdoor/index/index/docId/377 Tue, 15 Apr 2008 11:07:00 +0200 http://opus4.kobv.de/opus4-ubbayreuth/frontdoor/index/index/docId/376 We give two configurations of seven points in the plane, no three points in a line, no four points on a circle with pairwise integral distances. This answers a famous question of Paul Erdös. Tobias Kreisel; Sasch Kurz preprint http://opus4.kobv.de/opus4-ubbayreuth/frontdoor/index/index/docId/376 Tue, 15 Apr 2008 11:04:02 +0200 http://opus4.kobv.de/opus4-ubbayreuth/frontdoor/index/index/docId/375 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. Sascha Kurz; Alfred Wassermann preprint http://opus4.kobv.de/opus4-ubbayreuth/frontdoor/index/index/docId/375 Tue, 15 Apr 2008 11:01:24 +0200 http://opus4.kobv.de/opus4-ubbayreuth/frontdoor/index/index/docId/369 Geometrical objects with integral side lengths have fascinated mathematicians through the ages. We call a set P={p(1),...,p(n)} in Z^2 a maximal integral point set over Z^2 if all pairwise distances are integral and every additional point p(n+1) destroys this property. Here we consider such sets for a given cardinality and with minimum possible diameter. We determine some exact values via exhaustive search and give several constructions for arbitrary cardinalities. Since we cannot guarantee the maximality in these cases we describe an algorithm to prove or disprove the maximality of a given integral point set. We additionally consider restrictions as no three points on a line and no four points on a circle. Sascha Kurz; Andrey Radoslavov Antonov preprint http://opus4.kobv.de/opus4-ubbayreuth/frontdoor/index/index/docId/369 Tue, 15 Apr 2008 10:45:28 +0200