Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

Wilfrid Laurier University

$15,000.00

Theory and applications of algebraic combinatorics

FY 2013-14

Summary
This research weaves together two strands, one theoretical and one applied. On the theoretical side, this programme explores identities of symmetric functions from algebraic combinatorics. These identities, as well as a host of related identities in similar algebras, play a significant role in theoretical physics, algebraic geometry, and representation theory as well as combinatorics. Thus finding such identities is crucial for all these subjects. On the applied side this programme explores the security of anonymity networks. Anonymity networks--for example, Tor--conceal information about the relationship between senders and receivers. They are already a vital means of communication for political dissidents, journalists, and law enforcement officials, and as the common person's concern with electronic privacy grows, they will become more widespread. But how secure are they? This research uses techniques from combinatorics--jeu de taquin, lattice paths, and other bijective constructions--to derive new identities involving Schur symmetric functions. It also extends these results to other types of symmetric functions (e.g. Q-functions, Jack functions, Macdonald polynomials). These results will be particularly prized in physics in random matrix theory. Furthermore, solving these problems will require constructing new combinatorial techniques that will be applicable to a range of other combinatorial problems. This research also uses symmetric functions to derive practical metrics for anonymity networks, telling Alice how likely it is that an adversary can discover she is communicating with Bob. The applied goal is a spinoff of the theoretical goals. Simpler versions of the problem are solvable by classical enumerative techniques, but the full nature of the problem demands symmetric function theory from algebraic combinatorics, which goes beyond the normal tool chest of a computer scientist. At the same time, the problems are outside the domain of most combinatorialists, so being at the intersection of these two areas is an advantage for me and will lead to novel and significant results.
Program
Discovery Grants Program - Individual
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
238510-2010
Name nom
Hamel, Angele
Department département
Physics and Computer Science
Organization id
35
Institution établissement
Wilfrid Laurier University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2013
Competition year année de concours
2010
Award amount
15000
Program id
RGPIN
Program name 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
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
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
4
Nb partie
5
Application title
Theory and applications of algebraic combinatorics
Keyword
NSERC
Application summary
This research weaves together two strands, one theoretical and one applied. On the theoretical side, this programme explores identities of symmetric functions from algebraic combinatorics. These identities, as well as a host of related identities in similar algebras, play a significant role in theoretical physics, algebraic geometry, and representation theory as well as combinatorics. Thus finding such identities is crucial for all these subjects. On the applied side this programme explores the security of anonymity networks. Anonymity networks--for example, Tor--conceal information about the relationship between senders and receivers. They are already a vital means of communication for political dissidents, journalists, and law enforcement officials, and as the common person's concern with electronic privacy grows, they will become more widespread. But how secure are they? This research uses techniques from combinatorics--jeu de taquin, lattice paths, and other bijective constructions--to derive new identities involving Schur symmetric functions. It also extends these results to other types of symmetric functions (e.g. Q-functions, Jack functions, Macdonald polynomials). These results will be particularly prized in physics in random matrix theory. Furthermore, solving these problems will require constructing new combinatorial techniques that will be applicable to a range of other combinatorial problems. This research also uses symmetric functions to derive practical metrics for anonymity networks, telling Alice how likely it is that an adversary can discover she is communicating with Bob. The applied goal is a spinoff of the theoretical goals. Simpler versions of the problem are solvable by classical enumerative techniques, but the full nature of the problem demands symmetric function theory from algebraic combinatorics, which goes beyond the normal tool chest of a computer scientist. At the same time, the problems are outside the domain of most combinatorialists, so being at the intersection of these two areas is an advantage for me and will lead to novel and significant results.