Abstract:Given a permutation σ on n symbols {0, 1, . . . , n − 1} and an integer 1 ≤ m ≤ n − 1, the mth contraction of σ is the permutation σ CT m on n − m symbols obtained by deleting the symbols n − 1, n − 2, . . . , n − m from the cycle decomposition of σ. The Hamming distance hd(σ, τ ) between two permutations σ and τ is the number of symbols x such that σ(x) = τ (x), and the Hamming distance of a non-empty set of permutations is the least Hamming distance among all pairs of distinct elements of the set. In this pa… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.