Jurgen Bokowski – författare

Computational synthetic geometry deals with methods for realizing abstract geometric objects in concrete vector spaces. This research monograph considers a large class of problems from convexity and discrete geometry including constructing convex polytopes from simplicial complexes, vector geometries from incidence structures and hyperplane arrangements from oriented matroids. It turns out that algorithms for these constructions exist if and only if arbitrary polynomial equations are decidable with respect to the underlying field. Besides such complexity theorems a variety of symbolic algorithms are discussed, and the methods are applied to obtain new mathematical results on convex polytopes, projective configurations and the combinatorics of Grassmann varieties. Finally algebraic varieties characterizing matroids and oriented matroids are introduced providing a new basis for applying computer algebra methods in this field. The necessary background knowledge is reviewed briefly. The text is accessible to students with graduate level background in mathematics, and will serve professional geometers and computer scientists as an introduction and motivation for further research.

Computational synthetic geometry deals with methods for realizing abstract geometric objects in concrete vector spaces. This research monograph considers a large class of problems from convexity and discrete geometry including constructing convex polytopes from simplicial complexes, vector geometries from incidence structures and hyperplane arrangements from oriented matroids. It turns out that algorithms for these constructions exist if and only if arbitrary polynomial equations are decidable with respect to the underlying field. Besides such complexity theorems a variety of symbolic algorithms are discussed, and the methods are applied to obtain new mathematical results on convex polytopes, projective configurations and the combinatorics of Grassmann varieties. Finally algebraic varieties characterizing matroids and oriented matroids are introduced providing a new basis for applying computer algebra methods in this field. The necessary background knowledge is reviewed briefly. The text is accessible to students with graduate level background in mathematics, and will serve professional geometers and computer scientists as an introduction and motivation for further research.

Kann man 23 Punkte und 23 Geraden in der Ebene so anordnen, dass durch jeden Punkt genau vier Geraden verlaufen und gleichzeitig auf jeder Geraden genau vier Punkte liegen?Kann man einen Messestand als Möbiusband mit gleichgroßen Dreiecken bauen?Wie schafft man den Sprung vom vertrauten dreidimensionalen Raum in die vierte Dimension – oder sogar noch höher?Dieses Buch führt anschaulich in interessante Fragen aus der Geometrie ein, wobei zum Verständnis nur Konzepte aus der Schulmathematik und etwas Vorstellungsvermögen benötigt werden. Der Weg führt von einfachen Punktkonstruktionen über bekannte geometrische Sätze und gelöste Probleme bis hin zu noch offenen Fragen, wodurch auch Nichtmathematikern ein guter Überblick über diesen Teil der Geometrie ermöglicht wird. Eine Vielzahl an Grafiken und Fotos bereichern den Text und die Beispiele werden mit vielen Videos und dynamischen Konstruktionen weiter veranschaulicht. Die interaktiven Modelle benötigen die Programme Cinderella und Blender, die kostenlos heruntergeladen werden können.