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

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

Algebra is the discipline of pure mathematics that is concerned with the study of the abstract properties of a set, once this is endowed with one or more operations that respect certain rules (axioms) ...

Combinatorics was introduced to the University of Malta by Prof. Stanley Fiorini in 1975. The authors of this page were all tutored and influenced by him. They currently form the combinatorics ...

This course is compulsory on the MPhil/PhD in Mathematics. This course is available with permission as an outside option to students on other programmes where regulations permit. Other members of the ...

Join one of the most vibrant and forward-looking graduate Mathematics programs in Canada. Mathematics is a vital human endeavour that has important outcomes and applications in almost any field. The ...

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

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