2 papers
math.DS2026
The Almost Finite--Purely Infinite Dichotomy for Minimal Amenable Ample Groupoids
Gábor Elek, Ádám Timár
We answer, in the principal setting, a question of Matui on the almost finite--purely infinite dichotomy for minimal amenable ample groupoids. We prove that a second-countable Haus…
math.GR2023
Strong almost finiteness
Gábor Elek, Ádám Timár
A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many Følner sets, and we call it strongly almost finite, if the tiling can…