Skip to main content
MathOverflow

Return to Answer

Corrected "is" to "was"!
Source Link
Joseph O'Rourke
Joseph O'Rourke
  • 150.8k
  • 36
  • 358
  • 958

Here I only address your representation-of-a-matroid algorithm question.

The paper,

Massimiliano Lunelli, Antonio Laface. "Representation of matroids." 2002. (arXiv abs link).

uses Gröbner bases of polynomials over the ring of integers to decide if a given matroid is representable. Here is a quote describing some results of using their algorithm:

![Lunelli][1]
Their code isis was available at *[Lunelli's website](http://www.matapp.unimib.it/~lunelli/)*, as cited in their paper.

Here I only address your representation-of-a-matroid algorithm question.

The paper,

Massimiliano Lunelli, Antonio Laface. "Representation of matroids." 2002. (arXiv abs link).

uses Gröbner bases of polynomials over the ring of integers to decide if a given matroid is representable. Here is a quote describing some results of using their algorithm:

![Lunelli][1]
Their code is available at *[Lunelli's website](http://www.matapp.unimib.it/~lunelli/)*.

Here I only address your representation-of-a-matroid algorithm question.

The paper,

Massimiliano Lunelli, Antonio Laface. "Representation of matroids." 2002. (arXiv abs link).

uses Gröbner bases of polynomials over the ring of integers to decide if a given matroid is representable. Here is a quote describing some results of using their algorithm:

![Lunelli][1]
Their code is was available at *[Lunelli's website](http://www.matapp.unimib.it/~lunelli/)*, as cited in their paper.
Typo in URL.
Source Link
Joseph O'Rourke
Joseph O'Rourke
  • 150.8k
  • 36
  • 358
  • 958

Here I only address your representation-of-a-matroid algorithm question.

The paper,

Massimiliano Lunelli, Antonio Laface. "Representation of matroids." 2002. (arXiv abs link).

uses Gröbner bases of polynomials over the ring of integers to decide if a given matroid is representable. Here is a quote describing some results of using their algorithm:

![Lunelli][1]
Their code is available at *[Lunelli's website](http://www.matapp.unimib.it/∼lunelli~lunelli/matroidi)*.

Here I only address your representation-of-a-matroid algorithm question.

The paper,

Massimiliano Lunelli, Antonio Laface. "Representation of matroids." 2002. (arXiv abs link).

uses Gröbner bases of polynomials over the ring of integers to decide if a given matroid is representable. Here is a quote describing some results of using their algorithm:

![Lunelli][1]
Their code is available at *[Lunelli's website](http://www.matapp.unimib.it/∼lunelli/matroidi)*.

Here I only address your representation-of-a-matroid algorithm question.

The paper,

Massimiliano Lunelli, Antonio Laface. "Representation of matroids." 2002. (arXiv abs link).

uses Gröbner bases of polynomials over the ring of integers to decide if a given matroid is representable. Here is a quote describing some results of using their algorithm:

![Lunelli][1]
Their code is available at *[Lunelli's website](http://www.matapp.unimib.it/~lunelli/)*.
Source Link
Joseph O'Rourke
Joseph O'Rourke
  • 150.8k
  • 36
  • 358
  • 958

Here I only address your representation-of-a-matroid algorithm question.

The paper,

Massimiliano Lunelli, Antonio Laface. "Representation of matroids." 2002. (arXiv abs link).

uses Gröbner bases of polynomials over the ring of integers to decide if a given matroid is representable. Here is a quote describing some results of using their algorithm:

![Lunelli][1]
Their code is available at *[Lunelli's website](http://www.matapp.unimib.it/∼lunelli/matroidi)*.