In quantum complexity theory, QMA and QCMA represent two
different generalizations of NP. Both are defined as sets of
languages whose Yes instances can be efficiently checked by a
quantum verifier that is given a witness. With QMA the witness can
be...
Kaledin established a Cartier isomorphism for cyclic homology of
dg-categories over fields of characteristic p, generalizing a
classical construction in algebraic geometry. In joint work with
Paul Seidel, we showed that this isomorphism and related...
In this talk, I will present several a priori interior and
boundary trace estimates for the 3D incompressible Navier–Stokes
equation, which recover and extend the current picture of higher
derivative estimates in the mixed norm. Then we discuss the...
Quasars at cosmic dawn are powerful probes to the formation and
growth of early supermassive black holes in the universe, their
connections to high-redshift galaxy and structure formation, and
the evolution of the intergalactic medium at the epoch...
Expander graphs are a staple of theoretical computer science.
These are graphs which are both sparse and well connected. They are
simple to construct and modify. Therefore they are a central gadget
in numerous applications in TCS and combinatorics...
Muon colliders offer a unique path to multi-TeV, high-luminosity
lepton collisions. Muon collisions with a center-of-mass energy of
10 TeV or above would offer significant discovery potential where
the constituent collision energies exceed those of...
Ohta described the ordinary part of the 'etale cohomology of
towers of modular curves in terms of Hida families. Ohta's approach
crucially depended on the one-dimensional nature of modular curves.
In this talk, I will present joint work with Chris...
A class of tensors, called "concise (m,m,m)-tensors of
minimal border rank", play an important role in proving upper
bounds for the complexity of matrix multiplication. For that reason
Problem 15.2 of "Algebraic Complexity Theory" by Bürgisser...
This colloquium will explore some fundamental issues in the
mathematics of plasmas, focusing on the stability and instability
of solutions to Vlasov-type equations, which are crucial for
describing the behavior of charged particles in a plasma. A...
A dot-product proof is a simple probabilistic proof system in
which the verifier decides whether to accept an input vector based
on a single linear combination of the entries of the input and a
proof vector. I will present constructions of linear...
