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

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

Degenerate polynomial structures constitute a rapidly expanding area of combinatorial analysis in which classical families of polynomials and numbers are deformed by an additional parameter, often ...