Seminar: Graphs, Groups, Topology and Computational Complexity; WS 2024/25

Prof. Dr. Radu Curticapean (FIDS) / Prof. Dr. Clara Löh / Matthias Uschold

News

Please register on GRIPS if you want to participate in this seminar: GRIPS course for this seminar
The seminar programme is available on GRIPS. Please select your preferences for talks by September 4, 2024. If you don't yet have access to GRIPS, you may send an email to matthias.uschold@ur.de .
The organisational meeting for this seminar: Mo, 22.07., 12:00, via zoom: zoom https link, Meeting ID: 692 8229 1452 Passcode: 587001
Registration: through the GRIPS registration form (tba).
This seminar will be held in English. The written report can be in English or German. The handouts should be in English.

Seminar: Graphs, Groups, Topology and Computational Complexity

This seminar for students of mathematics and computer science studies the intersection of graph theory and computational complexity theory, using techniques from group theory and topology to tackle problems arising in this area. The seminar starts with introductory talks. Then we focus on the following problems:

The graph isomorphism problem
Evasiveness conjecture

Several talks will also be suitable for students in the Lehramt Gymnasium track.

Time/Location

Wednesday, 8:00(?)--10:00, M101

Material

Overview
LaTeX template for handouts: .tex, .pdf
LaTeX template for reports: .tex, .pdf
Admin and preparation
Hints on writing mathematical texts (in German)
More such hints
Small print on slide talks

Prerequisites

This seminar is suitable for students with an interest in graph theory, groups, topology, and algorithmic aspects; several talks will also be suitable for students in the Lehramt Gymnasium track. This seminar could be the starting point for a project under my supervision (e.g., bachelor thesis, Zulassungsarbeit).

Basic knowledge on groups, analysis, and topology is perfectly sufficient.

Formalities/Credits

See the commented list of courses.

Last Change: August 20, 2024.