This course is available on the MSc in Applicable Mathematics. This course is available as an outside option to students on other programmes where regulations permit. Students should be taking the ...

Examines graph theory, trees, algebraic systems, Boolean algebra, groups, monoids, automata, machines, rings and fields, applications to coding theory, logic design ...

The so-called differential equation method in probabilistic combinatorics presented by Patrick Bennett, Ph.D., Department of Mathematics, Western Michigan University Abstract: Differential equations ...

Presents propositional logic, combinatorics, methods of proof, mathematical systems, algebra of sets, matrix algebra, relations and functions, recursion and generating functions, applications to ...

Commutative algebra and graph theory are two vibrant areas of mathematics that have grown increasingly interrelated. At this interface, algebraic methods are applied to study combinatorial structures, ...

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

3 Apply the principles of set theory, functions and relations. 4 Apply the principles of abstract algebra. 5 Apply techniques of number theory to coding and cryptography. 6 Apply techniques of graph ...

The term discrete studies is intended to capture a diverse family of research topics which entail elements of finitary or discrete mathematics and exact reasoning. Simon Fraser University houses ...