scholarly journals The smallest Mealy automaton of intermediate growth

2006 ◽  
Vol 295 (2) ◽  
pp. 387-414 ◽  
Author(s):  
L. Bartholdi ◽  
I.I. Reznykov ◽  
V.I. Sushchansky
Entropy ◽  
2021 ◽  
Vol 23 (2) ◽  
pp. 237
Author(s):  
Rostislav Grigorchuk ◽  
Supun Samarakoon

Fractal groups (also called self-similar groups) is the class of groups discovered by the first author in the 1980s with the purpose of solving some famous problems in mathematics, including the question of raising to von Neumann about non-elementary amenability (in the association with studies around the Banach-Tarski Paradox) and John Milnor’s question on the existence of groups of intermediate growth between polynomial and exponential. Fractal groups arise in various fields of mathematics, including the theory of random walks, holomorphic dynamics, automata theory, operator algebras, etc. They have relations to the theory of chaos, quasi-crystals, fractals, and random Schrödinger operators. One important development is the relation of fractal groups to multi-dimensional dynamics, the theory of joint spectrum of pencil of operators, and the spectral theory of Laplace operator on graphs. This paper gives a quick access to these topics, provides calculation and analysis of multi-dimensional rational maps arising via the Schur complement in some important examples, including the first group of intermediate growth and its overgroup, contains a discussion of the dichotomy “integrable-chaotic” in the considered model, and suggests a possible probabilistic approach to studying the discussed problems.


2001 ◽  
Vol 235 (2) ◽  
pp. 484-546 ◽  
Author(s):  
L.M Shneerson

2007 ◽  
Vol 86 (10) ◽  
pp. 2162-2171 ◽  
Author(s):  
G. Lopez ◽  
K. de Lange ◽  
S. Leeson

1999 ◽  
Vol 215 (1-2) ◽  
pp. 325-327 ◽  
Author(s):  
R.I. Grigorchuk ◽  
A. Machí
Keyword(s):  

2018 ◽  
Vol 74 (2) ◽  
pp. I_342-I_347
Author(s):  
Masami OHASHI ◽  
Rumiko KAJIHARA ◽  
Toshiaki ITO ◽  
Yuji ANAGUCHI ◽  
Masaki KATAYAMA ◽  
...  

Author(s):  
Jérémie Brieussel ◽  
Thibault Godin ◽  
Bijan Mohammadi

The growth of a finitely generated group is an important geometric invariant which has been studied for decades. It can be either polynomial, for a well-understood class of groups, or exponential, for most groups studied by geometers, or intermediate, that is between polynomial and exponential. Despite recent spectacular progresses, the class of groups with intermediate growth remains largely mysterious. Many examples of such groups are constructed using Mealy automata. The aim of this paper is to give an algorithmic procedure to study the growth of such automaton groups, and more precisely to provide numerical upper bounds on their exponents. Our functions retrieve known optimal bounds on the famous first Grigorchuk group. They also improve known upper bounds on other automaton groups and permitted us to discover several new examples of automaton groups of intermediate growth. All the algorithms described are implemented in GAP, a language dedicated to computational group theory.


2012 ◽  
Vol 33 (7) ◽  
pp. 1408-1421 ◽  
Author(s):  
Ievgen Bondarenko ◽  
Tullio Ceccherini-Silberstein ◽  
Alfredo Donno ◽  
Volodymyr Nekrashevych

2017 ◽  
Vol 27 (04) ◽  
pp. 391-401 ◽  
Author(s):  
Dilber Koçak

For any integer [Formula: see text], we construct examples of finitely presented associative algebras over a field of characteristic [Formula: see text] with intermediate growth of type [Formula: see text]. We produce these examples by computing the growth types of some finitely presented metabelian Lie algebras.


Sign in / Sign up

Export Citation Format

Share Document