Mesosome Avoidance

07/29/2021
by   Robert Cummings, et al.
0

We consider avoiding mesosomes – that is, words of the form xx' with x' a conjugate of x that is different from x – over a binary alphabet. We give a structure theorem for mesosome-avoiding words, count how many there are, characterize all the infinite mesosome-avoiding words, and determine the minimal forbidden words.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/17/2022

Natural bijections for contiguous pattern avoidance in words

Two words p and q are avoided by the same number of length-n words, for ...
research
04/19/2019

New results on pseudosquare avoidance

We start by considering binary words containing the minimum possible num...
research
02/05/2020

Avoidance of split overlaps

We generalize Axel Thue's familiar definition of overlaps in words, and ...
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
11/10/2022

Polyominoes and graphs built from Fibonacci words

We introduce the k-bonacci polyominoes, a new family of polyominoes asso...
research
11/30/2020

A Bijection Between Weighted Dyck Paths and 1234-avoiding Up-Down Permutations

Three-dimensional Catalan numbers are a variant of the classical (bidime...
research
06/12/2018

A Timed Version of the Plactic Monoid

Timed words are words where letters of the alphabet come with time stamp...

Please sign up or login with your details

Forgot password? Click here to reset