Schreier graphs of an extended version of the binary adding machine.

zbMath1338.20029MaRDI QIDQ470941

Daniele D'Angeli

Publication date: 13 November 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i4p20

zbMATH Keywords

groups acting on treesbounded automataSchreier graphsends of graphsfinitely generated automata groups

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Groups acting on trees (20E08) Means on groups, semigroups, etc.; amenable groups (43A07)

Related Items (1)

Graph automaton groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite-state self-similar actions of nilpotent groups.
• On a family of Schreier graphs of intermediate growth associated with a self-similar group
• Free subgroups in groups acting on rooted trees
• On amenability of automata groups.
• Schreier graphs of the Basilica group.
• Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
• Ends of Schreier graphs and cut-points of limit spaces of self-similar groups
• Notes on the Schreier graphs of the Grigorchuk group
• The Ihara zeta function of infinite graphs, the KNS spectral measure and integrable maps
• Self-similar groups acting essentially freely on the boundary of the binary rooted tree

This page was built for publication: Schreier graphs of an extended version of the binary adding machine.