It seems that Geometric Complexity Theory requires much knowledge of pure maths such as algebraic geometry, representation theory. While I am a CS student and do NOT have classes of very abstract and pure mathematics, I am interested in this program.Is there a list of minimum knowledge for learning this theory ?   This list includes lecture notes of CS or math departments, surveys of any journal or conferences, and text books of pure math.[EDIT: Added later] Thank you for your comments.General theory of computing: I read Sipser's book with the title Introduction to the Theory of ComputationComplexity Theory :In particular, I am interested in concrete models for lower bounds of complexity. Thus I read the part of the concrete lower bounds in Arora-Barak's text book. I also have basic knowlede in the several chapers of the communication complexity book written by Nisan.Basic Mathematics : I have learnt about proof-based linear algebra such as general definition of the vector space etc and precicely argument of calculas based on epsilon-delta argument. Algebra: I have learned about definition and examples of group, ring, and field. I had a class for cs students, and have not learned about general thoery of this algebraic systems. 
Prerequisite for learning GCT
reference request;big list;survey;gct