Independent sets of non-geometric lattices and the maximal adjoint

arXiv2307.05005MaRDI QIDQ6443271FDOQ6443271

Authors: Or Raz 

Publication date: 10 July 2023

Abstract: We present a construction of a family of independent sets for a finite, atomic and graded lattice generalizing the known cryptomorphism between geometric lattices and matroids. This family then gives rise to an embedding theorem into geometric lattices preserving the set of atoms. Lastly we apply these theorems to the concept of adjoint matroids obtaining a characterization and proving a conjecture on the combinatorial derived madtroid for uniform and co-rank 3 matroids.

This page was built for publication: Independent sets of non-geometric lattices and the maximal adjoint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6443271)