### Refine

#### Document Type

- Preprint (14)
- Article (1)
- Working Paper (1)

#### Language

- English (16) (remove)

#### Keywords

- Kombinatorik (6)
- integral distances (5)
- Durchmesser (4)
- exhaustive search (4)
- ganzzahlige Abstände (4)
- ganzzahlige Punktmengen (4)
- Geometrische Kombinatorik (3)
- Operations Research (3)
- diameter (3)
- erschöpfende Suche (3)

#### Institute

- Mathematik (16)
- Informatik (1)
- Wirtschaftswissenschaften (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.

- 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.

- Demand forecasting for companies with many branches, low sales numbers per product, and non-recurring orderings (2006)
- We propose the new Top-Dog-Index to quantify the historic deviation of the supply data of many small branches for a commodity group from sales data. On the one hand, the common parametric assumptions on the customer demand distribution in the literature could not at all be supported in our real-world data set. On the other hand, a reasonably-looking non-parametric approach to estimate the demand distribution for the different branches directly from the sales distribution could only provide us with statistically weak and unreliable estimates for the future demand.

- Convex hulls of polyominoes (2007)
- In this article we prove a conjecture of Bezdek, Brass, and Harborth concerning the maximum volume of the convex hull of any facet-to-facet connected system of $n$ unit hypercubes in $mathbb{R}^d$. For $d=2$ we enumerate the extremal polyominoes and determine the set of possible areas of the convex hull for each $n$.

- 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.

- Integral point sets over finite fields (2007)
- We consider point sets in the affine plane GF(q)^2 where each Euclidean distance of two points is an element of GF(q). These sets are called integral point sets and were originally defined in m-dimensional Euclidean spaces. We determine their maximal cardinality I(GF(q),2). For arbitrary commutative rings R instead of GF(q) or for further restrictions as no three points on a line or no four points on a circle we give partial results. Additionally we study the geometric structure of the examples with maximum cardinality.

- Inclusion-maximal integral point sets over finite fields (2007)
- We consider integral point sets in affine planes over finite fields. Here an integral point set is a set of points in $GF(q)^2$ where the formally defined Euclidean distance of every pair of points is an element of $GF(q)$. From another point of view we consider point sets over $GF(q)^2$ with few and prescribed directions. So this is related to Redeis work. Another motivation comes from the field of ordinary integral point sets in Euclidean spaces. In this article we study the spectrum of integral point sets over $GF(q)^2$ which are maximal with respect to inclusion. We give some theoretical results, constructions, conjectures, and some numerical data.

- Lotsize optimization leading to a p-median problem with cardinalities (2007)
- We consider the problem of approximating the branch and size dependent demand of a fashion discounter with many branches by a distributing process being based on the branch delivery restricted to integral multiples of lots from a small set of available lot-types. We propose a formalized model which arises from a practical cooperation with an industry partner. Besides an integer linear programming formulation and a primal heuristic for this problem we also consider a more abstract version which we relate to several other classical optimization problems like the p-median problem, the facility location problem or the matching problem.

- 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.