Antisquares and Critical Exponents
The (bitwise) complement $\overline{x}$ of a binary word $x$ is obtained by changing each $0$ in $x$ to $1$ and vice versa. An $\textit{antisquare}$ is a nonempty word of the form $x\, \overline{x}$. In this paper, we study infinite binary words that do not contain arbitrarily large antisquares. For...
Saved in:
| Main Authors: | Aseem Baranwal, James Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey Shallit |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2023-09-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | http://dmtcs.episciences.org/10063/pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Pseudoperiodic Words and a Question of Shevelev
by: Joseph Meleshko, et al.
Published: (2023-10-01) -
Contact graphs of boxes with unidirectional contacts
by: Daniel Gonçalves, et al.
Published: (2024-05-01) -
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
by: Laurent Beaudou, et al.
Published: (2024-04-01) -
Treewidth 2 in the Planar Graph Product Structure Theorem
by: Marc Distel, et al.
Published: (2025-03-01) -
Bears with Hats and Independence Polynomials
by: Václav Blažej, et al.
Published: (2023-10-01)