|
Sibirskii Matematicheskii Zhurnal, 2009, Volume 50, Number 4, Pages 850–857
(Mi smj2007)
|
|
|
|
This article is cited in 17 scientific papers (total in 17 papers)
On the permutations generated by Sturmian words
M. A. Makarov Novosibirsk State University, Faculty of Mechanics and Mathematics, Novosibirsk
Abstract:
Infinite permutations of use in this article were introduced in [1]. Here we distinguish the class of infinite permutations that are generated by the Sturmian words and inherit their properties. We find the combinatorial complexity of these permutations, describe their Rauzy graphs, frequencies of subpermutations, and recurrence functions. We also find their arithmetic complexity and Kamae complexity.
Keywords:
infinite permutation, Sturmian word, combinatorial complexity, Rauzy graph, arithmetic complexity, Kamae complexity.
Received: 26.11.2007
Citation:
M. A. Makarov, “On the permutations generated by Sturmian words”, Sibirsk. Mat. Zh., 50:4 (2009), 850–857; Siberian Math. J., 50:4 (2009), 674–680
Linking options:
https://www.mathnet.ru/eng/smj2007 https://www.mathnet.ru/eng/smj/v50/i4/p850
|
Statistics & downloads: |
Abstract page: | 344 | Full-text PDF : | 105 | References: | 56 | First page: | 7 |
|