Some applications of computer to investigation of substitutional dynamical systems
Zapiski Nauchnykh Seminarov POMI, Representation theory, dynamical systems, combinatorial and algoritmic methods. Part II, Tome 240 (1997), pp. 147-153
Voir la notice de l'article provenant de la source Math-Net.Ru
A new sufficient condition for topological mixing of a permutational dynamical system is given. Using a
computer, it was verified for a system studied earlier by other methods. For a permutation that does not
satisfy the above sufficient condition, topological mixing is proved by a rather general method of recurrence
relations. The formulas expressing these relations are written by a computer.
@article{ZNSL_1997_240_a10,
author = {A. N. Livshits},
title = {Some applications of computer to investigation of substitutional dynamical systems},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {147--153},
publisher = {mathdoc},
volume = {240},
year = {1997},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ZNSL_1997_240_a10/}
}
A. N. Livshits. Some applications of computer to investigation of substitutional dynamical systems. Zapiski Nauchnykh Seminarov POMI, Representation theory, dynamical systems, combinatorial and algoritmic methods. Part II, Tome 240 (1997), pp. 147-153. http://geodesic.mathdoc.fr/item/ZNSL_1997_240_a10/