![]() |
![]() |
Towards a generic representation theory.Add to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Chris Parker. In combinatorics, the ‘nicest’ way to prove that two sets have the same size is to find a bijection between them, giving more structure to the seeming numerical coincidences. In representation theory, many of the outstanding conjectures seem to imply that the characteristic p of the ground field can be allowed to vary, and we can relate different groups and different primes, to say that they have ‘the same’ representation theory. In this talk I will try to make precise what we could mean by this. This talk is part of the Algebra seminar series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsData Science and Computational Statistics Seminar Topology and Dynamics seminar Midlands Logic SeminarOther talksThe tragic destiny of Mileva Marić Einstein Hunt for an Earth-twin TBA TBA Quantum Sensing in Space TBA |