Transition matrices characterizing a certain totally discontinuous map of the interval (Q739525): Difference between revisions

The authors characterize a discrete dynamical system defined by an iterated interval map which is totally discontinuous (i.e., an existing Markov partition must be infinite with infinite corresponding transition matrix). In order to overcome the infinite dimensional problem, the transition matrix is approximated by a sequence of increasing finite dimensional matrices. Towards the construction of such sequence, the authors consider a family of partitions of the interval \([0, 1]\) obtained by consecutive refinements according to some rule based on the binary expansion of real numbers. In each partition, the effect of the interval map is codified by a transition matrix that approximates the original transition. The main results of the paper are related to recursive algorithms involved in the construction of the sequence of transition matrices, and in the computation of the eigenvalues of these matrices and their left and right eigenvectors. This information is important for the characterization of the dynamical and ergodic properties of the dynamical system. This can be used to determine invariant measures defined on invariant subspaces which will be addressed in a forthcoming paper. The authors in the last paragraph of the introduction give a clear outline of the paper and a brief description of the content of each section.