Antisquares and Critical Exponents - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Preprints, Working Papers, ... Year : 2023

Antisquares and Critical Exponents

Aseem Baranwal
  • Function : Author
  • PersonId : 1171991
James Currie
  • Function : Author
  • PersonId : 1171992
Lucas Mol
  • Function : Author
  • PersonId : 1171993
Pascal Ochem
Narad Rampersad
  • Function : Author
  • PersonId : 1171994
Jeffrey Shallit

Abstract

The complement $\bar{x}$ of a binary word $x$ is obtained by changing each $0$ in $x$ to $1$ and vice versa. An antisquare is a nonempty word of the form $x\, \bar{x}$. In this paper, we study infinite binary words that do not contain arbitrarily large antisquares. For example, we show that the repetition threshold for the language of infinite binary words containing exactly two distinct antisquares is $(5+\sqrt{5})/2$. We also study repetition thresholds for related classes, where "two" in the previous sentence is replaced by a large number. We say a binary word is good if the only antisquares it contains are $01$ and $10$. We characterize the minimal antisquares, that is, those words that are antisquares but all proper factors are good. We determine the the growth rate of the number of good words of length $n$ and determine the repetition threshold between polynomial and exponential growth for the number of good words.
Fichier principal
Vignette du fichier
2209.09223.pdf (462.82 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-03799689 , version 1 (17-10-2023)

Licence

Attribution

Identifiers

Cite

Aseem Baranwal, James Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, et al.. Antisquares and Critical Exponents. 2023. ⟨lirmm-03799689⟩
16 View
3 Download

Altmetric

Share

Gmail Facebook X LinkedIn More