Upper bounds on geometric permutations for convex sets (Q748890)

A common transversal for a family A of n pairwise disjoint compact convex sets in \({\mathbb{R}}^ d\) is a line intersecting each set in A which is done in a unique order, up to reversal. This ordering and its reversal is named a geometric permutation of A. Geometric permutations partition the common transversals of A into disjoint sets such that any two transversals in the same set intersect A in the same ordering. If H is a set of hyperplanes in \({\mathbb{R}}^ d\) then H is called a separation set for A if for every pair of elements of A there exists a hyperplane of H so that this hyperplane strictly separates the two elements of A. The author then determines the number \(\Psi_ d(H)\) of sets into which the directed transversales of A can be partitioned such that every two directed lines in the same set which intersect any \(A'\subseteq A\) generate the same ordering on \(A'\). Next, consider a family A in \({\mathbb{R}}^ 2\). Then it is proved that there exists a family B of pairwise disjoint convex polygons such that each convex set of A is contained in a polygon in B, that the total number of edges of the polygons in B is at most 12n and that, if L is a set of lines containing the edges of the polygons in B, \(\Psi_ 2(L)\leq 12n\) holds. The author conjectures that 12n can be replaced by 6n. He also asks whether the last results can be generalized to higher dimensions.