Prof. Dr. Pascal Schweitzer (TU Darmstadt)

One of the core aims of computational research is to develop faster algorithms. Among the many methods employed for this purpose, there is one technique that plays a special role, namely the use of symmetries. Indeed, while some computational problems do not exhibit symmetries at all, for other problems, using symmetry is indispensable. Examples include commonly known puzzles with numerous underlying symmetries, such as the Rubik’s Cube and Sudoku. However, symmetries also play a vital role in many important real-world optimization tasks, such as scheduling trains or network design.

In this talk, I will give a gentle introduction to reducing computational complexity through symmetries. In other words, I will explain how symmetries can be used to speed up computation. I will also discuss how to find symmetries. Finally, I will highlight abstract techniques and ideas employed in modern symmetry detection software and how such tools are used in practice.

Throughout the talk, the concept of a group will appear naturally to help us understand collections of symmetries. In fact, the branch of mathematics that abstractly formalizes the notion of symmetries is called group theory and it is one of the cornerstones of modern algebra.

The talk will take place in Lecture Hall X-E0-001 in building X at 3pm st. eKVV