with Stefan Felsner and Manfred Scheucher, Combinatorial Theory, Volume 5, Issue 4.
We investigate the extendability of signotopes — a combinatorial structure encoding a rich subclass of pseudohyperplane arrangements. Our main result is that signotopes of odd rank are always extendable, while SAT-based computations provide non-extendable examples in even ranks.
Description: This is an arbitrary example to compare the different types of visualizations.
Description: This configuration is not 2-extendable and was found in the course of the article An Extension Theorem for Signotopes (with Stefan Felsner and Manfred Scheucher, Combinatorial Theory, Volume 5, Issue 4).