• Deutsch
Login

OPUS

  • Home
  • Search
  • Browse
  • Publish
  • FAQ
Search Fields

Refine

Author

  • Sascha Kurz (17)
  • Jörg Rambau (4)
  • Axel Kohnert (2)
  • Miriam Kießling (2)
  • Alfred Wassermann (1)
  • Andrey Radoslavov Antonov (1)
  • Christian Haase (1)
  • Constantin Gaul (1)
  • Cornelius Schwarz (1)
  • Jörg Rambau (1)

Year of publication

  • 2007 (6)
  • 2005 (4)
  • 2008 (3)
  • 2012 (3)
  • 2006 (1)

Document Type

  • Preprint (17) (remove)

Language

  • English (14)
  • German (3)

Keywords

  • Kombinatorik (8)
  • integral distances (5)
  • Durchmesser (4)
  • erschöpfende Suche (4)
  • exhaustive search (4)
  • ganzzahlige Abstände (4)
  • ganzzahlige Punktmengen (4)
  • diameter (3)
  • integral point sets (3)
  • Abstand (2)

Institute

  • Mathematik (17) (remove)

17 search hits

search hits 1 to 10

  • Next Page
  • Last Page

Sort by

  • Year
  • Year
  • Title
  • Title
  • Author
  • Author
Show/Hide Abstract A bijection between the d-dimensional simplices with distances in {1,2} and the partitions of d+1 (2005)
Christian Haase Sascha Kurz
We give a construction for the d-dimensional simplices with all distances in {1,2} from the set of partitions of d+1.
Show/Hide Abstract Counting polyominoes with minimum perimeter (2005)
Sascha Kurz
Es wird die Anzahl der wesentlich verschiedenen Polyominoes der Ordnung n mit minimalem Umfang p(n) bestimmt.
Show/Hide Abstract On the characteristic of integral point sets in $\mathbb{E}^m$ (2005)
Sascha Kurz
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.
Show/Hide Abstract A note on Erdös-Diophantine graphs and Diophantine carpets (2005)
Axel Kohnert Sascha Kurz
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.
Show/Hide Abstract Convex hulls of polyominoes (2007)
Sascha Kurz
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$.
Show/Hide Abstract Maximal integral point sets over Z^2 (2008)
Sascha Kurz Andrey Radoslavov Antonov
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.
Show/Hide Abstract Enumeration of generalized polyominoes (2006)
Matthias Koch Sascha Kurz
Wir verallgemeinern den Begriff von Polyominoes (Tetrisbausteine) und betrachten Seite-an-Seite benachbarte überschneidungsfreie Vereinigungen von regelmäßigen k-Ecken. Für n<=4 geben wir Formeln für die Anzahl a_k(n) von verallgemeinerten Polyominoes, bestehend aus n regelmäßigen k-Ecken, an. Für weitere kleine Werte von k und n tabellieren wir durch computerunterstützte Enumeration gewonnene Anzahlen. Zum Abschluss erwähnen wir ein paar ungelöste Probleme für verallgemeinerte Polyominoes.
Show/Hide Abstract Integral point sets over finite fields (2007)
Sascha Kurz
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.
Show/Hide Abstract Inclusion-maximal integral point sets over finite fields (2007)
Michael Kiermaier Sascha Kurz
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.
Show/Hide Abstract Lotsize optimization leading to a p-median problem with cardinalities (2007)
Constantin Gaul Sascha Kurz Jörg Rambau
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.

search hits 1 to 10

  • Next Page
  • Last Page

OPUS4 Logo

  • Contact
  • Imprint
  • Sitelinks