Vertex separators, chordality and virtually free groups
Samuel G. Corregidor, \'Alvaro Mart\'inez-P\'erez

TL;DR
This paper explores the use of minimal vertex separators and generalized chordality to characterize virtually free groups and analyze properties of Baumslag-Solitar groups, with applications to the word problem.
Contribution
It introduces new characterizations of virtually free groups using graph-theoretic tools and applies generalized chordality to study Baumslag-Solitar groups and the word problem.
Findings
Two new characterizations of virtually free groups.
Baumslag-Solitar group BS(1,n) is k-chordal iff |n|<3.
Application of generalized chordality to the word problem.
Abstract
In this paper we consider some results obtained for graphs using minimal vertex separators and generalized chordality and translate them to the context of Geometric Group Theory. Using these new tools, we are able to give two new characterizations for a group to be virtually free. Furthermore, we prove that the Baumslag-Solitar group is -chordal for some if and only if and we give an application of generalized chordality to the study of the word problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · semigroups and automata theory · Advanced Combinatorial Mathematics
