Department of

Mathematics


Seminar Calendar
for events the day of Thursday, May 11, 2017.

     .
events for the
events containing  

(Requires a password.)
More information on this calendar program is available.
Questions regarding events or the calendar should be directed to Tori Corkery.
      April 2017              May 2017              June 2017      
 Su Mo Tu We Th Fr Sa   Su Mo Tu We Th Fr Sa   Su Mo Tu We Th Fr Sa
                    1       1  2  3  4  5  6                1  2  3
  2  3  4  5  6  7  8    7  8  9 10 11 12 13    4  5  6  7  8  9 10
  9 10 11 12 13 14 15   14 15 16 17 18 19 20   11 12 13 14 15 16 17
 16 17 18 19 20 21 22   21 22 23 24 25 26 27   18 19 20 21 22 23 24
 23 24 25 26 27 28 29   28 29 30 31            25 26 27 28 29 30   
 30                                                                

Thursday, May 11, 2017

2:00 pm in 241 Altgeld Hall,Thursday, May 11, 2017

Noncommutative random walks and classification of compact quantum groups of Lie type

Sergey Neshveyev (University of Oslo)

Abstract: Compact quantum groups are noncommutative generalizations of compact groups. A natural problem, studied by a number of people and explicitly formulated by Woronowicz already in the 80s, is how to classify quantum groups with representation theory "looking like" that of a compact connected Lie group. I will explain a classification result for a large class of such quantum groups. The main goal, however, will be to discuss noncommutative random walks and their Poisson boundaries, which played a crucial role in obtaining that classification.

3:00 pm in 243 Altgeld,Thursday, May 11, 2017

The Complexity of Classifying Unitaries

Aristotelis Panagiotopoulos   [email] (UIUC Math)

Abstract: Classification problems occur in all areas of mathematics. Descriptive set theory provides methods for measuring the complexity of such problems. For example, using a technique developed by Hjorth, Kechris and Sofronidis proved that the problem of classifying all unitary operators of an infinite dimensional Hilbert space up to unitary equivalence is strictly more difficult than classifying graph structures on domain N up to isomorphism. In this talk I will review the basics from descriptive set theory and explain why the problem of classifying unitaries is so hard. Part of my talk will be based on recent joint work with Martino Lupini.

4:00 pm in 245 Altgeld Hall,Thursday, May 11, 2017

Faculty Discussion Session: Budget