Главная
Study mode:
on
1
Introduction
2
Algorithm
3
Outline
4
Linear Groups
5
Graph isomorphism
6
Environment polynomials
7
Algorithms
8
Group Actions
9
Natural Actions
10
Gradient
11
General Theorem
12
Local Minimum
13
Moment Polytope
14
Moment Polytopes
15
Algorithm Questions
16
Conclusion
17
Open Problems
Description:
Explore the fundamental concepts of invariant theory and its applications in computer science through this lecture by Avi Wigderson from the Institute for Advanced Study. Delve into topics such as linear groups, graph isomorphism, and environment polynomials. Examine algorithms, group actions, and natural actions while understanding the importance of gradients and general theorems. Investigate local minimums, moment polytopes, and their relevance to computational problems. Conclude with a discussion on open problems and future research directions in this fascinating intersection of algebra and computer science.

Invariant Theory for Computer Scientists

Simons Institute
Add to list
0:00 / 0:00