Skip to main navigation Skip to search Skip to main content

Combinatorial obstructions to the lifting of weaving diagrams

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

This paper deals with various connections of oriented matroids [3] and weaving diagrams of lines in space [9], [16], [27]. We encode the litability problem of a particular weaving diagram D on n lines by the realizability problem of a partial oriented matroid χ D with 2n elements in rank 4. We prove that the occurrence of a certain substructure in D implies that χD is noneuclidean in the sense of Edmonds, Fukuda, and Mandel [12], [14]. Using this criterion we construct an infinite class of minor-minimal noneuclidean oriented matroids in rank 4. Finally, we give an easy algebraic proof for the nonliftability of the alternating weaving diagram on a bipartite grid of 4×4 lines [16].

Original languageEnglish
Pages (from-to)287-312
Number of pages26
JournalDiscrete and Computational Geometry
Volume10
Issue number1
DOIs
StatePublished - Dec 1993

Fingerprint

Dive into the research topics of 'Combinatorial obstructions to the lifting of weaving diagrams'. Together they form a unique fingerprint.

Cite this