L4

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.

Given a set $A$ and a scalar $\lambda$, how large must the sum of dilate $A+\lambda\cdot A=\{a+\lambda a'\mid a,a'\in A\}$ be in terms of $|A|$? In this talk, we will discuss two different settings of this problem, and how they relate to each other.

• For transcendental $\lambda\in \mathbb{C}$ and $A\subset \mathbb{C}$, how does $|A+\lambda\cdot A|$ grow with $|A|$?
• For a fixed large $\lambda\in \mathbb{Z}$ and even larger prime $p$, with $A\subset \mathbb{Z}/p\mathbb{Z}$, how does the density of $A+\lambda\cdot A$ depend on the density of $A$?

Joint with David Conlon.