A representation of even permutations (Q1266349)

Let \(\sigma\) be a permutation in \(S_n\). It is known [see, e.g., \textit{G. Boccara}, Discrete Math. 29, 105-134 (1980; Zbl 0444.20003)] that if \(\sigma\) is odd then the number of different representations of \(\sigma\) as a product of an \(n\)-cycle by an \((n-1)\)-cycle is \(2(n-2)!\), and that if \(\sigma\) is even then the number of different representations of \(\sigma\) as a product of an \(n\)-cycle by an \((n-2)\)-cycle is \((n-\text{fix}(\sigma))(n-3)!\), where \(\text{fix}(\sigma)\) is the number of fixed points of \(\sigma\). \textit{A. Machí} [Eur. J. Comb. 13, No. 4, 273-277 (1992; Zbl 0771.05005)] has given a combinatorial proof of the first formula, thereby presenting an algorithm for recursively constructing all the respective representations of an odd permutation. The authors present a combinatorial proof of the second formula. It provides an algorithm for constructing all the respective representations of an even permutation. Roughly, the idea is to reduce the problem to the case of an odd permutation and then rely on Machí's algorithm.