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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.