Please email any errors or updates to our website support/editor.

PDF files require Adobe Acrobat Reader.

- Algebraic combinatorics
- Continuous optimization
- Cryptography
- Discrete optimization
- Graph theory
- Quantum computing

As a simple example, to solve an enumeration problem one often encodes combinatorial data into an algebra of formal power series by means of a generating function. Algebraic manipulations with these power series then provide a systematic way to solve the original counting problem. Methods from complex analysis can be used to obtain asymptotic solutions even when exact answers are intractable. Read more about algebraic combinatorics.

- Chris Godsil: Algebraic graph theory
- Ian Goulden: Combinatorial enumeration
- David Jackson: Algebraic-enumerative combinatorics, moduli spaces of curves, intersection theory, Integrable Hierarchies
- Kevin Purbhoo: Algebraic combinatorics, algebraic geometry
- Bruce Richmond: Asymptotic enumeration
- David Wagner: Enumerative combinatorics, statistical mechanics, matroid theory
- Karen Yeats: Combinatorics in quantum field theory

Continuous optimization is the core mathematical science for real-world problems ranging from design of biomolecules to management of investment portfolios. Continuous optimization means finding the minimum or maximum value of a function of one or many real variables, subject to constraints. The constraints usually take the form of equations or inequalities. Continuous optimization has been the subject of study by mathematicians since Newton, Lagrange and Bernoulli. Read more about continuous optimization.

- Michael Best: Portfolio optimization, quadratic programming
- Tom Coleman: Large-Scale Computational Optimization
- Levent Tunçel: Mathematical optimization and Mathematics of Operations Research
- Steve Vavasis: Continuous optimization, numerical analysis
- Henry Wolkowicz: Applications of optimization and matrix theory to algorithmic development

In classical cryptography, some algorithm, depending on a secret piece of information called the key, which had to be exchanged in secret in advance of communication, was used to scramble and descramble messages. (Note that, in a properly designed system, the secrecy should rely only on the key. It should be assumed that the algorithm is known to the opponent.) Read more about cryptography.

- David Jao: Number theory, elliptic curves, isogeny-based cryptography
- Alfred Menezes: Curve-based cryptography, protocols, provable security
- Michele Mosca: Quantum key distribution, quantum-safe cryptography
- Douglas Stebila: Applied cryptography, internet security

Much of combinatorial optimization is motivated by very simple and natural problems such as routing problems in networks, packing and covering problems in graph theory, scheduling problems, and sorting problems. But the methodology of the subject encompasses a variety of techniques ranging from elementary tree-growing procedures to constructions of Hilbert bases of integer lattices. Read more about discrete optimization.

- Joseph Cheriyan: Network optimization, Parallel & Sequential Graph Algorithms
- Bill Cook: Integer programming, combinatorial optimization
- Bill Cunningham: Combinatorial optimization, polyhedral combinatorics, matroids, matchings, and generalizations
- Ricardo Fukasawa: Mixed-integer programming, Computational Optimization, operations research
- Bertrand Guenin: Combinatorial optimization
- Jochen Koenemann: Approximation algorithms, combinatorial optimization, algorithmic game theory
- Peter Nelson: Matroid theory
- Laura Sanita: Combinatorial optimization, network design
- Chaitanya Swamy: Combinatorial optimization, approximation algorithms, algorithmic game theory, stochastic optimization
- Levent Tunçel: Mathematical optimization and Mathematics of Operations Research

A graph consists of a set of elements together with a binary relation defined on the set. Graphs can be represented by diagrams in which the elements are shown as points and the binary relation as lines joining pairs of points. It is this representation which gives graph theory its name and much of its appeal. However, the true importance of graphs is that, as basic mathematical structures, they arise in diverse contexts, both theoretical and applied. The concept of a graph was known already to Euler in the early eighteenth century, but it was the notorious Four-Colour Problem, posed by F. Guthrie in the mid-nineteenth century, that spurred the development of this simple concept into a flourishing theory. Read more about graph theory.

- Jim Geelen: Graph minors
- Chris Godsil: Algebraic graph theory
- Bertrand Guenin: Signed graphs
- Penny Haxell: Extremal combinatorics, graph theory
- Peter Nelson: Extremal combinatorics
- Luke Postle: Graph colouring, topological and structural graph theory
- Bruce Richter: Graph theory & Topology of Surfaces

Today's computers and other information processing devices manipulate information using what is known as the "classical" approximation to the laws of physics. However, we have known for some time that there is a more accurate description of the laws - the one provided by quantum mechanics. The study of how the laws of quantum mechanics affect computing, cryptography, and similar information processing tasksis known as quantum information processing. Read more about quantum computing.

- Debbie Leung: Quantum Information Processing
- Michele Mosca: Quantum computing, Algorithms and Cryptography
- Ashwin Nayak: Quantum Computation and Quantum Information, theoretical computer science
- Jon Yard: Quantum Information Theory
- David Gosset:Theory of quantum computing, quantum algorithms, quantum complexity theory

Please email any errors or updates to our website support/editor.

PDF files require Adobe Acrobat Reader.

University of Waterloo

University of Waterloo

43.471468

-80.544205

200 University Avenue West

Waterloo,
ON,
Canada
N2L 3G1