Discrete mathematics is about precision in reasoning as much as it is about solving problems. Proof techniques like induction, contradiction, and direct reasoning are used to establish results in ...

Combinatorics and discrete mathematics constitute the study of finite or countable structures and the algorithms that govern them. At its heart is enumeration: the art of counting arrangements, ...

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

Why is this unit important? Combinatorics is the study of discrete structures, which are ubiquitous in our everyday lives. While combinatorics has important practical applications (for example to ...

GPS navigation, cryptography, quantum computing - while some of humankind's greatest advancements have been invented by ...

The Mathematics GRE consists of about 70 questions. 50% of the exam is calculus and its applications. 25% consists of elementary algebra, linear algebra, abstract algebra and number theory. The ...

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

The Department has a strong faculty working in various topics in discrete mathematics, especially algorithmic aspects. The interface between Theoretical Computer Science and Discrete Mathematics has ...