Schreier graphs of an extended version of the binary adding machine.
The electronic journal of combinatorics, Tome 21 (2014) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In this paper we give a complete classification of the infinite Schreier graphs of an automaton group generated by an extended version of the binary adding machine.
DOI : 10.37236/3593
Classification : 20E08, 05C25, 20F05, 43A07
Mots-clés : groups acting on trees, Schreier graphs, ends of graphs, finitely generated automata groups, bounded automata

Daniele D'Angeli  1

1 TU Graz
@article{10_37236_3593,
     author = {Daniele D'Angeli},
     title = {Schreier graphs of an extended version of the binary adding machine.},
     journal = {The electronic journal of combinatorics},
     year = {2014},
     volume = {21},
     number = {4},
     doi = {10.37236/3593},
     zbl = {1338.20029},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/3593/}
}
TY  - JOUR
AU  - Daniele D'Angeli
TI  - Schreier graphs of an extended version of the binary adding machine.
JO  - The electronic journal of combinatorics
PY  - 2014
VL  - 21
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/3593/
DO  - 10.37236/3593
ID  - 10_37236_3593
ER  - 
%0 Journal Article
%A Daniele D'Angeli
%T Schreier graphs of an extended version of the binary adding machine.
%J The electronic journal of combinatorics
%D 2014
%V 21
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/3593/
%R 10.37236/3593
%F 10_37236_3593
Daniele D'Angeli. Schreier graphs of an extended version of the binary adding machine.. The electronic journal of combinatorics, Tome 21 (2014) no. 4. doi: 10.37236/3593

Cité par Sources :