Course Identification

Title:

Algebraic Combinatorics

Code:

20254191

Lecturers and Teaching Assistants

Lecturers:

Dr. Sybille Rosset

TA's:

N/A

Course Schedule and Location

Year:

2025

Semester:

First Semester

When / Where:

Thursday, 13:45 - 15:30, WSoS, Rm B

First Lecture:

07/11/2024

End date:

30/01/2025

Field of Study, Course Type and Credit Points

Mathematics and Computer Science: Lecture; Elective; Regular; 2.00 points

Comments

During the semester, there will be 3 assignments. Each assignment will account for 33% of the final grade.

Prerequisites

Algebra 1

Restrictions

Participants:

No

Language of Instruction

English

Attendance and participation

Expected and Recommended

Grade Type

Numerical (out of 100)

Grade Breakdown (in %)

Interim:

60%

Final:

40%

Evaluation Type

Examination

Scheduled date 1

Date / due date

25/02/2025

Location

Ziskind, Rm 1

Time

1000-1200

Remarks

N/A

Scheduled date 2

Date / due date

13/03/2025

Location

N/A

Time

1330-1530

Remarks

Ziskind, Rm 1

Estimated Weekly Independent Workload (in hours)

N/A

Syllabus

Our course will be concerned with the application of algebra to combinatorics, loosely following after a book by R Stanley (Algebraic Combinatorics: Walks, Trees, Tableaux, and More). We will in particular discuss Catalan numbers, Young diagrams, Euler’s pentagonal theorem, and the matrix tree theorem.

Learning Outcomes

After the course, the student shall have experience applying algebra to combinatorics, and vice versa. He will have been introduced to Catalan numbers, Young diagrams and some associated identities, some partition theory, and the Matrix Tree Theorem

Reading List

N/A

Website

N/A