New results on pseudosquare avoidance

04/19/2019
by   Tim Ng, et al.
0

We start by considering binary words containing the minimum possible numbers of squares and antisquares (where an antisquare is a word of the form x x), and we completely classify which possibilities can occur. We consider avoiding x p(x), where p is any permutation of the underlying alphabet, and x t(x), where t is any transformation of the underlying alphabet. Finally, we prove the existence of an infinite binary word simultaneously avoiding all occurrences of x h(x) for every nonerasing morphism h and all sufficiently large words x.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/29/2021

Mesosome Avoidance

We consider avoiding mesosomes – that is, words of the form xx' with x' ...
research
07/16/2020

The Simplest Binary Word with Only Three Squares

We re-examine previous constructions of infinite binary words containing...
research
09/20/2022

Complement Avoidance in Binary Words

The complement x of a binary word x is obtained by changing each 0 in x ...
research
05/06/2020

Avoiding 5/4-powers on the alphabet of nonnegative integers

We identify the structure of the lexicographically least word avoiding 5...
research
09/19/2022

Antisquares and Critical Exponents

The complement x̅ of a binary word x is obtained by changing each 0 in x...
research
01/04/2023

Reconstructing words using queries on subwords or factors

We study word reconstruction problems. Improving a previous result by P....
research
10/04/2018

On k-Maximal Submonoids, with Applications in Combinatorics on Words

We define the notion of a k-maximal submonoid. A submonoid M is k-maxima...

Please sign up or login with your details

Forgot password? Click here to reset