Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Université du Québec à Montréal

$16,000.00

Enumerative combinatorics and applications

EF 2008-09

Résumé
My research program deals with various enumerative problems arising mainly from other branches of mathematics and science and also with the development of appropriate mathematical and combinatorial tools related to labelled and unlabelled enumeration.  The areas of application include mathematical analysis (combinatorial models for orthogonal polynomials and other special functions), computer science (data structures), statistical mechanics (polyomino enumeration, Mayer expansions), combinatorial chemistry, topological graph theory, etc.    My ongoing research problems include, for example: - Computation of graph invariants arising from Mayer's expansion of partition functions for gas models. - A combinatorial interpretation of the Legendre transform in terms of 2-edge-connected graphs. - Enumeration and asymptotic expansion of various classes of convex polyominoes. - Classification of benzenoid molecules according to their symmetries. - Characterization of projective-planar and toroidal graphs with no k33-subdivisions.    - Enumeration and classification of various classes of tree-like structures, cacti and 2-trees.   I also participate in a more theoretical effort, where the  tools and methods of enumerative combinatorics are developed and enhanced, particularly those of the combinatorial Theory of Species.   One of the objectives of this approach is the classification of structures according to their stabilizer groups, in particular for species which are defined by functional equations. The use of computer algebra plays a central role in this endeavour.   Some of my research activities in this area include:  The extension of the methods for the substitution of 2-pole networks into the edges of graphical structures, and the computation of addition formulas for  particular species for example oriented cycles and polygons.
Programme
Discovery Grants Program - Individual
Emplacement
Quebec, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
107292-2006
Name nom
Leroux, Pierre
Department département
Mathématiques
Organization id
57
Institution établissement
Université du Québec à Montréal
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2006
Award amount
16000
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
337
Committee name en
Pure & Applied Maths - B
Committee name fr
Maths pures et appliquées - B
Area of application code
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
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
3
Nb partie
3
Application title
Enumerative combinatorics and applications
Keyword
NA
Application summary
My research program deals with various enumerative problems arising mainly from other branches of mathematics and science and also with the development of appropriate mathematical and combinatorial tools related to labelled and unlabelled enumeration.  The areas of application include mathematical analysis (combinatorial models for orthogonal polynomials and other special functions), computer science (data structures), statistical mechanics (polyomino enumeration, Mayer expansions), combinatorial chemistry, topological graph theory, etc.    My ongoing research problems include, for example: - Computation of graph invariants arising from Mayer's expansion of partition functions for gas models. - A combinatorial interpretation of the Legendre transform in terms of 2-edge-connected graphs. - Enumeration and asymptotic expansion of various classes of convex polyominoes. - Classification of benzenoid molecules according to their symmetries. - Characterization of projective-planar and toroidal graphs with no k33-subdivisions.    - Enumeration and classification of various classes of tree-like structures, cacti and 2-trees.   I also participate in a more theoretical effort, where the  tools and methods of enumerative combinatorics are developed and enhanced, particularly those of the combinatorial Theory of Species.   One of the objectives of this approach is the classification of structures according to their stabilizer groups, in particular for species which are defined by functional equations. The use of computer algebra plays a central role in this endeavour.   Some of my research activities in this area include:  The extension of the methods for the substitution of 2-pole networks into the edges of graphical structures, and the computation of addition formulas for  particular species for example oriented cycles and polygons.