paper

On words that nearly -commute

arXiv:2607.03096

Abstract

The Hamming distance between two equal length words is the number of positions where and differ. For and antimorphic involution , -commutes with , if the Hamming distance between and is zero. When the Hamming distance between and attains its minimum non-zero value of one, then we say nearly -commutes with . This manuscript investigates properties of and such that the Hamming distance between and is one. We provide a complete characterization of such and . We introduce a binary relation on , where holds if and only if nearly -commutes with . Finally, for a given , we collect all such that nearly -commutes with , and discuss various properties of this set.

On words that nearly $θ$-commute · wovepaper