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

Cyclic Complexity of Some Infinite Words and Generalizations

Thumbnail

View Open

Cyclic Complexity of Some Infinite Words and Generalizations.pdf (1.195Mb)

Metadata

Show full item record

Author

Krawchuk, Colin
Rampersad, Narad

Uri

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

Date

2018-03

Citation

Colin Krawchuk, Narad Rampersad, “Cyclic Complexity of Some Infinite Words and Generalizations,” Integers 18A (2018), #A12.

Abstract

Cassaigne et al. introduced the cyclic complexity function c_x(n), which gives the number of cyclic conjugacy classes of length-n factors of a word x. We study the behavior of this function for the Fibonacci word f and the Thue–Morse word t. If φ = (1 + √5)/2, we show that lim sup_{n → 1} c_f(n)/n ≥ 2/φ² and conjecture that equality holds. Similarly, we show that lim sup_{n → 1} c_t(n)/n ≥ 2 and conjecture that equality holds. We also propose a generalization of the cyclic complexity function and suggest some directions for further investigation. Most results are obtained by computer proofs using Mousavi’s Walnut software.

Collections

  • Colin Krawchuk
  • Narad Rampersad

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