Grant: Discovery Grants Program - Individual
Carleton University
$11,000.00
Geometric methods in group theory and group-based cryptography
EF 2012-13
Résumé
My research is in Pure Mathematics, more precisely, in Geometric Group Theory. This flourishing and rapidly developing field of study attracts many brilliant researchers. It is interdisciplinary in nature. It is rooted in the work of many mathematicians. It started getting its shape in the 1980s when Gromov clearly articulated the idea that infinite groups, usually regarded as algebraic objects, can be characterized by their geometric properties, and that tools from topology can be used in group theory. Since then, research in this area made its way also to harmonic analysis, logic, probability and computer science. A wealth of available techniques and potential applications ensures that the field will remain a mainstream in mathematics for a long while.
There are two strands in geometric group theory: groups can be studied via their intrinsic geometry, or via their actions on appropriate spaces. In my research I am interested in both. The intrinsic geometry of a group reveals algebraic, algorithmic and asymptotic properties of the group. Group actions on spaces, such as real trees or tree-graded spaces, allow one to gain insight into the structure of the group. It is fascinating to see how quickly the development of new methods leads to striking applications, both in pure mathematics and in the real life. An example of the former is recent solution to the following two Tarski's problems from the 1940s: Are the 2-generated free group and the 3-generated free group elementarily equivalent? Is the elementary theory of a free group decidable? On the practical side, the interest in these methods is motivated by the needs of the group-based cryptography. These seemingly very different areas of research can be approached using the versatile theory of solving systems of equations and inequations over groups. A canonical description of the solution set is of importance to a logician, while a cryptographer would focus on decidability and complexity. My interest and passion lie in the study of the systems of equations over relatively hyperbolic groups, using a variety of available techniques from different areas, borrowing existing methods and developing new ones.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
298965-2011
Name nom
Bumagin, Inna
Department département
Mathematics and Statistics, School of
Organization id
23
Institution établissement
Carleton University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2012
Competition year année de concours
2011
Award amount
11000
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
2908
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Algebra
Research subject fr
algèbre
Partie
2
Nb partie
5
Application title
Geometric methods in group theory and group-based cryptography
Keyword
NSERC
Application summary
My research is in Pure Mathematics, more precisely, in Geometric Group Theory. This flourishing and rapidly developing field of study attracts many brilliant researchers. It is interdisciplinary in nature. It is rooted in the work of many mathematicians. It started getting its shape in the 1980s when Gromov clearly articulated the idea that infinite groups, usually regarded as algebraic objects, can be characterized by their geometric properties, and that tools from topology can be used in group theory. Since then, research in this area made its way also to harmonic analysis, logic, probability and computer science. A wealth of available techniques and potential applications ensures that the field will remain a mainstream in mathematics for a long while.
There are two strands in geometric group theory: groups can be studied via their intrinsic geometry, or via their actions on appropriate spaces. In my research I am interested in both. The intrinsic geometry of a group reveals algebraic, algorithmic and asymptotic properties of the group. Group actions on spaces, such as real trees or tree-graded spaces, allow one to gain insight into the structure of the group. It is fascinating to see how quickly the development of new methods leads to striking applications, both in pure mathematics and in the real life. An example of the former is recent solution to the following two Tarski's problems from the 1940s: Are the 2-generated free group and the 3-generated free group elementarily equivalent? Is the elementary theory of a free group decidable? On the practical side, the interest in these methods is motivated by the needs of the group-based cryptography. These seemingly very different areas of research can be approached using the versatile theory of solving systems of equations and inequations over groups. A canonical description of the solution set is of importance to a logician, while a cryptographer would focus on decidability and complexity. My interest and passion lie in the study of the systems of equations over relatively hyperbolic groups, using a variety of available techniques from different areas, borrowing existing methods and developing new ones.