Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-15T17:25:31.551Z Has data issue: false hasContentIssue false

Inequivalent Transitive Factorizations into Transpositions

Published online by Cambridge University Press:  20 November 2018

I. P. Goulden
Affiliation:
Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, N2L 3G1 e-mail: ipgoulde@math.uwaterloo.ca dmjackson@math.uwaterloo.ca
D. M. Jackson
Affiliation:
Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, N2L 3G1 e-mail: ipgoulde@math.uwaterloo.ca dmjackson@math.uwaterloo.ca
F. G. Latour
Affiliation:
Department of Mathematics, MIT, Cambridge, Massachusetts 02139, U.S.A. e-mail: flatour@math.mit.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The question of counting minimal factorizations of permutations into transpositions that act transitively on a set has been studied extensively in the geometrical setting of ramified coverings of the sphere and in the algebraic setting of symmetric functions.

It is natural, however, from a combinatorial point of view to ask how such results are affected by counting up to equivalence of factorizations, where two factorizations are equivalent if they differ only by the interchange of adjacent factors that commute. We obtain an explicit and elegant result for the number of such factorizations of permutations with precisely two factors. The approach used is a combinatorial one that rests on two constructions.

We believe that this approach, and the combinatorial primitives that have been developed for the “cut and join” analysis, will also assist with the general case.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 2001