English

First order convergence of matroids

Combinatorics 2016-08-16 v3 Discrete Mathematics Logic

Abstract

The model theory based notion of the first order convergence unifies the notions of the left-convergence for dense structures and the Benjamini-Schramm convergence for sparse structures. It is known that every first order convergent sequence of graphs with bounded tree-depth can be represented by an analytic limit object called a limit modeling. We establish the matroid counterpart of this result: every first order convergent sequence of matroids with bounded branch-depth representable over a fixed finite field has a limit modeling, i.e., there exists an infinite matroid with the elements forming a probability space that has asymptotically the same first order properties. We show that neither of the bounded branch-depth assumption nor the representability assumption can be removed.

Keywords

Cite

@article{arxiv.1501.06518,
  title  = {First order convergence of matroids},
  author = {Frantisek Kardos and Daniel Kral and Anita Liebenau and Lukas Mach},
  journal= {arXiv preprint arXiv:1501.06518},
  year   = {2016}
}

Comments

Accepted to the European Journal of Combinatorics

R2 v1 2026-06-22T08:13:17.194Z