Blocks in cycles and k-commuting permutations
arXiv:1306.5708 · doi:10.1186/s40064-016-3638-7
Abstract
Let be a nonnegative integer, and let and be two permutations of symbols. We say that and -commute if , where denotes the Hamming metric between permutations. In this paper, we consider the problem of finding the permutations that -commute with a given permutation. Our main result is a characterization of permutations that -commute with a given permutation in terms of blocks in cycles in the decomposition of as a product of disjoint cycles. Using this characterization, we provide formulas for the number of permutations that -commute with a transposition, a fixed-point free involution and an -cycle, for any . Also, we determine the number of permutations that -commute with any given permutation, for .
arXiv comment25 pages. v3 is a major revision
References in corpus (7)
- Almost commuting permutations are near commuting permutations
- Making Almost Commuting Matrices Commute
- Almost commuting matrices with respect to normalized Hilbert-Schmidt norm
- A Hilbert-Schmidt analog of Huaxin Lin's Theorem
- Convex Structures Revisited
- Blocks in cycles and k-commuting permutations
- Polynomial sequences on quadratic curves