Primitive factorizations, Jucys-Murphy elements, and matrix models
Combinatorics
2010-05-04 v1
Abstract
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.
Cite
@article{arxiv.1005.0151,
title = {Primitive factorizations, Jucys-Murphy elements, and matrix models},
author = {Sho Matsumoto and Jonathan Novak},
journal= {arXiv preprint arXiv:1005.0151},
year = {2010}
}
Comments
14 pages, FPSAC 2010 conference contribution