Schreier Graphs of an Extended Version of the Binary Adding Machine

Daniele D'Angeli

Schreier Graphs of an Extended Version of the Binary Adding Machine

Institute of Discrete Mathematics (5050)

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Article number	P.4.20
Number of pages	14
Journal	The Electronic Journal of Combinatorics
Volume	21
Issue number	4
Publication status	Published - 2014

Fields of Expertise

Information, Communication & Computing

Access to Document

https://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i4p20/pdfLicence: CC BY 3.0

Cite this

@article{1f70f1a96c1545fc8542afa5ed4beb03,

title = "Schreier Graphs of an Extended Version of the Binary Adding Machine",

abstract = "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.",

author = "Daniele D'Angeli",

year = "2014",

language = "English",

volume = "21",

journal = "The Electronic Journal of Combinatorics ",

issn = "1077-8926",

publisher = "Electronic Journal of Combinatorics",

number = "4",

}

TY - JOUR

T1 - Schreier Graphs of an Extended Version of the Binary Adding Machine

AU - D'Angeli, Daniele

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

M3 - Article

SN - 1077-8926

VL - 21

JO - The Electronic Journal of Combinatorics

JF - The Electronic Journal of Combinatorics

IS - 4

M1 - P.4.20

ER -