Department of Mathematics and
Statistics

McMaster University

1280 Main Street West

Hamilton, Ontario

Canada L8S 4K1

E-mail: matt@math.mcmaster.ca

Office: Hamilton Hall Room 323

Teaching Schedule, Fall 2021 |
||||||
---|---|---|---|---|---|---|

Course Title | Course Number | Room | Semester |
Time | Course Information | |

Abstract Algebra | MATH 3GR3 | online | Fall | Lectures: Mo, Th, 3:30-4:20pm, Tu, 4:30pm-5:20pm Tutorial: Fr, 10:30-11:20am | click here | |

Topics in Logic | MATH 4LT3/6LT3 | online | Fall | Mo, Th, 12:30-1:20pm, Tu, 1:30-2:20pm | click here | |

Teaching Schedule, Winter 2022 | ||||||

Applications of Linear Algebra | MATH 2L03 | JHE 264 | Winter | Mo, We 2:30-3:20pm, Fr 4:30-5:20pm | ||

Fall Semester Office Hours | ||||||

2:00pm to 3:20pm on Mondays and Thursdays, and by appointment |

**Research Interests: **Mathematical logic,
universal algebra and computational complexity

I am involved in the study and classification of general algebraic systems. This area of mathematics is often called Universal Algebra and got its start in the 1930s. In order to compare and classify algebras they are often grouped together according to the equations that they satisfy.

Borrowing and expanding on techniques and ideas from mathematical logic,
classical abstract algebra, and also from newer branches of mathematics
such as lattice theory and category theory, powerful tools have been
developed to help organize and understand the structure of varieties
(classes of algebras defined by equations) and the algebras they contain.
Recent advances in the field have opened up a new area of study dealing
with the local structure of finite algebras. This new local theory of
finite algebras has not only been useful in solving several longstanding
problems but it has also suggested a number of new and challenging
research problems.

My current research program involves studying the computational
complexity of subclasses of the Constraint Satisfaction Problem
(CSP). Many well known complexity problems, such as graph
coloring or Boolean satisfiability, can be naturally presented within the
vast CSP framework. Recent work of Bulatov, Jeavons, Krokhin and
others has established a strong connection between the CSP and universal
algebra and some of the important open problems in the field can be
expressed in purely algebraic terms.

Department of Mathematics and Statistics Home Page

McMaster University Home Page