Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
An infinite permutation can be defined as a linear ordering of the set of natural numbers. In particular, an infinite permutation can be constructed with an aperiodic infinite word over {0, . . . , q −1} as the lexicographic order of the shifts of the word. In this paper, we discuss the question if an infinite permutation defined this way admits a canonical representative, that is, can be defined by a sequence of numbers from [0, 1], such that the frequency of its elements in any interval is equal to the length of that interval. We show that a canonical representative exists if and only if the word is uniquely ergodic, and that is why we use the term ergodic permutations. We also discuss ways to construct the canonical representative of a permutation defined by a morphic word and generalize the construction of Makarov, 2009, for the Thue-Morse permutation to a wider class of infinite words.
| Original language | English |
|---|---|
| Title of host publication | Combinatorics on Words - 10th International Conference, WORDS 2015, Proceedings |
| Editors | Dirk Nowotka, Florin Manea |
| Publisher | Springer Nature |
| Pages | 59-72 |
| Number of pages | 14 |
| ISBN (Print) | 9783319236599 |
| DOIs | |
| State | Published - 1 Jan 2015 |
| Event | 10th International Conference on Words, WORDS 2015 - Kiel, Germany Duration: 14 Sep 2015 → 17 Sep 2015 |
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 9304 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
| Conference | 10th International Conference on Words, WORDS 2015 |
|---|---|
| Country/Territory | Germany |
| City | Kiel |
| Period | 14/09/15 → 17/09/15 |
ID: 35285011