### Refine

#### Year of publication

- 2005 (4) (remove)

#### Document Type

- Preprint (4) (remove)

#### Keywords

- Kombinatorik (3)
- ganzzahlige Punktmengen (3)
- Geometrische Kombinatorik (2)
- integral point sets (2)
- Abzählen (1)
- Algebraische Kombinatorik (1)
- Bijektion (1)
- Charakteristik (1)
- Graphen (1)
- Polyominoes (1)

- A bijection between the d-dimensional simplices with distances in {1,2} and the partitions of d+1 (2005)
- We give a construction for the d-dimensional simplices with all distances in {1,2} from the set of partitions of d+1.

- Counting polyominoes with minimum perimeter (2005)
- Es wird die Anzahl der wesentlich verschiedenen Polyominoes der Ordnung n mit minimalem Umfang p(n) bestimmt.

- On the characteristic of integral point sets in $\mathbb{E}^m$ (2005)
- We generalise the definition of the characteristic of an integral triangle to integral simplices and prove that each simplex in an integral point set has the same characteristic. This theorem is used for an efficient construction algorithm for integral point sets. Using this algorithm we are able to provide new exact values for the minimum diameter of integral point sets.

- A note on Erdös-Diophantine graphs and Diophantine carpets (2005)
- A Diophantine figure is a set of points on the integer grid $\mathbb{Z}^{2}$ where all mutual Euclidean distances are integers. We also speak of Diophantine graphs. The vertices are points in $\mathbb{Z}^{2}$ (the coordinates)and the edges are labeled with the distance between the two adjacent vertices, which is integral. In this language a Diophantine figure is a complete Diophantine graph. Two Diophantine graphs are equivalent if they only differ by translation or rotation of vertices. Due to a famous theorem of Erdös and Anning there are complete Diophantine graphs which are not contained in larger ones. We call them Erdös-Diophantine graphs. A special class of Diophantine graphs are Diophantine carpets. These are planar triangulations of a subset of the integer grid. We give an effective construction for Erdös-Diophantine graphs and characterize the chromatic number of Diophantine carpets.