Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Waterloo

$32,000.00

Well-quasi-ordering for binary matroids

EF 2008-09

Résumé
In Matroid Representation Theory we study natural geometric questions such as: "When can we embed a set of points in a space subject to prescribed dependencies?" These are similar to the questions that occupied classical Greek geometers such as Euclid and Pappus.  While the questions are theoretical in nature, the motivation is to answer fundamental problems in Combinatorial Optimization and in Theoretical Computer Science.  The goal of the proposed research is to provide structural results concerning configurations of points in "finite projective geometries". The research program is at a very exciting phase at the moment. There is a good chance that in the near future we will be able to answer some of the oldest and most fundamental problems in the area; namely Rota's Conjecture and the Well-Quasi-Ordering Conjecture.  If successful, the results will have algorithmic applications in combinatorial optimization, solving, for example, certain multicommodity transportation problems and certain integer programming problems. The results may also find application in other areas that utilize finite projective geometries, such as coding theory and cryptograpy.
Programme
Discovery Grants Program - Individual
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
203110-2006
Name nom
Geelen, James
Department département
Combinatorics and Optimization
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2006
Award amount
32000
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
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
3
Nb partie
5
Application title
Well-quasi-ordering for binary matroids
Keyword
NA
Application summary
In Matroid Representation Theory we study natural geometric questions such as: "When can we embed a set of points in a space subject to prescribed dependencies?" These are similar to the questions that occupied classical Greek geometers such as Euclid and Pappus.  While the questions are theoretical in nature, the motivation is to answer fundamental problems in Combinatorial Optimization and in Theoretical Computer Science.  The goal of the proposed research is to provide structural results concerning configurations of points in "finite projective geometries". The research program is at a very exciting phase at the moment. There is a good chance that in the near future we will be able to answer some of the oldest and most fundamental problems in the area; namely Rota's Conjecture and the Well-Quasi-Ordering Conjecture.  If successful, the results will have algorithmic applications in combinatorial optimization, solving, for example, certain multicommodity transportation problems and certain integer programming problems. The results may also find application in other areas that utilize finite projective geometries, such as coding theory and cryptograpy.