~/talk

A Study of the Representations Supported by the Orbit Closure of the Determinant

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

Compares the GL(E)-orbit closure of the determinant and the GL(E)-orbit closure of a basis-dependent permanent-like polynomial p_{m,n}, defines M̄_n (smallest m with X_perm ⊂ X_det) and MN, and shows known lower bound M̄_n is at least quadratic in n (M̄_n ≥ const·n^2, result of Landsberg–Manivel et al). Proves both cones fail normality with a large nonnormal locus, gives representation-theoretic constraints: occurring partitions vanish past index n^2+1 and have total size a multiple of m, and relates existence of obstructions to the Alon–Tarsi equivalence about Latin squares and the occurrence of the trivial SL(V)-module in S^m(S^m V).

AI-written summary · about

  1. 0:00Orbit closures and determinants
  2. 10:34Permanent and determinant varieties
  3. 21:40Variety containment limits
  4. 28:51Landsberg-Manivel-Desalvo bounds
  5. 38:06Representation challenges
  6. 47:19Latin squares and conjecture
  7. 53:35Lando-Tarsi conjecture forms
  8. 1:00:09Complexity barriers and open problems
  9. 1:05:27Orbit closures with identical representations
~/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.