[en] We identify the structure of the lexicographically least word avoiding 5/4-powers on the alphabet of nonnegative integers. Specifically, we show that this word has the form $p \tau(\varphi(z) \varphi^2(z) \cdots)$ where $p, z$ are finite words, $\varphi$ is a 6-uniform morphism, and $\tau$ is a coding. This description yields a recurrence for the $i$th letter, which we use to prove that the sequence of letters is 6-regular with rank 188. More generally, we prove $k$-regularity for a sequence satisfying a recurrence of the same type.
Disciplines :
Mathematics
Author, co-author :
Rowland, Eric; Hofstra University > Mathematics
Stipulanti, Manon ; Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes
Language :
English
Title :
Avoiding 5/4-powers on the alphabet of nonnegative integers
Publication date :
21 August 2020
Journal title :
Electronic Journal of Combinatorics
ISSN :
1097-1440
eISSN :
1077-8926
Publisher :
Electronic Journal of Combinatorics, United States - Georgia
scite shows how a scientific paper has been cited by providing the context of the citation, a classification describing whether it supports, mentions, or contrasts the cited claim, and a label indicating in which section the citation was made.
Bibliography
J.-P. Allouche, J. Currie, J. Shallit, Extremal infinite overlap-free binary words, Electron. J. Combin. 5 (1998) #R27.
J.-P. Allouche, J. Shallit, The ring of k-regular sequences, Theoret. Comput. Sci. 98 (1992) 163–197.
J.-P. Allouche, J. Shallit, Automatic Sequences: Theory, Applications, Generaliza-tions, Cambridge University Press, Cambridge, 2003.
J. P. Bell, A generalization of Cobham’s theorem for regular sequences, Sém. Lothar. Combin. 54A (2006) Article B54Ap, 15 pages.
J. Berstel, Axel Thue’s Papers on Repetitions in Words: A Translation, Publications du LaCIM 20, Université du Québec à Montréal, 1995.
J. Berstel, D. Perrin, The origins of combinatorics on words, European J. Combin. 28 (2007) 996–1022.
F. Dejean. Sur un théorème de Thue, J. Combinatorial Theory Ser. A 13 (1972) 90–99.
M. Guay-Paquet, J. Shallit, Avoiding squares and overlaps over the natural numbers, Discrete Math. 309 (2009) 6245–6254.
L. Pudwell, E. Rowland, Avoiding fractional powers over the natural numbers, Elec-tron. J. Combin. 25 (2018) #P2.27.
E. Rowland, J. Shallit, Avoiding 3/2-powers over the natural numbers, Discrete Math. 312 (2012) 1282–1288.
E. Rowland, M. Stipulanti, Avoiding 5/4-powers on the alphabet of nonnegative integers (extended abstract), Developments in Language Theory, edited by N. Jonoska and D. Savchuk, Lect. Notes in Comput. Sci. 12086 (2020) 280–293.
N. Sloane et al., The On-Line Encyclopedia of Integer Sequences, http://oeis.org.
A. Thue, Über unendliche Zeichenreihen, Norske Vid. Selsk. Skr. I Math-Nat. Kl. 7 (1906) 1–22.
A. Thue, Über die gegenseitige Loge gleicher Teile gewisser Zeichenreihen, Norske Vid. Selsk. Skr. I Math-Nat. Kl. Chris. 1 (1912) 1–67.
Similar publications
Sorry the service is unavailable at the moment. Please try again later.
This website uses cookies to improve user experience. Read more
Save & Close
Accept all
Decline all
Show detailsHide details
Cookie declaration
About cookies
Strictly necessary
Performance
Strictly necessary cookies allow core website functionality such as user login and account management. The website cannot be used properly without strictly necessary cookies.
This cookie is used by Cookie-Script.com service to remember visitor cookie consent preferences. It is necessary for Cookie-Script.com cookie banner to work properly.
Performance cookies are used to see how visitors use the website, eg. analytics cookies. Those cookies cannot be used to directly identify a certain visitor.
Used to store the attribution information, the referrer initially used to visit the website
Cookies are small text files that are placed on your computer by websites that you visit. Websites use cookies to help users navigate efficiently and perform certain functions. Cookies that are required for the website to operate properly are allowed to be set without your permission. All other cookies need to be approved before they can be set in the browser.
You can change your consent to cookie usage at any time on our Privacy Policy page.