English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The \emph{Hamming distance} $\text{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 \emph{conjugates} if there exist non-empty words $x,y$ suchthat $u=xy$ and $v=yx$. The smallest value $\text{ham}(xy,yx)$ can take on is$0$, when $x$ and $y$ commute. But, interestingly, the next smallest value$\text{ham}(xy,yx)$ can take on is $2$ and not $1$. In this paper, we considerconjugates $u=xy$ and $v=yx$ where $\text{ham}(xy,yx)=2$. More specifically, weprovide 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$\text{ham}(xy,yx)=2$. We also provide efficient formulae for other quantitiesclosely related to $h(n)$. Finally, we show that there is no oneeasily-expressible good bound on the growth of $h(n)$.

Words that almost commute