Unlocking Complexity: Harm Derksen on Invariant Theory & Group Actions (2025.01.28) π
Join Harm Derksen from Northeastern University as he explores the fascinating relationship between invariant theory and computational complexity, shedding light on how group actions influence problem difficulty.

CodEx Seminar
36 views β’ Jun 9, 2025

About this video
Harm Derksen (Northeastern University):
Invariant Theory and Complexity
We will consider questions about orbits for an action of a group on a vector space by linear transformation. Examples of such orbit problems are, deciding whether two elements in the vector space lie in the same orbit, or whether one orbit is contained in the closure of the other orbit. Many important problems, such as the Graph Isomorphism Problem can be formulated in this way. I will discuss various situations where these problems can be solved efficiently. There are also interesting connections to Complexity Theory.
Invariant Theory and Complexity
We will consider questions about orbits for an action of a group on a vector space by linear transformation. Examples of such orbit problems are, deciding whether two elements in the vector space lie in the same orbit, or whether one orbit is contained in the closure of the other orbit. Many important problems, such as the Graph Isomorphism Problem can be formulated in this way. I will discuss various situations where these problems can be solved efficiently. There are also interesting connections to Complexity Theory.
Video Information
Views
36
Duration
55:48
Published
Jun 9, 2025
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.