Timeline for The Universality Theorem by Mnev for uniform oriented matroids of rank 4 and higher
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 31, 2019 at 14:27 | comment | added | Nikolai Mnev | Really cool and simple trick, thx @Arnau ! I had something more complicate in mind but i think equivalent. | |
| Nov 18, 2014 at 14:05 | vote | accept | Jae | ||
| Nov 18, 2014 at 11:51 | comment | added | Arnau | Yes, this should run in polynomial time. Lexicographic extensions are explained in section 7.2 of [1]. In Lemma 8.2.1 and Proposition 8.2.2 in the same book it is proven that the realization space of a lexicographic extension is preserved up to homotopy equivalence. The proof for stable equivalence is similar. You can also have a look at arxiv.org/abs/1402.7207. | |
| Nov 17, 2014 at 14:50 | comment | added | Jae | Thanks for the answer, Arnau! I have two follow-up questions. Will the procedure you suggested run in polynomial time? Is the procedure a known technique for which there is a literature reference? Thanks! | |
| Nov 16, 2014 at 13:08 | history | answered | Arnau | CC BY-SA 3.0 |