Introduces students to ideas and techniques from discrete mathematics that are widely used in science and engineering. Mathematical definitions and proofs are emphasized. Topics include formal logic ...

Combinatorial complexity of infinite words examines the growth and structural properties of sequences over a finite alphabet when extended without bound. Core measures include factor complexity, which ...

Combinatorial optimisation uses discrete structures to model decision‐making problems such as scheduling, network design and facility location. Many such problems can be expressed as optimisation over ...