Combinatorial cost: A coarse setting

DOI10.1090/TRAN/7716zbMATH Open1417.05233arXiv1711.00413OpenAlexW2964054095MaRDI QIDQ5227971FDOQ5227971

Tom Kaiser

Publication date: 7 August 2019

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Abstract: The main inspiration for this paper is a paper by Elek where he introduces combinatorial cost for graph sequences. We show that having cost equal to 1 and hyperfiniteness are coarse invariants. We also show `cost-1' for box spaces behaves multiplicatively when taking subgroups. We show that graph sequences coming from Farber sequences of a group have property A if and only if the group is amenable. The same is true for hyperfiniteness. This generalises a theorem by Elek. Furthermore we optimise this result when Farber sequences are replaced by sofic approximations. In doing so we introduce a new concept: property almost-A.

Full work available at URL: https://arxiv.org/abs/1711.00413

zbMATH Keywords

limits of graphsFarber sequences

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph theory (05C99)

Cites Work

• Endomorphisms of symbolic algebraic varieties
• Sofic groups and dynamical systems.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Rank gradient, cost of groups and the rank versus Heegaard genus problem
• PROPERTY A AND GRAPHS WITH LARGE GIRTH
• Expanders and box spaces
• The strong approximation conjecture holds for amenable groups
• Sofic boundaries of groups and coarse geometry of sofic approximations
• The combinatoral cost

Cited In (7)

• Uniform local amenability implies Property A
• A Characterization of Combinatorial Demand
• Group approximation in Cayley topology and coarse geometry. II: Fibred coarse embeddings
• Group approximation in Cayley topology and coarse geometry Part I: Coarse embeddings of amenable groups
• The complete cost of cofactor \(h=1\)
• Mini-workshop: Growth and expansion in groups. Abstracts from the mini-workshop held April 7--12, 2024
• Non-standard limits of graphs and some orbit equivalence invariants

This page was built for publication: Combinatorial cost: A coarse setting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5227971)