Permutation complexity of images of Sturmian words by marked morphisms

zbMATH Open1402.68144arXiv1710.08820MaRDI QIDQ4560244FDOQ4560244

Authors: Adam Borchert, Narad Rampersad 

Publication date: 10 December 2018

Abstract: We show that the permutation complexity of the image of a Sturmian word by a binary marked morphism is $n+k$ for some constant $k$ and all lengths $n$ sufficiently large.

Full work available at URL: https://arxiv.org/abs/1710.08820

Recommendations

• On the permutations generated by Sturmian words
• Permutation complexity and the letter doubling map
• Permutation complexity of the fixed points of some uniform binary morphisms
• Permutation complexity related to the letter doubling map
• Infinite permutations of lowest maximal pattern complexity

zbMATH Keywords

Sturmian wordspermutation complexitymarked morphisms

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cited In (3)

• On the permutations generated by Sturmian words
• Morphic words and equidistributed sequences
• Title not available (Why is that?)

This page was built for publication: Permutation complexity of images of Sturmian words by marked morphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4560244)