2016/01/04 by Chappelon, Jonathan, Martínez-Sandoval, Leonardo, Montejano, Luis +2
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Metric Geometry (math.MG)
paper · doi:10.48550/arxiv.1601.00421
Let k,d,λ\geqslant 1 be integers with d\geqslant λ and let X be a finite set of points in ℝd. A (d-λ)-plane L transversal to the convex hulls of all k-sets of X is called Kneser transversal. If in addition L contains (d-λ)+1 points of X, then L is called complete Kneser transversal.In this paper, we present various results on the existence of (complete) Kneser transversals for λ=2,3. In order to do this, we introduce the notions of stability and instability for (complete) Kneser transversals. We first give a stability result for collections of d+2(k-λ) points in ℝd with k-λ\geqslant 2 and λ=2,3. We then present a description of Kneser transversals L of collections of d+2(k-λ) points in ℝd with k-λ\geqslant 2 for λ=2,3. We show that either L is a complete Kneser transversal or it contains d-2(λ-1) points and the remaining 2(k-1) points of X are matched in k-1 pairs in such a way that L intersects the corresponding closed segments determined by them. The latter leads to new upper and lower bounds (in the case when λ=2 and 3) for m(k,d,λ) defined as the maximum positive integer n such that every set of n points (not necessarily in general position) in ℝd admit a Kneser transversal.Finally, by using oriented matroid machinery, we present some computational results (closely related to the stability and unstability notions). We determine the existence of (complete) Kneser transversals for each of the 246 different order types of configurations of 7 points in ℝ3.