Course topics

  1. Introduction.
  2. Combinatorial objects: representation, identification, symmetry, constructive and analytical enumeration. The natural numbers, integers, rational and irrational numbers. The arithmetic operations, powers and radicals. The basic algebraic formulas including the binomial formula.
  3. Permutation groups and combinatorial enumeration: Permutation groups. Introduction to Polya enumeration theory. Graph isomorphism problem.
  4. Finite fields and applications: Finite fields. Coding theory. Incidence structures and block designs.
  5. Symmetrical graphs: Cayley graphs, strongly regular graphs. $n$-dimensional cubes and distance transitive graphs.
  6. Examples of applications: Design of statistical experiments. Cryptography. Recreational mathematics.

Course Information

University course catalogue:
201.1.6071
Level:
Advanced Undergraduate
Credits:
4.0

Dependency Graph

Nodes are draggable, double click for more info