Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. N. Livshits, “A method of proving topological mixing for a certain class of substitutions,” Preprint POMI, P-10-91 (1991).
A. N. Livshits, “Some properties of substitutional dynamical systems,” Preprint POMI, 13/1994 (1994).
A. N. Livshits, “On the limit distributions and asymptotics of extremal values for some sequences of random variables,”Zap. Nauchn. Semin. POMI,216, 86–103 (1994).
F. M. Dekking and M. Keane, “Mixing properties of substitutions,”ZFW,B.42,H.1, 375–389 (1978).
A. N. Livshits, “A sufficient condition for weak mixing of substitutions and stationary adic transformations,”Mat. Zametki,446, 785–793 (1988).
A. N. Livshits, “On some properties of decoding for primitive substitutions,”Zap. Nauchn. Semin. POMI,223, 127–136 (1995).
Additional information
Published inZapiski Nauchnykh Seminarov POMI, Vol. 240, 1997, pp. 147–153.
Rights and permissions
About this article
Cite this article
Livshits, A.N. Some applications of computers to the investigation of substitutional dynamical systems. J Math Sci 96, 3537–3541 (1999). https://doi.org/10.1007/BF02175832
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02175832