Module MATH4281: Topics in Combinatorics IV

Department: Mathematical Sciences

MATH4281: Topics in Combinatorics IV

Prerequisites

• Algebra II (MATH2581)

Corequisites

• None

Excluded Combination of Modules

• None

Aims

• To introduce key concepts in algebraic combinatorics and study these concepts through a body of examples.
• To introduce a topic in modern combinatorics.

Content

• Catalan numbers, Dyck paths, triangulations, noncrossing set partitions.
• Symmetric group, statistics on permutations, length and inversions.
• Partitions, Young diagrams, Young tableaux, Schensted’s correspondence.
• Partially ordered sets and lattices.
• One of the following topics:
• 1. Coxeter Combinatorics: introduction to the theory of Coxeter groups and root systems, and exploring their applications and connections to actively developing areas of current research.
• 2. The Dimer Model: introduction to the study of perfect matchings of a graph, with main focus on the combinatorial aspects of the model, as well as on some of the probabilistic insights.
• 3. Theory of Alternating Sign Matrices: introduction to generalisations of permutation matrices and their connections to partitions, plane partitions, symmetric functions, hypergeometric series, and to the six vertex model – a simplified model of ice from statistical mechanics, including insights into very recent activity in the field.
• 4. Combinatorics of Symmetric Group Representations: introduction to the combinatorial approach of Vershik and Okounkov to the representation theory of symmetric groups, and related topics in combinatorics such as longest increasing subsequence, symmetric functions, and the Littlewood-Richardson rule.

Learning Outcomes

• By the end of the module students will:
• Be able to solve novel and/or complex problems in the given subject.
• Have a knowledge of a specialised and complex topic in algebraic combinatorics.
• Be able to reproduce theoretical mathematics related to this module at a level appropriate for Level 4, including key definitions and theorems.

• Students will have developed advanced technical and scholastic skills in the areas of Algebraic Combinatorics.

• Students will have highly specialised skills in the following areas: problem solving, abstract reasoning.

Modes of Teaching, Learning and Assessment and how these contribute to the learning outcomes of the module

• Lectures demonstrate what is required to be learned and the application of the theory to practical examples.
• Subject material assigned for independent study develops the ability to acquire knowledge and understanding without dependence on lectures.
• Problem classes show how to solve example problems in an ideal way, revealing also the thought processes behind such solutions.
• Formative assessments provide feedback to guide students in the correct development of their knowledge and skills in preparation for the summative assessment.
• The end-of-year examination assesses the knowledge acquired and the ability to solve predictable and unpredictable problems.

Teaching Methods and Learning Hours

Summative Assessment

Formative Assessment:

Eight written assignments to be assessed and returned. Other assignments are set for self-study and complete solutions are made available to students.

■ Attendance at all activities marked with this symbol will be monitored. Students who fail to attend these activities, or to complete the summative or formative assessment specified above, will be subject to the procedures defined in the University's General Regulation V, and may be required to leave the University