Geometric permutations and common transversals
Let \({\mathcal F}\) be a finite family of disjoint convex subsets of the plane and p(\({\mathcal F})\) the family of all geometric permutations of \({\mathcal F}\). For the notion of geometric permutation and other results see the paper of the first two authors and \textit{J. Zaks} [Discrete Math. 54, 271-284 (1985; Zbl 0561.52002). In this paper the authors give the following two results: (1) n-1 \(\leq \max | p({\mathcal F})| \leq \left( \begin{matrix} n\\ 2\end{matrix} \right)\), where the maximum is taken over all families of n pairwise disjoint convex sets. (2) \(| p({\mathcal F})| \leq 8\), for every family \({\mathcal F}\) of at least 11 pairwise disjoint translates of a convex set. The authors notice that in the paper mentioned above the lower bound in (1) has been improved to 2n-2.
- Upper bounds on geometric permutations for convex sets
- Geometric permutations for convex sets
- Geometric permutations of disjoint translates of convex sets
- The maximal number of geometric permutations for \(n\) disjoint translates of a convex set in \(\mathbb R\) is \(\Omega(n)\)
- The different ways of stabbing disjoint convex sets
- An upper bound for families of linearly related plane convex sets
- The different ways of stabbing disjoint convex sets
- On neighbors in geometric permutations.
- Geometric permutations for convex sets
- On the number of directions determined by the common tangents to a family of pairwise disjoint convex sets in the plane
- Forbidden families of geometric permutations in \(\mathbb R^{d}\)
- The maximal number of geometric permutations for \(n\) disjoint translates of a convex set in \(\mathbb R\) is \(\Omega(n)\)
- On geometric permutations induced by lines transversal through a fixed point
- scientific article; zbMATH DE number 66692 (Why is no real title available?)
- scientific article; zbMATH DE number 7559240 (Why is no real title available?)
- Some discrete properties of the space of line transversals to disjoint balls
- The triples of geometric permutations for families of disjoint translates
- A tight bound on the number of geometric permutations of convex fat objects in \(\mathbb{R}^d\)
- Geometric orderings of intersecting translates and their applications
- 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
- Covering convex sets with non-overlapping polygons
- Algorithms for high dimensional stabbing problems
- Suballowable sequences and geometric permutations
This page was built for publication: Geometric permutations and common transversals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1084672)
