Grant: Discovery Grants Program - Individual
McMaster University
$15,000.00
Algebric and relational structures
EF 2010-11
Résumé
Algebraic and relational structures arise in many different contexts, not only within mathematics, but in most of the sciences, and even in day to day life. For example, algebras known as groups are used to represent the symmetries of crystals and other physical systems and Boolean algebras are used to codify rules of logic. Many other common systems, including those arising from questions in computer science, can be viewed in an algebraic way. Thus research on algebraic and relational structures can have an impact on several branches of the sciences and in particular on computer science.
Several important properties of algebraic systems can be expressed via equations. For example, the fact that addition is commutative is expressed by the equation x + y = y + x. It has proved useful to organize and classify algebraic systems according to the equations that they satisfy. These equationally defined classes of algebras, called varieties, are objects that I study in my research. I am interested in understanding the connection between various types of complexities that can arise in varieties and the structure of the algebras that belong to them.
A more recent direction that my research has taken relates to a problem from computational complexity. An important class of problems, known as constraint satisfaction problems (CSPs), has a natural expression in terms of finite algebras and relational structures. CSPs are ubiquitous in many areas of artificial intelligence, computer science, and discrete mathematics, such as database theory, scheduling, and networking. A system of linear equations can be viewed as a special type of CSP. I am investigating a conjectured correlation between manageable complexity of subclasses of CSPs and the structure of the corresponding algebraic and relational systems.
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
124205-2010
Name nom
Valeriote, Matthew
Department département
Mathematics and Statistics
Organization id
27
Institution établissement
McMaster University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2010
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
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
2912
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Logic
Research subject fr
Logique
Partie
1
Nb partie
5
Application title
Algebric and relational structures
Keyword
NSERC
Application summary
Algebraic and relational structures arise in many different contexts, not only within mathematics, but in most of the sciences, and even in day to day life. For example, algebras known as groups are used to represent the symmetries of crystals and other physical systems and Boolean algebras are used to codify rules of logic. Many other common systems, including those arising from questions in computer science, can be viewed in an algebraic way. Thus research on algebraic and relational structures can have an impact on several branches of the sciences and in particular on computer science.
Several important properties of algebraic systems can be expressed via equations. For example, the fact that addition is commutative is expressed by the equation x + y = y + x. It has proved useful to organize and classify algebraic systems according to the equations that they satisfy. These equationally defined classes of algebras, called varieties, are objects that I study in my research. I am interested in understanding the connection between various types of complexities that can arise in varieties and the structure of the algebras that belong to them.
A more recent direction that my research has taken relates to a problem from computational complexity. An important class of problems, known as constraint satisfaction problems (CSPs), has a natural expression in terms of finite algebras and relational structures. CSPs are ubiquitous in many areas of artificial intelligence, computer science, and discrete mathematics, such as database theory, scheduling, and networking. A system of linear equations can be viewed as a special type of CSP. I am investigating a conjectured correlation between manageable complexity of subclasses of CSPs and the structure of the corresponding algebraic and relational systems.