Online Library TheLib.net » Cyclic Renormalization and Automorphism Groups of Rooted Trees
cover of the book Cyclic Renormalization and Automorphism Groups of Rooted Trees

Ebook: Cyclic Renormalization and Automorphism Groups of Rooted Trees

00
26.01.2024
0
0

The theme of the monograph is an interplay between dynamical systems and group theory. The authors formalize and study "cyclic renormalization", a phenomenon which appears naturally for some interval dynamical systems. A possibly infinite hierarchy of such renormalizations is naturally represented by a rooted tree, together with a "spherically transitive" automorphism; the infinite case corresponds to maps with an invariant Cantor set, a class of particular interest for its relevance to the description of the transition to chaos and of the Mandelbrot set. The normal subgroup structure of the automorphism group of such "spherically homogeneous" rooted trees is investigated in some detail. This work will be of interest to researchers in both dynamical systems and group theory.




The theme of the monograph is an interplay between dynamical systems and group theory. The authors formalize and study "cyclic renormalization", a phenomenon which appears naturally for some interval dynamical systems. A possibly infinite hierarchy of such renormalizations is naturally represented by a rooted tree, together with a "spherically transitive" automorphism; the infinite case corresponds to maps with an invariant Cantor set, a class of particular interest for its relevance to the description of the transition to chaos and of the Mandelbrot set. The normal subgroup structure of the automorphism group of such "spherically homogeneous" rooted trees is investigated in some detail. This work will be of interest to researchers in both dynamical systems and group theory.
Download the book Cyclic Renormalization and Automorphism Groups of Rooted Trees for free or read online
Read Download
Continue reading on any device:
QR code
Last viewed books
Related books
Comments (0)
reload, if the code cannot be seen