Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On Cayley graphs of virtually free groups

On Cayley graphs of virtually free groups In 1985, Dunwoody showed that finitely presentable groups are accessible. Dunwoody's result was used to show that context-free groups, groups quasi-isometric to trees or finitely presentable groups of asymptotic dimension 1 are virtually free. Using another theorem of Dunwoody of 1979, we study when a group is virtually free in terms of its Cayley graph, and we obtain new proofs of the mentioned results and others previously depending on these. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups - Complexity - Cryptology de Gruyter

On Cayley graphs of virtually free groups

Antolín, Yago
Groups - Complexity - Cryptology , Volume 3 (2) – Dec 1, 2011
Download PDF
27 pages

Loading next page...
 
/lp/de-gruyter/on-cayley-graphs-of-virtually-free-groups-dRJPPmAHcx

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
de Gruyter
Copyright
© de Gruyter 2011
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/GCC.2011.012
Publisher site
See Article on Publisher Site

Abstract

In 1985, Dunwoody showed that finitely presentable groups are accessible. Dunwoody's result was used to show that context-free groups, groups quasi-isometric to trees or finitely presentable groups of asymptotic dimension 1 are virtually free. Using another theorem of Dunwoody of 1979, we study when a group is virtually free in terms of its Cayley graph, and we obtain new proofs of the mentioned results and others previously depending on these.

Journal

Groups - Complexity - Cryptology – de Gruyter

Published: Dec 1, 2011

Keywords: Virtually free group; accessible group; Cayley graph; asymptotic dimension

There are no references for this article.