The Simplest Binary Word with Only Three Squares

07/16/2020
by   Daniel Gabric, et al.
0

We re-examine previous constructions of infinite binary words containing few distinct squares with the goal of finding the "simplest", in a certain sense. We exhibit several new constructions. Rather than using tedious case-based arguments to prove that the constructions have the desired property, we rely instead on theorem-proving software for their correctness.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/19/2019

New results on pseudosquare avoidance

We start by considering binary words containing the minimum possible num...
research
08/10/2021

A Note on Squares in Binary Words

We consider words over a binary alphabet. A word w is overlap-free if it...
research
06/24/2020

Lyndon Words, the Three Squares Lemma, and Primitive Squares

We revisit the so-called "Three Squares Lemma" by Crochemore and Rytter ...
research
06/24/2023

Unsupervised Mapping of Arguments of Deverbal Nouns to Their Corresponding Verbal Labels

Deverbal nouns are nominal forms of verbs commonly used in written Engli...
research
04/25/2022

Strongly Aperiodic SFTs on Generalized Baumslag-Solitar groups

We look at constructions of aperiodic SFTs on fundamental groups of grap...
research
05/04/2020

Investigating the discrepancy property of de Bruijn sequences

The discrepancy of a binary string refers to the maximum (absolute) diff...
research
03/11/2019

How far away must forced letters be so that squares are still avoidable?

We describe a new non-constructive technique to show that squares are av...

Please sign up or login with your details

Forgot password? Click here to reset