3 problems

Let $T$ be the random tree under consideration, let $t$ denote its size parameter, and let $\operatorname{cov}_\ell(T)$ be the minimum number of paths of length at most $\ell$ need…

Logarithmic maximum-entry conjecture. With high probability,

Let $M$ be a random $k\times k$ matrix with independent standard complex Gaussian entries, where $k\geq 3$ is an integer, and let $t\geq 3$ be real. The non-integer moment growth c…