Words that almost commute

10/03/2021
by   Daniel Gabric, et al.
0

The Hamming distance ham(u,v) between two equal-length words u, v is the number of positions where u and v differ. The words u and v are said to be conjugates if there exist non-empty words x,y such that u=xy and v=yx. The smallest value ham(xy,yx) can take on is 0, when x and y commute. But, interestingly, the next smallest value ham(xy,yx) can take on is 2 and not 1. In this paper, we consider conjugates u=xy and v=yx where ham(xy,yx)=2. More specifically, we provide an efficient formula to count the number h(n) of length-n words u=xy over a k-letter alphabet that have a conjugate v=yx such that ham(xy,yx)=2. We also provide efficient formulae for other quantities closely related to h(n). Finally, we show that there is no one easily-expressible good bound on the growth of h(n).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/20/2021

Critical factorisation in square-free words

A position p in a word w is critical if the minimal local period at p is...
research
06/09/2019

Borders, Palindrome Prefixes, and Square Prefixes

We show that the number of length-n words over a k-letter alphabet havin...
research
03/18/2018

Descent distribution on Catalan words avoiding a pattern of length at most three

Catalan words are particular growth-restricted words over the set of non...
research
09/26/2017

The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters

We prove a conjecture by Van Dam and Sotirov on the smallest eigenvalue ...
research
06/14/2021

Grammar Equations

Diagrammatically speaking, grammatical calculi such as pregroups provide...
research
02/05/2022

Logarithmic equal-letter runs for BWT of purely morphic words

In this paper we study the number r_bwt of equal-letter runs produced by...
research
07/09/2021

Adaptable and conflict colouring multigraphs with no cycles of length three or four

The adaptable choosability of a multigraph G, denoted ch_a(G), is the sm...

Please sign up or login with your details

Forgot password? Click here to reset