SciELO - Scientific Electronic Library Online

 
vol.37 issue3Properly efficient solutions to non-differentiable multiobjective optimization problemsOn multiset group author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • On index processCited by Google
  • Have no similar articlesSimilars in SciELO
  • On index processSimilars in Google

Share


Proyecciones (Antofagasta)

Print version ISSN 0716-0917

Abstract

ARANZUBIA, Solange; CARVAJAL, Rubén  and  LABARCA, Rafael. A computer verification for the value of the Topological Entropy for some special subshifts in the Lexicographical Scenario. Proyecciones (Antofagasta) [online]. 2018, vol.37, n.3, pp.439-477. ISSN 0716-0917.  http://dx.doi.org/10.4067/S0716-09172018000300439.

The Lorenz Attractor has been a source for many mathematical studies. Most of them deal with lower dimensional representations of its first return map. An one dimensional scenario can be modeled by the standard two parameter family of contracting Lorenz maps. The dynamics, in this case, can be modeled by a subshift in the Lexicographical model. The Lexicographical model is the set of two symbols with the topology induced by the lexicographical metric and with the lexicographical order. These subshifts are the maximal invariant set for the shift map in some interval. For some of them, the extremes of the interval are a minimal periodic sequence and a maximal periodic sequence which is an iteration of the lower extreme (by the shift map). For some of these subshifts the topological entropy is zero. In this case the dynamics (of the respective Lorenz map) is simple.Associated to any of these subshifts (let call it Λ) we consider an extension (let call it Γ) that contains Λ which also can be constructed by using an interval whose extremes can be defined by the extremes of Λ. For these extensions we present here a computer verification of the result that compute its topological entropy. As a consequence, of our results, we can say: the longer the period of the periodic sequence is then the lower complexity in the dynamics of the extension the associated map has.

Keywords : Lexicographical world; topological entropy; maximal and minimal sequences; shift map; Lorenz Maps..

        · text in English     · English ( pdf )