Characterization of the allowed patterns of signed shifts
From MaRDI portal
Publication:516799
DOI10.1016/J.DAM.2016.08.014zbMATH Open1358.05004OpenAlexW2963703100MaRDI QIDQ516799FDOQ516799
Authors: Kassie Archer 
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.08.014
Recommendations
Cites Work
- DETECTING DETERMINISM IN TIME SERIES WITH ORDINAL PATTERNS: A COMPARATIVE STUDY
- Entropy of interval maps via permutations
- Permutation complexity in dynamical systems. Ordinal patterns, permutation entropy and all that
- Counting permutations with given cycle structure and descent set
- On permutations generated by infinite binary words
- Cyclic permutations realized by signed shifts
- Descent sets of cyclic permutations
- On periodicity and low complexity of infinite permutations
- Patterns of negative shifts and signed shifts
- On basic forbidden patterns of functions
- Forbidden patterns and shift systems
- The number of permutations realized by a shift
- The ordinal structure of the signed shift transformations
- Permutations and \(\beta \)-shifts
Cited In (7)
- MINIMAL FORBIDDEN PATTERNS OF MULTI-DIMENSIONAL SHIFTS
- Patterns of negative shifts and signed shifts
- The number of permutations realized by a shift
- Periodic patterns of signed shifts
- Allowed patterns of symmetric tent maps via commuter functions
- On basic forbidden patterns of functions
- Characterizations and enumerations of patterns of signed shifts
This page was built for publication: Characterization of the allowed patterns of signed shifts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q516799)
