Renormalization towers and their forcing

From MaRDI portal
Publication:5243124




Abstract: A cyclic permutation pi:1,dots,No1,dots,N has a emph{block structure} if there is a partition of 1,dots,N into kotin1,N segments (emph{blocks}) permuted by pi; call k the emph{period} of this block structure. Let p1<dots<ps be periods of all possible block structures on pi. Call the finite string (p1/1, p2/p1, dots, ps/ps1,N/ps) the {it renormalization tower of pi}. The same terminology can be used for emph{patterns}, i.e., for families of cycles of interval maps inducing the same (up to a flip) cyclic permutation. A renormalization tower mathcalM emph{forces} a renormalization tower mathcalN if every continuous interval map with a cycle of pattern with renormalization tower mathcalM must have a cycle of pattern with renormalization tower mathcalN. We completely characterize the forcing relation among renormalization towers. Take the following order among natural numbers: 4gg6gg3ggdotsgg4ngg4n+2gg2n+1ggdotsgg2gg1 understood in the strict sense. We show that the forcing relation among renormalization towers is given by the lexicographic extension of this order. Moreover, for any tail T of this order there exists an interval map for which the set of renormalization towers of its cycles equals T.









This page was built for publication: Renormalization towers and their forcing

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