DeepAI AI Chat
Log In Sign Up

A universality theorem for allowable sequences with applications

by   Udo Hoffmann, et al.
Université Libre de Bruxelles

Order types are a well known abstraction of combinatorial properties of a point set. By Mnëv's universality theorem for each semi-algebraic set V there is an order type with a realization space that is stably equivalent to V. We consider realization spaces of allowable sequences, a refinement of order types. We show that the realization spaces of allowable sequences are universal and consequently deciding the realizability is complete in the existential theory of the reals (). This result holds even if the realization space of the order type induced by the allowable sequence is non-empty. Furthermore, we argue that our result is a useful tool for further geometric reductions. We support this by giving -hardness proofs for the realizability of abstract convex geometries and for the recognition problem of visibility graphs of polygons with holes using the hardness result for allowable sequences. This solves two longstanding open problems.


page 1

page 2

page 3

page 4


Smoothed Analysis of Order Types

Consider an ordered point set P = (p_1,...,p_n), its order type (denoted...

New Construction of Complementary Sequence (or Array) Sets and Complete Complementary Codes (I)

A new method to construct q-ary complementary sequence (or array) sets (...

Geometric Embeddability of Complexes is ∃ℝ-complete

We show that the decision problem of determining whether a given (abstra...

External univalence for second-order generalized algebraic theories

Voevodsky's univalence axiom is often motivated as a realization of the ...

Connecting 3-manifold triangulations with monotonic sequences of bistellar flips

A key result in computational 3-manifold topology is that any two triang...

Every Combinatorial Polyhedron Can Unfold with Overlap

Ghomi proved that every convex polyhedron could be stretched via an affi...

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 b...