Scholarlink

<p>We construct a family of independent sets for finite, atomic, and graded lattices, extending the well-known cryptomorphism between geometric lattices and matroids. This construction leads to an embedding theorem into geometric lattices that preserves the set of atoms. We then apply these results to adjoint matroids, providing new characterizations of adjoints and partially proving a conjecture on the combinatorial derived matroid. Finally, we use our characterization of adjoints to compute the adjoint lists of several simple examples.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Independent Sets of Non-geometric Lattices and the Maximal Adjoint

  • 期刊论文

  • 发表日期：

    2025年12月8日

查看全文
  • Or Raz

摘要

We construct a family of independent sets for finite, atomic, and graded lattices, extending the well-known cryptomorphism between geometric lattices and matroids. This construction leads to an embedding theorem into geometric lattices that preserves the set of atoms. We then apply these results to adjoint matroids, providing new characterizations of adjoints and partially proving a conjecture on the combinatorial derived matroid. Finally, we use our characterization of adjoints to compute the adjoint lists of several simple examples.