[Colloquium] Seminar Series by Ketan Mulmuley, November 5, 12 and 19, 2008

[Katie Casey]

DEPARTMENT OF COMPUTER SCIENCE

UNIVERSITY OF CHICAGO

Date: Wednesday, November 5, 12 and 19, 2008
Time: 2:30 p.m.
Place: RY 251

----------------------------------------------------------

Speaker:	Ketan Mulmuley

From:		University of Chicago

Web page:	http://www.cs.uchicago.edu/people/mulmuley

Title:  On P vs NP, Geometric Complexity theory, and the Riemann  
Hypothesis

Abstract: This series of three colloquium talks on November 5, 12 and  
19 (2.30 p.m.) will give a nontechnical, high level overview of  
geometric complexity theory (GCT), which is an approach to the P vs.  
NP problem via algebraic geometry, representation theory, and the  
theory of a new class of quantum groups, called nonstandard quantum  
groups, that arise in this approach. In particular, GCT says  that the  
P vs. NP problem in characteristic zero is intimately linked to the  
Riemann Hypothesis over finite fields. A high level view of potential  
implications in mathematics, physics and quantum computation would  
also be given. No background in algebraic geometry, representation  
theory or quantum groups would be assumed. Complementary talks in the  
logic and theory seminars on November 10 (at 2.30 p.m. and 3.45 p.m.)  
would elaborate on the basic notion of obstructions in GCT.

References for GCT:

The basic plan of GCT is given in:

GCTflip: "On P vs. NP, Geometric Complexity Theory and the Flip I:  
high level view".



It has been partially implemented in a series of papers:

GCT1 to GCT11.

GCT1 to 4: Joint with Milind Sohoni

GCT5: Joint with Hari Narayanan



GCTflip, its abstract (GCTabs), and GCT1-8 are available on the  
speaker's personal home page. GCT8-11 are under preparation.