# Discrete Math—Research

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 specialize in constructive combinatorics, particularly the construction of error-correcting codes and combinatorial designs. Another area of interest is enumerative combinatorics.

## Faculty Areas of Interests

Coding theory; Design theory; Cryptography

Projective geometry; Algebraic and geometric combinatorics; Groups acting on geometries and graphs

Combinatorics, partition theory, q-series, generating function identities

Combinatorial designs; Graph decompositions; Graph colorings

Design theory; Combinatorial algorithms

Discrete Mathematics

Combinatorial Design Theory; Algebraic Coding Theory; Partial difference sets and strongly regular Cayley graphs

Algebraic and Enumerative Combinatorics; Combinatorial Commutative Algebra; Partition Theory