An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting

We study the problem of deciding if a given triple of permutations can be realized as geometric permutations of disjoint convex sets in $\mathbb{R}^3$. We show that this question, which is equivalent to deciding the emptiness of certain semi-algebraic sets bounded by cubic polynomials, can be "lifted" to a purely combinatorial problem. We propose an effective algorithm for that problem, and use it to gain new insights into the structure of geometric permutations.

[1]  A. Liu,et al.  Geometric permutations and common transversals , 1986, Discret. Comput. Geom..

[2]  Marcus Schaefer,et al.  Fixed Points, Nash Equilibria, and the Existential Theory of the Reals , 2017, Theory of Computing Systems.

[3]  Henri Lombardi,et al.  An Elementary Recursive Bound for Effective Positivstellensatz and Hilbert’s 17th problem , 2014, Memoirs of the American Mathematical Society.

[4]  Haim Kaplan,et al.  Improved Bounds for Geometric Permutations , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[5]  B. Grünbaum,et al.  On common transversals , 1958 .

[6]  Bin Li,et al.  Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients , 2012, J. Symb. Comput..

[7]  Peter Bürgisser,et al.  Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time , 2017, J. ACM.

[8]  Andreas Holmsen,et al.  HELLY-TYPE THEOREMS AND GEOMETRIC TRANSVERSALS , 2016 .

[9]  Gábor Tardos,et al.  Excluded permutation matrices and the Stanley-Wilf conjecture , 2004, J. Comb. Theory, Ser. A.

[10]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

[11]  Andrei Asinowski,et al.  Forbidden Families of Geometric Permutations in ℝd , 2005, Discret. Comput. Geom..

[12]  Micha Sharir,et al.  The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2 , 1990, Discret. Comput. Geom..

[13]  Ted Lewis,et al.  Geometric permutations for convex sets , 1985, Discret. Math..

[14]  Joseph S. B. Mitchell,et al.  Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in Rd , 2000, Discret. Comput. Geom..

[15]  James H. Davenport,et al.  Real Quantifier Elimination is Doubly Exponential , 1988, J. Symb. Comput..

[16]  Xavier Goaoc,et al.  Geometric permutations of disjoint unit spheres , 2005, Comput. Geom..

[17]  Micha Sharir,et al.  Combinatorial Geometry and Its Algorithmic Applications , 2008 .

[18]  Helge Tverberg,et al.  Proof of grünbaum's conjecture on common transversals for translates , 1989, Discret. Comput. Geom..

[19]  Olivier Devillers,et al.  Fast and Robust Triangle-Triangle Overlap Test Using Orientation Predicates , 2003, J. Graphics, GPU, & Game Tools.

[20]  Xavier Goaoc,et al.  Geometric permutations of non-overlapping unit balls revisited , 2014, Comput. Geom..

[21]  Boris Aronov,et al.  On geometric permutations induced by lines transversal through a fixed point , 2005, SODA '05.

[22]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[23]  M. Katchalski.  A conjecture of Grünbaum on common transversals. , 1986 .

[24]  Helge Tverberg.  On Geometric Permutations and the Katchalski-Lewis Conjecture on Partial Transversals for Translates , 1990, Discrete and Computational Geometry.

[25]  J. Kratochvil,et al.  Intersection Graphs of Segments , 1994, J. Comb. Theory, Ser. B.