Permutations realized by shifts
A permutation $\pi$ is realized by the shift on $N$ symbols if there is an infinite word on an $N$-letter alphabet whose successive left shifts by one position are lexicographically in the same relative order as $\pi$. The set of realized permutations is closed under consecutive pattern containment....
| 主要作者: | |
|---|---|
| 格式: | 文件 |
| 语言: | English |
| 出版: |
Discrete Mathematics & Theoretical Computer Science
2009-01-01
|
| 丛编: | Discrete Mathematics & Theoretical Computer Science |
| 主题: | |
| 在线阅读: | https://dmtcs.episciences.org/2745/pdf |