The cycle structure of compositions of random involutions

Details The cycle structure of compositions of random involutions The cycle structure of compositions of random involutions

2009-11-18

arxiv.org/abs/0911.3604v1

Mathematics

Combinatorics

17 pages

Scientific paper

In this article we consider the cycle structure of compositions of pairs of involutions in the symmetric group S_n chosen uniformly at random. These can be modeled as modified 2-regular graphs, giving rise to exponential generating functions. A composition of two random involutions in S_n typically has about n^(1/2) cycles, and the cycles are characteristically of length n^(1/2). Compositions of two random fixed-point-free involutions, on the other hand, typically have about log n cycles and are closely related to permutations with all cycle lengths even. The number of factorizations of a random permutation into two involutions appears to be asymptotically lognormally distributed, which we prove for a closely related probabilistic model. This study is motivated by the observation that the number of involutions in [n] is (n!)^(1/2) times a subexponential factor; more generally the number of permutations with all cycle lengths in a finite set S is n!^(1-1/m) times a subexponential factor, and the typical number of k-cycles is nearly n^(k/m)/k. Connections to pattern avoidance in involutions are also considered.

Affiliated with

Also associated with

No associations

Rating

The cycle structure of compositions of random involutions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The cycle structure of compositions of random involutions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The cycle structure of compositions of random involutions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-241695