Date: Sat, Mar 18, 2017
Time: 16:00 - 16:50
Venue: Middle Meeting Room
Title: Some recent results on ($P$ and $Q$)-polynomial association schemes
The problem of classification of ($P$ and $Q$)-polynomial association schemes posed by E. Bannai in early 1980’s is nowadays commonly regarded as one of the main research targets in algebraic combinatorics. Such schemes can be considered as a finite-analogue of compact symmetric spaces of rank 1, and, in particular, they play an important role in the modern coding and design theories, serving as underlying spaces for codes and designs. I will discuss some recent results towards the solution of Bannai's problem. This talk is based on joint work with Jack Koolen.
Slides: View slides