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

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

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic and Boolean circuits; sets, ...

The goal of Computer Science is problem-solving with speedy solutions and Discrete Mathematics helps us solve real-world problems and daily projects and is comparatively easy to understand.

Two pioneers of the theory of computation have won the 2021 Abel Prize, one of the most prestigious honours in mathematics. Hungarian mathematician László Lovász and Israeli computer scientist ...

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

Park Jin-young, an assistant professor of mathematics at New York University, has emerged as a leading expert in probabilistic combinatorics, a branch of discrete mathematics, for her work in solving ...

A new approach has chipped away at a famously unsolved math problem: the ... Budapest-born mathematician Paul Erdos lived for most of the 20th century and made his name in discrete mathematics, ...

Three computer scientists have announced the largest-ever mathematics proof: a file that comes in at a whopping 200 terabytes 1, roughly equivalent to all the digitized text held by the US Library ...