Representation of matroids
By M. Lunelli, Antonio Laface. 2002
161 citations recorded by the source corpus.
In this paper we give a necessary and sufficient criterion for representability of a matroid over an algebraic closed field. This leads to an algorithm, based on an extension of Groebner Bases, in order to decide if a given matroid is representable over such a field.
Subfields: Algebra and Number Theory, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/cb6e147f91345181e420e25aeafca3fca557c4d3
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Algebra and Number Theory
In Computational Theory and Mathematics
Citations in the corpus
- Obstructions to determinantal representability (2010, background): “There are several inequalities known to hold for representable polymatroids, see [4, 8, 9].”