Weak orientability of matroids and polynomial equations
From MaRDI portal
Publication:491739
DOI10.1016/j.ejc.2015.03.018zbMath1319.05029arXiv1309.7719OpenAlexW2024140835MaRDI QIDQ491739
Jon Lee, Susan Margulies, Jacob Miller, Jesús A. De Loera
Publication date: 19 August 2015
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.7719
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
- Matroid enumeration for incidence geometry
- Nonrealizability proofs in computational geometry
- The incidence structure of subspaces with well-scaled frames
- The Tutte group of a weakly orientable matroid
- Decomposition of regular matroids
- Algebraic varieties characterizing matroids and oriented matroids
- Computational synthetic geometry
- Oriented matroids
- Orientability of matroids
- A characterization of the orientations of ternary matroids
- Testing orientability for matroids is NP-complete
- Orienting matroids representable over both GF(3) and GF(5)
- Some minimal non-orientable matroids of rank three
- Matroids with nine elements
- Matroid Complexity and Nonsuccinct Descriptions
- Algorithmic versus axiomatic definitions of matroids
- The Forbidden Minors of Binary Clutters
- Oriented Matroids
