Minimal Transitive Products of Transpositions: The Reconstruction of a Proof of A. Hurwitz
Séminaire lotharingien de combinatoire, Tome 37 (1996)
Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website
We want to draw the combintorialists attention to an important, but apparently little known paper by the function theorist A. Hurwitz, published in 1891, where he announces the solution of a counting problem which has gained some attention recently: in how many ways can a given permutation be written as the product of transpositions such that the transpositions generate the full symmetric group, and such that the number of factors is as small as possible (under this side condition).
@article{SLC_1996_37_a2,
author = {Volker Strehl},
title = {Minimal {Transitive} {Products} of {Transpositions:} {The} {Reconstruction} of a {Proof} of {A.} {Hurwitz}},
journal = {S\'eminaire lotharingien de combinatoire},
publisher = {mathdoc},
volume = {37},
year = {1996},
url = {http://geodesic.mathdoc.fr/item/SLC_1996_37_a2/}
}
Volker Strehl. Minimal Transitive Products of Transpositions: The Reconstruction of a Proof of A. Hurwitz. Séminaire lotharingien de combinatoire, Tome 37 (1996). http://geodesic.mathdoc.fr/item/SLC_1996_37_a2/