Combinatorial Constructions for Transitive Factorizations in the Symmetric Group

Combinatorial Constructions for Transitive Factorizations in the Symmetric Group

Show other versions (1)

We consider the problem of counting <i>transitive factorizations</i> of permutations; that is, we study tuples (&sigma;<i>r</i>,. . . ,&sigma;1) of permutations on {1,. . . ,<i>n</i>} such that (1) the product &sigma;<i>r</i>. . ....

Full description

Bibliographic Details
Main Author: Irving, John
Format: Others
Language:en
Published: University of Waterloo 2006
Subjects:
Mathematics
combinatorics
factorizations
permutations
symmetric group
Online Access:http://hdl.handle.net/10012/1102

Internet

http://hdl.handle.net/10012/1102

Similar Items