Symplectic Rigidity: Forms of Symplectic Rigidity

Related lectures (28)

Page 2 of 3

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

Covers the background on symplectic geometry, focusing on symplectic manifolds and canonical structures.

Covers the Weil representation, Heisenberg group actions, and symplectic group concepts.

Covers the theory of periodic orbits of Hamiltonian systems and the Conley-Zehnder index.

Explores motion graph analysis, focusing on function study and derivative interpretation.

Covers the geometry of the triangle, including inequalities, heights, and centers.

Introduces the basics of graph algorithms, covering traversal, representation, and data structures for BFS and DFS.

Explores statistical analysis of network data, covering graph structures, models, statistics, and sampling methods.

Explores automorphisms of graphs, focusing on automorphism groups, Cayley-Abels graphs, and quasi-isometry.