EUVIMEDSkopri EUVIMED
Crossref

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

Hadi Afzali, Ann-Kathrin Elm, Hiu-Fai Law, Malte Müller

The Electronic Journal of Combinatorics · 2026-04-24 · 33 (2)

DOI: 10.37236/14517 ↗

At a glance

Journal article in The Electronic Journal of Combinatorics, published online on 2026-04-24. Written by Hadi Afzali and 3 co-authors.

AstrattDettalji biblijografiċiCiteRelated studies

Abstract (original language)

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.

Cite

APA

Afzali, H., Elm, A., Law, H., & Müller, M. (2026). Lattices of Cyclic Flats of Matroids: from Finite Rank to Finitary and Beyond. The Electronic Journal of Combinatorics, 33(2). https://doi.org/10.37236/14517

Vancouver

Afzali H, Elm A, Law H, Müller M. Lattices of Cyclic Flats of Matroids: from Finite Rank to Finitary and Beyond. The Electronic Journal of Combinatorics. 2026;33(2). doi:10.37236/14517

BibTeX
@article{Afzali2026,
  author = {Afzali, Hadi and Elm, Ann-Kathrin and Law, Hiu-Fai and Müller, Malte},
  title = {Lattices of Cyclic Flats of Matroids: from Finite Rank to Finitary and Beyond},
  journal = {The Electronic Journal of Combinatorics},
  year = {2026},
  volume = {33},
  number = {2},
  doi = {10.37236/14517}
}
Start for free →