An in-depth study of one or more topics from: generating functions, Polya's theory of counting, block designs, coding theory, partially ordered sets...
Symbolic logic, propositional and predicate calculi, set theory and model theory, completeness. Prerequisite(s): MATH 2100 or permission of the...
Recursive functions and computability, algorithms, Church's thesis, Turing machines, computational logic, NP-completeness. Also listed as COMP 4803....
Finite automata and regular expressions, properties of regular sets, context-free grammars, pushdown automata, deterministic context-free languages....
Matrix computations, conditioning and stability, direct methods for linear systems, classical iterative methods: Jacobi, Gauss-Seidel; modern...
Two-person zero-sum games; infinite games; multistage games; differential games; utility theory; two-person general-sum games; bargaining problem;...
Paths, circuits, Eulerian and Hamiltonian graphs, connectivity, colouring problems, matching, Ramsey theory, network flows. Prerequisite(s): MATH...
Topics covered include: a general survey of public key cryptography; classical applications of finite fields and number theory; relevant background in...
Existence and construction of combinatorial designs: finite geometries, pairwise balanced designs, balanced incomplete block designs, Steiner triple...
Floating point arithmetic; numerical solution of ODEs; finite difference methods for PDEs; stability, accuracy and convergence: von Neumann analysis,...
Space of quantum bits; entanglement. Observables in quantum mechanics. Density matrix and Schmidt decomposition. Quantum cryptography. Classical and...
Lossless compression methods. Discrete Fourier transform and Fourier-based compression methods. JPEG and MPEG. Wavelet analysis. Digital filters and...
Consists of a written report on some approved topic or topics in the field of mathematics, together with a short lecture on the report. ...
Prerequisite: B.Math.(Honours) students only.