Characterizations and enumerations of patterns of signed shifts
From MaRDI portal
Publication:2306587
Abstract: Signed shifts are generalizations of the shift map in which, interpreted as a map from the unit interval to itself sending x to the fractional part of Nx, some slopes are allowed to be negative. Permutations realized by the relative order of the elements in the orbits of these maps have been studied recently by Amigo, Archer and Elizalde. In this paper, we give a complete characterization of the permutations (also called patterns) realized by signed shifts. In the case of the negative shift, which is the signed shift having only negative slopes, we use the characterization to give an exact enumeration of these patterns. Finally, we improve the best known bounds for the number of patterns realized by the tent map, and calculate the topological entropy of signed shifts using these combinatorial methods.
Recommendations
Cites work
- Allowed patterns of symmetric tent maps via commuter functions
- Characterization of the allowed patterns of signed shifts
- Cyclic permutations realized by signed shifts
- Entropy of interval maps via permutations
- Entropy of piecewise monotone mappings
- On basic forbidden patterns of functions
- Patterns of negative shifts and signed shifts
- Permutation complexity in dynamical systems. Ordinal patterns, permutation entropy and all that
- Permutations and \(\beta \)-shifts
- Permutations and negative beta-shifts
- The number of permutations realized by a shift
- The ordinal structure of the signed shift transformations
Cited in
(5)
This page was built for publication: Characterizations and enumerations of patterns of signed shifts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2306587)