arXiv Analytics

Sign in

arXiv:1406.3081 [math.CO]AbstractReferencesReviewsResources

Integer sequences and k-commuting permutations

Luis Manuel Rivera

Published 2014-06-11, updated 2015-03-29Version 3

Let $\beta$ be any permutation on $n$ symbols and let $c(k, \beta)$ be the number of permutations that $k$-commute with $\beta$. The cycle type of a permutation $\beta$ is a vector $(c_1, \dots, c_n)$ such that $\beta$ has exactly $c_i$ cycles of length $i$ in its disjoint cycle factorization. In this article we obtain formulas for $c(k, \beta)$, 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.

Comments: 20 pages, 8 tables. In the second version some paragraphs and proofs were rewritten. V3 is a revised version, one reference added
Categories: math.CO
Subjects: 05A05, 05A15, 11B99
Related articles: Most relevant | Search more
arXiv:1306.5708 [math.CO] (Published 2013-06-24, updated 2014-08-18)
Blocks in cycles and k-commuting permutations
arXiv:math/0312448 [math.CO] (Published 2003-12-24)
The On-Line Encyclopedia of Integer Sequences
arXiv:1805.10343 [math.CO] (Published 2018-05-25)
The On-Line Encyclopedia of Integer Sequences