~/talk

Dealing with Orbit Closures in Representations with Finitely Many Orbits

Talkat Geometric Complexity Theory 2014 · 2014-09-15..09-19
links:none on file
slides:none on file

Classifies irreducible representations whose action has finitely many orbits, identifies the relevant graded piece G1 (examples like ∧^3 C^7), and converts each orbit closure into a vector-bundle desingularization over a Grassmannian to study normality, Hilbert series, rational singularities and minimal free resolutions. Methods combine cohomology calculations, Euler characteristic bounds, and computer algebra (Macaulay2) plus Eisenbud’s exactness criterion to prove expected complexes in many E6/E7 cases; E8 remains too large for current computations.

AI-written summary · about

  1. 0:00Introduction and wish list
  2. 10:48Orbits and representation
  3. 17:10Classification and examples
  4. 24:53Orbit classification methods
  5. 30:57Singularities and resolutions
  6. 39:23Exactness and applications
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.