Lattices of Cyclic Flats of Matroids: from Finite Rank to Finitary and Beyond

  • Seyed Hadi Afzali Borujeni
  • Ann-Kathrin Elm
  • Hiu-Fai Law
  • Malte Müller

Abstract

In the finite case, there are close connections between lattices and matroids. More notably, every lattice can be realised as the lattice of cyclic flats of some matroid. The main concern of this paper is finding analogous connections in the infinite case. In particular, we introduce a class of set systems (which forms a superclass of matroids) whose lattices of cyclic flats model all (possibly infinite) complete lattices.

Published
2026-04-24
How to Cite
Afzali, H., Elm, A.-K., Law, H.-F., & Müller, M. (2026). Lattices of Cyclic Flats of Matroids: from Finite Rank to Finitary and Beyond. The Electronic Journal of Combinatorics, 33(2), #P2.16. https://doi.org/10.37236/14517
Article Number
P2.16