All Questions

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 ...

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 ...

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 ...

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 ...

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 ...

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$ ...