Here we introduce the simplest (and yet still powerful) counting techniques. Recall that if $A$ is a finite set then we use the notation $\vert A \vert$ to denote the ...

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

###Tic Tac Toe Counter is an experiment in combinatorics/discrete math. It is an algorithm developed to count the amount of possible valid outcomes for a Tic Tac Toe game. The algorithm works by ...

Combinatorics and discrete mathematics form a vibrant and expansive branch of modern mathematics, dedicated to the study of finite or countable structures and the methods used to count, classify, and ...

Abstract: In this paper, we propose some innovations in the presentation of some issues of the discrete mathematics course. We propose a proof of the inclusion-exclusion formula using the algebraic ...

We are one of the largest and oldest discrete math groups in Canada. Our group has a wide variety of expertise in pure and applied discrete math and combinatorics. Our research themes include ...

Carnegie Mellon University Associate Professor Michael Young considers ways his research could be applied to improve efficiency in an electrical power grid. Using techniques from theoretical graph ...

All seminars take place on Wednesdays at 4.00pm in Room 807 on the 8th floor of the Mathematics Dept. See how to find us for further details. There will be tea afterwards in room 606. If you require ...