A descriptive construction of trees and Stallings’ theorem

DOI10.1090/conm/752/15137zbMath1496.20049arXiv1805.09506OpenAlexW3036694357MaRDI QIDQ3299567

Anush Tserunyan

Publication date: 23 July 2020

Published in: Trends in Set Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Descriptive set theory (03E15) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Algebraic ergodic theory, cocycles, orbit equivalence, ergodic equivalence relations (37A20) Groups acting on trees (20E08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ends of graphed equivalence relations. I
• Ends of graphed equivalence relations. II
• Borel chromatic numbers
• Cutting up graphs
• Topology of generic leaves
• Cost of equivalence relations and groups
• Nielsen realization by gluing: limit groups and free products
• On torsion-free groups with infinitely many ends
• Vertex Cuts
• Cutting up graphs revisited – a short proof of Stallings' structure theorem
• Accessibility and Groups of Cohomological Dimension One
• Ends of graphs
• Ends of graphs. II
• COUNTABLE BOREL EQUIVALENCE RELATIONS
• Structure Trees, Networks and Almost Invariant Sets
• A CACTUS THEOREM FOR END CUTS
• Quasi-isometries between non-locally-finite graphs and structure trees