Grant: Discovery Grants Program - Individual
Saint Mary's University
$8,000.00
Factorization problems in the symmetric group
FY 2009-10
Summary
The primary focus of this project is the general problem of decomposing (or factoring) a permutation into a product of others. Permutation factorizations arise in many interesting and diverse contexts; for instance, they are intimately connected with the representation theory of the symmetric group, combinatorial topology (viz. embeddings of graphs on surfaces), singularity theory, algebraic geometry, and physics.
This research program will investigate the algebraic and combinatorial structure of permutation factorizations, with a focus on enumerative aspects. Counting minimal length "transitive" decompositions of permutations into transposition factors is of particular interest, since this problem is known to be equivalent to the enumeration of almost simple branched coverings of the sphere by the sphere. It has recently been linked to the intersection theory of the moduli space of curves. The goal is to understand the combinatorics underlying transitive factorizations, motivated by their compelling rich structure and the long term hope that a deeper understanding will shed light on the associated geometry.
To this end, connections between factorizations and well known combinatorial objects such as trees and parking functions will be studied. From an algebraic viewpoint, permutation factorization is at the heart of the representation theory of the symmetric group. (Indeed, counting factorizations is equivalent to determining the structure constants of the central subalgebra of the group algebra.) The algebraic aspects of permutation factorizations (as well as factorizations in other Coxeter groups) will be explored.
Program
Discovery Grants Program - Individual
Recipient
Location
Nova Scotia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
341798-2008
Name nom
Irving, John
Department département
Mathematics and Computing Science
Organization id
85
Institution établissement
Saint Mary's University
Province en
Nova Scotia
Province fr
Nouvelle-Écosse
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2009
Competition year année de concours
2008
Award amount
8000
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
336
Committee name en
Pure & Applied Maths - A
Committee name fr
Maths pures et appliquées - A
Area of application code
9999
Area of application group en
Not available
Area of application group fr
Non disponible
Area of application en
Not available
Area of application fr
Non disponible
Research subject code
2914
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Combinatorics
Research subject fr
Combinatoire
Partie
2
Nb partie
3
Application title
Factorization problems in the symmetric group
Keyword
NA
Application summary
The primary focus of this project is the general problem of decomposing (or factoring) a permutation into a product of others. Permutation factorizations arise in many interesting and diverse contexts; for instance, they are intimately connected with the representation theory of the symmetric group, combinatorial topology (viz. embeddings of graphs on surfaces), singularity theory, algebraic geometry, and physics.
This research program will investigate the algebraic and combinatorial structure of permutation factorizations, with a focus on enumerative aspects. Counting minimal length "transitive" decompositions of permutations into transposition factors is of particular interest, since this problem is known to be equivalent to the enumeration of almost simple branched coverings of the sphere by the sphere. It has recently been linked to the intersection theory of the moduli space of curves. The goal is to understand the combinatorics underlying transitive factorizations, motivated by their compelling rich structure and the long term hope that a deeper understanding will shed light on the associated geometry.
To this end, connections between factorizations and well known combinatorial objects such as trees and parking functions will be studied. From an algebraic viewpoint, permutation factorization is at the heart of the representation theory of the symmetric group. (Indeed, counting factorizations is equivalent to determining the structure constants of the central subalgebra of the group algebra.) The algebraic aspects of permutation factorizations (as well as factorizations in other Coxeter groups) will be explored.