REVIEW 2 cited by
The Lattice of Cyclic Flats of a Matroid
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
Signed reviews
read the original abstract
A flat of a matroid is cyclic if it is a union of circuits. The cyclic flats of a matroid form a lattice under inclusion. We study these lattices and explore matroids from the perspective of cyclic flats. In particular, we show that every lattice is isomorphic to the lattice of cyclic flats of a matroid. We give a necessary and sufficient condition for a lattice Z of sets and a function r on Z to be the lattice of cyclic flats of a matroid and the restriction of the corresponding rank function to Z. We define cyclic width and show that this concept gives rise to minor-closed, dual-closed classes of matroids, two of which contain only transversal matroids.
Forward citations
Cited by 2 Pith papers
-
Hepp's bound for Feynman graphs and matroids
The Hepp bound, a rational matroid invariant from tropicalizing the Feynman period integral, provably respects all known graph period symmetries and correlates strongly with actual periods.
-
Graph theoretic properties of Speyer's matroid polynomial $g_M(t)$
For graphic and cographic matroids, the derivative g'_M(-1) equals (-1)^{c(M)-1} c(M), and computational data suggests many new properties of the coefficient N2.
Discussion (0). Continue with ORCID to comment.