Abstract
Let be the permutation on symbols defined by . We are interested in an enumerative problem on colored permutations, that is permutations of in which the numbers from 1 to are colored with colors such that two elements in a same cycle have the same color. We show that the proportion of colored permutations such that is a long cycle is given by the very simple ratio . Our proof is bijective and uses combinatorial objects such as partitioned hypermaps and thorn trees. This formula is actually equivalent to the proportionality of the number of long cycles such that has cycles and Stirling numbers of size , an unexpected connection previously found by several authors by means of algebraic methods. Moreover, our bijection allows us to refine the latter result with the cycle type of the permutations.
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.