Classification of Arrangements by the Number of Their Cells.
Combinatorial d-Tori with a Large Symmetry Group.
Combinatorial fans, lattice-ordered groups, and their neighbours: A short excursion.
Computing Simple Circuits from a Set of Line Segments.
Computing the Volume is Difficult.
Convex bodies with circumscribing boxes of constant volume
Corrigendum to "Preassigning the Shape for Bodies of Constant Width".
Countably convex sets
We investigate countably convex subsets of Banach spaces. A subset of a linear space is countably convex if it can be represented as a countable union of convex sets. A known sufficient condition for countable convexity of an arbitrary subset of a separable normed space is that it does not contain a semi-clique [9]. A semi-clique in a set S is a subset P ⊆ S so that for every x ∈ P and open neighborhood u of x there exists a finite set X ⊆ P ∩ u such that conv(X) ⊈ S. For closed sets this condition...
Cutting Disjoint Disks by Straight Lines.