REVIEW 1 cited by
Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We study point-line configurations, their minimal matroids, and their associated circuit varieties. We present an algorithm for identifying the minimal matroids of these configurations with respect to dependency order, or equivalently, the maximal matroids with respect to weak order, and use it to determine the irreducible decomposition of their corresponding circuit varieties. Our algorithm is applied to several classical configurations, including the Fano matroid, affine plane of order three, MacLane, and Pappus configurations. Additionally, we explore the connection to a conjecture by Jackson and Tanigawa, which provides a criterion for the uniqueness of the minimal matroids.
Forward citations
Cited by 1 Pith paper
-
Algebraic Geometry of Cactus, Pascal, and Pappus Matroids
For cactus, Pascal, and Pappus configurations, the matroid ideal is generated, up to radical, by circuit, Grassmann-Cayley, and liftability polynomials.
Discussion (0). Sign in to comment.