Seminar series
Date
Tue, 02 Dec 2025
Time
14:00 -
15:00
Location
L4
Speaker
Noah Kravitz
Organisation
University of Oxford
How many vectors are needed to simultaneously generate $m$ complete flags in $\mathbb{R}^d$, in the worst-case scenario? A classical linear algebra fact, essentially equivalent to the Bruhat cell decomposition for $\text{GL}_d$, says that the answer is $d$ when $m=2$. We obtain a precise answer for all values of $m$ and $d$. Joint work with Federico Glaudo and Chayim Lowen.