Integer sequences and k-commuting permutations
Abstract
Let β be any permutation on n symbols and let c(k, β) be the number of permutations that k-commute with β. The cycle type of a permutation β is a vector (c1, …, cn) such that β has exactly ci cycles of length i in its disjoint cycle factorization. In this article we obtain formulas for c(k, β), 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.