arXiv Analytics

Sign in

arXiv:1005.0151 [math.CO]AbstractReferencesReviewsResources

Primitive factorizations, Jucys-Murphy elements, and matrix models

Sho Matsumoto, Jonathan Novak

Published 2010-05-02Version 1

A factorization of a permutation into transpositions is called "primitive" if its factors are weakly ordered. We discuss the problem of enumerating primitive factorizations of permutations, and its place in the hierarchy of previously studied factorization problems. Several formulas enumerating minimal primitive and possibly non-minimal primitive factorizations are presented, and interesting connections with Jucys-Murphy elements, symmetric group characters, and matrix models are described.

Comments: 14 pages, FPSAC 2010 conference contribution
Categories: math.CO
Subjects: 05E05, 05E10
Related articles: Most relevant | Search more
arXiv:1202.5319 [math.CO] (Published 2012-02-23)
How to write a permutation as a product of involutions (and why you might care)
arXiv:1906.11961 [math.CO] (Published 2019-06-27)
Factorization problems in complex reflection groups
arXiv:0802.0572 [math.CO] (Published 2008-02-05, updated 2008-05-02)
On the number of collinear triples in permutations