Fibonacci-like sequences and shift spaces in symbolic dynamics

Simple item page
dc.creatorTonelli, R.
dc.date2007-08-31
dc.date.accessioned2026-07-07T08:26:54Z
dc.date.available2026-07-07T08:26:54Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0708.4370
dc.identifierhttp://arxiv.org/abs/0708.4370
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/137101
dc.subjectDynamical Systems
dc.subject05-(C38,A15), 11B-(37, 39, 50), 37B-(10, 40, 50), 62-(P35, D05)
dc.titleFibonacci-like sequences and shift spaces in symbolic dynamics
dc.typetext

Files

Collections

arXiv