How to write a permutation as a product of involutions (and why you might care)

T. Kyle Petersen, Bridget Eileen Tenner

Published 2012-02-23Version 1

It is well-known that any permutation can be written as a product of two involutions. We provide an explicit formula for the number of ways to do so, depending only on the cycle type of the permutation. In many cases, these numbers are sums of absolute values of irreducible characters of the symmetric group evaluated at the same permutation, although apart from the case where all cycles are the same size, we have no good explanation for why this should be so.