Boolean Representations of Matroids and Lattices
classification
🧮 math.CO
math.ACmath.RAmath.RT
keywords
booleanrepresentationlatticesmatroidrepresentationsassociatedboundconcept
read the original abstract
We introduce a new representation concept for lattices by boolean matrices, and utilize it to prove that any matroid is boolean representable. We show that such a representation can be easily extracted from a representation of the associated lattice of flats of the matroid, leading also to a tighter bound on the representation's size. Consequently, we obtain a linkage of boolean representations with geometry in a very natural way.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.