Recent advances in the study of automorphism groups within graph theory have yielded significant theoretical and applied insights. At its core, the interplay between the algebraic structure of groups ...

Graph polynomials serve as robust algebraic encodings of the intricate combinatorial properties inherent to graphs. At the heart of this discipline lies the Tutte polynomial, an invariant that not ...

Jacob, Jobby. "Rankings (ordered colorings) of Graphs." Math. Colloquium. Hobart and William Smith Colleges. Geneva, NY. 11 Apr. 2019. Keynote Speech. Dobosh, Korrine, Samuel Kennedy, and Jobby Jacob.

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 ...

The so-called differential equation method in probabilistic combinatorics presented by Patrick Bennett, Ph.D., Department of Mathematics, Western Michigan University Abstract: Differential equations ...

N. Alon, J. Spencer, The Probabilistic Method, Wiley, 1992. Additional course notes may be distributed. The main theme of the course will be concerned with applications of probabilistic methods in ...

Princeton mathematician Noga Alon has received the 2024 Wolf Prize in Mathematics “for pioneering contributions to mathematical cryptography, combinatorics, and the theory of computer science.” He ...

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 ...