Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Canonical representatives of morphic permutations. / Avgustinovich, Sergey V.; Frid, Anna E.; Puzynina, Svetlana.
Combinatorics on Words - 10th International Conference, WORDS 2015, Proceedings. ed. / Dirk Nowotka; Florin Manea. Springer Nature, 2015. p. 59-72 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9304).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
}
TY - GEN
T1 - Canonical representatives of morphic permutations
AU - Avgustinovich, Sergey V.
AU - Frid, Anna E.
AU - Puzynina, Svetlana
PY - 2015/1/1
Y1 - 2015/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84945979281&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-23660-5_6
DO - 10.1007/978-3-319-23660-5_6
M3 - Conference contribution
AN - SCOPUS:84945979281
SN - 9783319236599
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 59
EP - 72
BT - Combinatorics on Words - 10th International Conference, WORDS 2015, Proceedings
A2 - Nowotka, Dirk
A2 - Manea, Florin
PB - Springer Nature
T2 - 10th International Conference on Words, WORDS 2015
Y2 - 14 September 2015 through 17 September 2015
ER -
ID: 35285011