All Questions
6 questions
23
votes
4
answers
4k
views
What information is contained in the Kazhdan-Lusztig polynomials?
The Kazhdan-Lusztig polynomials contain all kinds of representation theoretic (and other kinds of) informations.
For example the character of a simple module over a Lie algebra with Weyl group $W$ ...
21
votes
3
answers
7k
views
What are the current breakthroughs of Geometric Complexity Theory?
I've read from Wikipedia about Geometric Complexity Theory (GCT) which (if I understood correctly) is a program for coping with the $ P=NP $ problem using algebraic methods.
That program seems ...
18
votes
4
answers
621
views
What are immediate applications of the classification of connected reductive groups?
After years of putting it off, I finally sat down, read, and understood the classification of connected reductive groups via root data.
That's a non-trivial theory! I'm hoping that now that I am done ...
14
votes
8
answers
2k
views
Applications of the idea of deformation in algebraic geometry and other areas?
The idea of proving something by deforming the general case to some special cases is very powerful. For example, one can prove certain equalities by regarding both sides as functions/sheaves, and show ...
9
votes
1
answer
506
views
Current state of the art in geometric complexity theory
I came across this interesting question from almost 7 years ago:
What are the current breakthroughs of Geometric Complexity Theory?
My question is quite simple: Have there been any breakthroughs in ...
8
votes
1
answer
987
views
Steps in Geometric Complexity Theory
GCT purports to provide a program to show that $NP \not \subset P/poly$.
At the high level what are the steps involved in the program and what stage is each step in?
What difficulties currently are ...