Proof complexity studies the problem computer scientists and
mathematicians face every day: given a statement, how can we prove
it? A natural and well-studied question in proof complexity is to
find upper and lower bounds on the length of the...
In joint work with Buryak, Pandharipande and Tessler (in
preparation), we define equivariant stationary descendent integrals
on the moduli of stable maps from surfaces with boundary to
$(\mathbb{CP}^1,\mathbb{RP}^1)$. For stable maps of the disk...
We will give a brief overview of the classical topics, problems and
results in Algebraic Combinatorics. Emerging from the
representation theory of $S_n$ and $GL_n$, they took a life on
their own via the theory of symmetric functions and Young...
A martingale is a sequence of random variables that maintain
their future expected value conditioned on the past. A
$[0,1]$-bounded martingale is said to polarize if it converges in
the limit to either $0$ or $1$ with probability $1$. A
martingale...
