Using recurrence relations to count in symmetric groups

TL;DR

This paper develops recurrence relations for counting specific subsets of symmetric groups using conjugacy properties, providing closed-form solutions for probabilities related to cycle structures.

Contribution

It introduces a novel method leveraging conjugacy in symmetric groups to derive recurrence relations for enumeration problems.

Findings

Derived recurrence relations for subsets of $S_n$

Obtained closed-form probability formulas for cycle structures

Enhanced combinatorial enumeration techniques

Abstract

We use the fact that certain cosets of the stabilizer of points are pairwise conjugate in a symmetric group $S_n$ in order to construct recurrence relations for enumerating certain subsets of $S_n$. Occasionally one can find `closed form' solutions to such recurrence relations. For example, the probability that a random element of $S_n$ has no cycle of length divisible by $q$ is $\prod_{d=1}^{\lfloor n/q\rfloor} (1-\frac{1}{dq})$.