arXiv Analytics

Sign in

arXiv:1306.5708 [math.CO]AbstractReferencesReviewsResources

Blocks in cycles and k-commuting permutations

Rutilo Moreno, Luis Manuel Rivera

Published 2013-06-24, updated 2014-08-18Version 3

Let $k$ be a nonnegative integer, and let $\alpha$ and $\beta$ be two permutations of $n$ symbols. We say that $\alpha$ and $\beta$ $k$-commute if $H(\alpha\beta, \beta\alpha)=k$, where $H$ denotes the Hamming metric between permutations. In this paper, we consider the problem of finding the permutations that $k$-commute with a given permutation. Our main result is a characterization of permutations that $k$-commute with a given permutation $\beta$ in terms of blocks in cycles in the decomposition of $\beta$ as a product of disjoint cycles. Using this characterization, we provide formulas for the number of permutations that $k$-commute with a transposition, a fixed-point free involution and an $n$-cycle, for any $k$. Also, we determine the number of permutations that $k$-commute with any given permutation, for $k \leq 4$.

Comments: 25 pages. v3 is a major revision
Categories: math.CO
Subjects: 05A05, 05A15, 20B30
Related articles: Most relevant | Search more
arXiv:1611.03241 [math.CO] (Published 2016-11-10)
A characterization of Tutte-Coxeter graph
arXiv:0812.2300 [math.CO] (Published 2008-12-12)
A characterization of well-founded algebraic lattices
arXiv:1507.06800 [math.CO] (Published 2015-07-24)
The Characterization of planar, 4-connected, K_{2,5}-minor-free graphs