DIMACS and The Princeton Center for Computational Intractability Joint Workshop on Geometric Complexity Theory (GCT)

July 6 - 8, 2010
Friends Center, Room 006
Princeton University

Organizers:
Peter Burgisser, University of Paderborn
Ketan Mulmuley, University of Chicago
Milind Sohoni, Indian Institute of Technology
K.V. Subrahmanyam, Chennai Mathematical Institute
Presented under the auspices of the Special Focus on Hardness of Approximation.

Workshop Program:

This is a preliminary program.

Tuesday and Wednesday, July 6 - 7, 2010

Short course on basic GCT (by Ketan Mulmuley) on the first two days of the workshop will meet at the following times:

 9:30 - 10:50  Short course

10:50 - 11:10  Tea break

11:10 - 12:30  Short course

12:30 -  2:00  Lunch break

 2:00 -  3:20  Short course

 3:20 -  3:40  Tea break

 3:40 -  5:00  Short course


Thursday, July 8, 2010

 9:00 - 10:00  Stability in geometric complexity theory
               Milind Sohoni

10:10 - 11:10  Geometric complexity theory and matrix multiplication 
               Peter Burgisser

11:10 - 11:30  Tea Break

11:30 - 12:30  Nonstandard quantum group for the Kronecker problem
               K.V. Subrahmanyam

12:30 -  2:00  Lunch break

 2:00 -  2:50  U_q(m)xU_q(n) deformations of GL(mn)-modules
               Bharat Adsul

 2:50 -  3:10  Tea Break

 3:10 -  4:00  Computing Littlewood-Richardson
               Coefficients: Algorithms and Complexity
               Hari Narayanan

 4:10 -  5:00  GCT: Littlewood-Richardson coefficients, Kronecker 
               coefficients and algorithms
               Christian Ikenmeyer

Previous: Participation
Workshop Index
DIMACS Homepage
Contacting the Center
Document last modified on June 10, 2010.