• English
    • français
  • English 
    • English
    • français
View Item 
  •   WinnSpace Home
  • Department of Mathematics and Statistics
  • James D. Currie
  • View Item
  •   WinnSpace Home
  • Department of Mathematics and Statistics
  • James D. Currie
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Abelian complexity of fixed point of morphism 0 -> 012, 1 -> 02, 2 -> 1

Thumbnail

View Open

o11.pdf (445.5Kb)

Metadata

Show full item record

Author

Currie, James D.
Blanchet-Sadri, Francine
Fox, Nathan
Rampersad, Narad

Uri

http://hdl.handle.net/10680/1759

Date

2016-02-14

Doi

math.colgate.edu/~integers/vol14.html

Citation

Electronic Journal of Combinatorial Number Theory 14 (2014), A11

Abstract

We study the combinatorics of vtm, a variant of the Thue-Morse word generated by the non-uniform morphism 0 -> 012,1 -> 02,2 -> 1 starting with 0. This infinite ternary sequence appears a lot in the literature and finds applications in several fields such as combinatorics on words; for example, in pattern avoidance it is often used to construct infinite words avoiding given patterns. It has been shown that the factor complexity of vtm, i.e., the number of factors of length n, is \Theta(n); in fact, it is bounded by 10/3 n for all n, and it reaches that bound precisely when n can be written as 3 times a power of 2. In this paper, we show that the abelian complexity of vtm, i.e., the number of Parikh vectors of length n, is O(logn) with constant approaching 3/4 (assuming base 2 logarithm), and it is \Omega(1) with constant 3 (and these are the best possible bounds). We also prove some results regarding factor indices in vtm.

Collections

  • James D. Currie

Report a copyright concern

Contact Us | Send Feedback
 

 

Browse

All of WinnSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister

Report a copyright concern

Contact Us | Send Feedback