Topology of cycles in pseudolinear programs (Q1781316): Difference between revisions

To any oriented matroid program an oriented graph can be associated, by orienting the \(1\)-dimensional cells in the pseudohyperplane representation using the positive orientation chosen for the program. It is shown that any oriented link (i.e.\ a topological embedding of a finite free sum of oriented circles into three-space) can be embedded into the set of cycles of some oriented matroid program of rank \(4\), such that this embedding is isotopic to the original embedding defining the link. As the author states, this gives a hint about the possible ``topological complexity'' of rank \(4\) oriented matroids. Connections to quasicrystal tilings are also presented.