Discrete mathematics is the study of finite or countable discrete structures; it spans such topics as graph theory, coding theory, design theory, and enumeration. The faculty at Michigan Tech ...

Graph algorithms and combinatorial optimisation form a pivotal area of research that underpins many modern computational applications. At their core, graph algorithms provide systematic methods for ...

Mathematical truths are often born of the conflict between order and disorder. Mathematicians discover patterns, and, to better understand the mysterious forces at play, they look for countervailing ...

The analysis group works on a variety of themes of modern analysis including: Harmonic analysis on n-dimensional Euclidean space, Harmonic analysis on Lie groups, abstract harmonic analysis, operator ...

Combinatorial designs and finite group theory form a rich intersection of discrete mathematics and algebra, where structured arrangements of elements are studied alongside the algebraic properties of ...