~/talk

Rank, Border Rank, Smoothable Rank and Cactus Rank

links:none on file
slides:none on file

Defines four concrete ranks for a point in P(W) relative to a variety X — usual rank, border rank, cactus rank (linear span of any finite subscheme) and smoothable rank (linear span of schemes that are limits of disjoint points). Proves inequalities and shows they coincide for r ≤ 2 and often r = 3 but fail beyond: gives an explicit S^3 C^5 example written as a limit of five distinct cubes with border rank 5, cactus and smoothable rank 6 and actual rank 9; tools: finite scheme/flat family language and ideal-theoretic descriptions in the symmetric algebra.

AI-written summary · about

  1. 0:00Introduction
  2. 2:14Rank and border rank
  3. 5:20Cactus and smoothable rank
  4. 12:21Finite schemes
  5. 21:59Subschemes
  6. 30:09Smoothable schemes
  7. 36:42Linear span properties
  8. 40:29Secant varieties
  9. 44:27Rank equality failure
  10. 49:14Border vs smoothable rank
  11. 53:15Open questions
  12. 1:00:03Q&A
~/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.