Mnëv's universality theorem revisited

zbMath0855.05041MaRDI QIDQ1921466

Jürgen Richter-Gebert

Publication date: 26 January 1997

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119012

zbMATH Keywords

matroidspolynomialuniversality theoremuniversal partition theoremrealization spaces

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

The Complexity of Drawing a Graph in a Polygonal Region ⋮ RAC-drawability is \(\exists \mathbb{R} \)-complete ⋮ Universality theorems for inscribed polytopes and Delaunay triangulations ⋮ Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality ⋮ New examples of oriented matroids with disconnected realization spaces ⋮ RAC-Drawability is ∃ℝ-complete and Related Results ⋮ The universality theorem for neighborly polytopes ⋮ Sign rank versus Vapnik-Chervonenkis dimension ⋮ Complexity of Geometric k-Planarity for Fixed k ⋮ The complexity of tensor rank ⋮ Arrangements of pseudocircles: on circularizability ⋮ Matroid Theory for Algebraic Geometers ⋮ A universality theorem for stressable graphs in the plane ⋮ On the Complexity of Some Geometric Problems With Fixed Parameters ⋮ Generalized dissections and Monsky's theorem