Geometric permutations for convex sets
In connection with Helly's theorem about families of convex sets, much research has been devoted to the search for a similar theory concerning common transversals. The present paper may well be a major step toward such a theory: If A is a family of pairwise disjoint convex sets, and if the straight line G meets all members of A, then each of the two standard linear orderings of G induces an ordering of A. Let f(n) be the maximal possible number of pairs of orderings which can be induced in this way on any family A of pairwise disjoint convex sets in the Euclidean plane, and denote by g(n) the corresponding number for families of linesegments. The authors improve earlier bounds for f and show, by ingenious geometric arguments, that \(g(n)=n\), for every \(n\geq 3\). The paper ends with a number of open questions, also concerning the situation in higher dimensions.
- Geometric permutations of disjoint translates of convex sets
- Upper bounds on geometric permutations for convex sets
- Geometric sets of permutations
- On convex permutations
- Geometric permutations
- scientific article; zbMATH DE number 4028272
- Geometric permutations and two applications
- Geometry, complexity, and combinatorics of permutation polytopes
- Geometry of permutation limits
- Permutations defining convex permutominoes
- Geometric permutations and common transversals
- scientific article; zbMATH DE number 3774429 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- scientific article; zbMATH DE number 3271295 (Why is no real title available?)
- On common transversals
- Two counterexamples concerning transversals for convex subsets of the plane
- Geometric permutations and common transversals
- Geometric permutations of disjoint translates of convex sets
- An upper bound for families of linearly related plane convex sets
- On \(k\)-sets in arrangements of curves and surfaces
- The different ways of stabbing disjoint convex sets
- Proof of Grünbaum's conjecture on common transversals for translates
- Not all graphs are segment \(T\)-graphs
- Polyhedral line transversals in space
- Geometric permutations of higher dimensional spheres
- On the connected components of the space of line transversals to a family of convex sets
- Geometric permutations of non-overlapping unit balls revisited
- Convex polygons and common transversals
- scientific article; zbMATH DE number 4164879 (Why is no real title available?)
- scientific article; zbMATH DE number 7559240 (Why is no real title available?)
- scientific article; zbMATH DE number 7324093 (Why is no real title available?)
- The triples of geometric permutations for families of disjoint translates
- scientific article; zbMATH DE number 7731164 (Why is no real title available?)
- Geometric orderings of intersecting translates and their applications
- A generalization of Hadwiger's transversal theorem to intersecting sets
- Upper bounds on geometric permutations for convex sets
- The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2
- The geometry of sum-preserving permutations
- Covering convex sets with non-overlapping polygons
- Algorithms for high dimensional stabbing problems
- Suballowable sequences and geometric permutations
- The combinatorial encoding of disjoint convex sets in the plane
This page was built for publication: Geometric permutations for convex sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266447)
