Self-similar groups and the zig-zag and replacement products of graphs

Abstract: Every finitely generated self-similar group naturally produces an infinite sequence of finite

d

-regular graphs

G a m m a_{n}

. We construct self-similar groups, whose graphs

G a m m a_{n}

can be represented as an iterated zig-zag product and graph powering:

z

(

k g e q 1

). Also we construct self-similar groups, whose graphs

G a m m a_{n}

can be represented as an iterated replacement product and graph powering:

r

(

k g e q 1

). This gives simple explicit examples of self-similar groups, whose graphs

G a m m a_{n}

form an expanding family, and examples of automaton groups, whose graphs

G a m m a_{n}

have linear diameters

m d i a m (G a m m a_{n}) = O (n)

and bounded girth.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: Self-similar groups and the zig-zag and replacement products of graphs