Integer sequences and k-commuting permutations
Combinatorics
2015-12-01 v4
Abstract
Let be any permutation on symbols and let be the number of permutations that -commute with . The cycle type of a permutation is a vector such that has exactly cycles of length in its disjoint cycle factorization. In this article we obtain formulas for , for some cycle types. We also express these formulas in terms of integer sequences as given in "The On-line Encyclopedia of Integer Sequences" (OEIS). For some of these sequences we obtain either new interpretations or relationships with sequences in the OEIS database.
Cite
@article{arxiv.1406.3081,
title = {Integer sequences and k-commuting permutations},
author = {Luis Manuel Rivera},
journal= {arXiv preprint arXiv:1406.3081},
year = {2015}
}
Comments
20 pages, 8 tables. In the second version some paragraphs and proofs were rewritten. V3 is a revised version, one reference added. V4 is the published version