{"docId":6519,"paperId":6204,"url":"https:\/\/dmtcs.episciences.org\/6204","doi":"10.23638\/DMTCS-22-1-20","journalName":"Discrete Mathematics & Theoretical Computer Science","issn":"","eissn":"1365-8050","volume":[{"vid":372,"name":"vol. 22 no. 1"}],"section":[{"sid":6,"title":"Combinatorics","description":[]}],"repositoryName":"arXiv","repositoryIdentifier":"2003.06916","repositoryVersion":3,"repositoryLink":"https:\/\/arxiv.org\/abs\/2003.06916v3","dateSubmitted":"2020-03-17 15:50:08","dateAccepted":"2020-06-06 13:59:27","datePublished":"2020-06-06 13:59:49","titles":["Complementary symmetric Rote sequences: the critical exponent and the recurrence function"],"authors":["Dvo\u0159\u00e1kov\u00e1, Lubom\u00edra","Medkov\u00e1, Kate\u0159ina","Pelantov\u00e1, Edita"],"abstracts":["We determine the critical exponent and the recurrence function of complementary symmetric Rote sequences. The formulae are expressed in terms of the continued fraction expansions associated with the S-adic representations of the corresponding standard Sturmian sequences. The results are based on a thorough study of return words to bispecial factors of Sturmian sequences. Using the formula for the critical exponent, we describe all complementary symmetric Rote sequences with the critical exponent less than or equal to 3, and we show that there are uncountably many complementary symmetric Rote sequences with the critical exponent less than the critical exponent of the Fibonacci sequence. Our study is motivated by a~conjecture on sequences rich in palindromes formulated by Baranwal and Shallit. Its recent solution by Curie, Mol, and Rampersad uses two particular complementary symmetric Rote sequences.","Comment: 33 pages"],"keywords":["Mathematics - Combinatorics","68R15"]}