Permutation complexity of the fixed points of some uniform binary morphisms
Discrete Mathematics
2011-08-19 v1
Abstract
An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.
Cite
@article{arxiv.1108.3641,
title = {Permutation complexity of the fixed points of some uniform binary morphisms},
author = {Alexander Valyuzhenich},
journal= {arXiv preprint arXiv:1108.3641},
year = {2011}
}
Comments
In Proceedings WORDS 2011, arXiv:1108.3412