Fibonacci-like sequences and shift spaces in symbolic dynamics

MaRDI QIDQ6206643zbMATH OpenFDO

Publication date 31 August 2007

Statistics (62-XX) Topological dynamics (37Bxx) Dynamical systems and ergodic theory (37-XX) Sequences and sets (11Bxx) Combinatorics (05-XX) Difference and functional equations (39-XX) Sequences, series, summability (40-XX)

Abstract: We afford the problem of counting the blocks of a given length made with symbols drawn from an alphabet and relate this number to Fibonacci-like recurrent relations. The recurrence polynomia allows to calculate the limit ratio of two adjacent terms and this information is used to determine the topological entropy of a discrete numbers of associate shift spaces. We then describe a scheme to build a shift space with a pre-selected entropy.

This page was built for publication: Fibonacci-like sequences and shift spaces in symbolic dynamics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6206643)