The Combinatorics Research Group is a diverse and active research group with interests in many areas of discrete mathematics including combinatorics (designs, enumeration, and optimization), graph theory, finite fields and applications, analysis of algorithms and automata and formal languages.

Researcher

Research Interests

Geometric and algorithmic properties of infinite groups, group actions on metric spaces, groups and graphs, Gromov hyperbolic, relatively hyperbolic and automatic groups, efficiency of computations in groups, applications to noncommutative cryptography
Combinatorial Optimization, Integer and Logic Programming, Mathematical Programming Computation
Combinatorial Enumerations, Graph Theory, and Mathematics of Gambling and Gaming
Finite Fields and their Applications, Analysis of Algorithms and Analytic Combinatorics, Cryptography and Coding Theory, Combinatorial Enumeration
Design Theory, Gray Codes, De Bruijn Sequences and Universal Cycles, Combinatorial Game Theory, Graph Theory, Mathematical Biology, Philosophy of Mathematics
Finite Fields and Applications in Cryptography and Coding Theory, Combinatorics, Algebra and Number Theory