Cantor combinatorics and almost finiteness
Dynamical Systems
2018-02-07 v1 Combinatorics
Abstract
In this survey we give a concise introduction to a continuous version of Borel combinatorics. Our approach will have a certain algorithm-theoretic nature and we will give special emphasis to the notion of almost finiteness introduced by Matui as a continuous analogue of Borel hyperfiniteness. We also show how the theory can be used to study spectral convergence for graph Laplacians.
Keywords
Cite
@article{arxiv.1802.01908,
title = {Cantor combinatorics and almost finiteness},
author = {Gabor Elek},
journal= {arXiv preprint arXiv:1802.01908},
year = {2018}
}
Comments
12 pages