• 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.

Infinite words containing squares at every position

Thumbnail

View Open

Infinite words containing squares at every position.pdf (189.3Kb)

Metadata

Show full item record

Author

Currie, James
Rampersad, Narad

Uri

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

Date

2010

Doi

10.1051/ita/2010007

Citation

Currie, James, and Narad Rampersad. "Infinite words containing squares at every position." RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications 44(1) (2010): 113-124. DOI: 10.1051/ita/2010007.

Abstract

Richomme asked the following question: what is the infimum of the real numbers α > 2 such that there exists an infinite word that avoids α-powers but contains arbitrarily large squares beginning at every position? We resolve this question in the case of a binary alphabet by showing that the answer is α = 7/3.

Collections

  • James D. Currie
  • 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