Grant: Discovery Grants Program - Individual
Ryerson University
$12,000.00
Algebraic methods in computational complexity and decidability
EF 2017-18
Résumé
This is a proposal to fund my ongoing research in universal algebra, which is a branch of pure mathematics.Broadly speaking, the main long-term goals of my proposed research are (1) to discover unifying patterns in various branches of mathematical knowledge, such as logic,algebra, and discrete mathematics; (2) to study these patterns at an appropriate level of generality; (3) to provide insight into global structure by studying phenomena that occur locally; and (4) to return something of the value to the general mathematical community, by either broadening the knowledge in the respective areas, or by finding multi-disciplinary applications.My research falls mostly within the boundaries of equational logic and its algorithmic aspects. The main object of study of equational logic are nonstandard versions of algebra (equational theories) and their abstract models. The general problem is to determine to what extent the models of these nonstandard versions of algebra can be described.In more detail, I am particularly interested in using the tools of combinatorial-geometric nature to study the local structure of algebras and relational structures; to determine to what extent the global structure will be influenced by this local behaviour; and whether such properties can be recognized algorithmically; and, if so, whether such an algorithm is computationally tractable.The research proposal is motivated, among other questions, by one of the fundamental questions in the area of theoretical computer science about the complexity of computational queries occurring naturally in the area of artificial intelligence.
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
249684-2012
Name nom
Delic, Dejan
Department département
Mathematics
Organization id
43
Institution établissement
Ryerson University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2017
Competition year année de concours
2012
Award amount
12000
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
5
Nb partie
5
Application title
Algebraic methods in computational complexity and decidability
Keyword
NSERC
Application summary
This is a proposal to fund my ongoing research in universal algebra, which is a branch of pure mathematics.Broadly speaking, the main long-term goals of my proposed research are (1) to discover unifying patterns in various branches of mathematical knowledge, such as logic,algebra, and discrete mathematics; (2) to study these patterns at an appropriate level of generality; (3) to provide insight into global structure by studying phenomena that occur locally; and (4) to return something of the value to the general mathematical community, by either broadening the knowledge in the respective areas, or by finding multi-disciplinary applications.My research falls mostly within the boundaries of equational logic and its algorithmic aspects. The main object of study of equational logic are nonstandard versions of algebra (equational theories) and their abstract models. The general problem is to determine to what extent the models of these nonstandard versions of algebra can be described.In more detail, I am particularly interested in using the tools of combinatorial-geometric nature to study the local structure of algebras and relational structures; to determine to what extent the global structure will be influenced by this local behaviour; and whether such properties can be recognized algorithmically; and, if so, whether such an algorithm is computationally tractable.The research proposal is motivated, among other questions, by one of the fundamental questions in the area of theoretical computer science about the complexity of computational queries occurring naturally in the area of artificial intelligence.