Skip to Main content Skip to Navigation
Journal articles

An experimental study of forbidden patterns in geometric permutations by combinatorial lifting

Abstract : We study the problem of deciding if a given triple of permutations can be realized as geometric permutations of disjoint convex sets in R3. 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. In particular, we prove that all triples of permutations of size 5 are realizable, and give a complete list of triples of size 6 that are not.
Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/hal-03152958
Contributor : Xavier Goaoc <>
Submitted on : Thursday, February 25, 2021 - 10:58:18 PM
Last modification on : Monday, March 1, 2021 - 2:32:23 PM

Links full text

Identifiers

Citation

Xavier Goaoc, Andreas Holmsen, Cyril Nicaud. An experimental study of forbidden patterns in geometric permutations by combinatorial lifting. Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2021, Special Issue of Selected Papers from SoCG 2019, 11 (2), pp.131-161. ⟨10.20382/jocg.v11i2a6⟩. ⟨hal-03152958⟩

Share

Metrics

Record views

42