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

Examines graph theory, trees, algebraic systems, Boolean algebra, groups, monoids, automata, machines, rings and fields, applications to coding theory, logic design ...

Graph limit theory provides a rigorous framework for analysing sequences of large graphs by representing them as continuous objects known as graphons – symmetric measurable functions on the unit ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.

SIAM Journal on Applied Mathematics, Vol. 41, No. 2 (Oct., 1981), pp. 222-226 (5 pages) In this paper we show that finite commutative rings with unity generated by an invertible element can be ...

Discrete Event Systems (DES) constitute a class of dynamic systems characterised by state transitions that occur at discrete points in time, triggered by instantaneous events. Supervisory Control ...