Expander graphs are graphs which simultaneously are both sparse
and highly connected. The theory of expander graphs received a
lot of attention in the past half a century, from both computer
science and mathematics. In recent years, a new theory of...
A 1948 theorem of de Bruijn and Erdős says that
if nn points in a projective plane do not lie all on a
line, then they determine at least n lines. More generally, Dowling
and Wilson conjectured in 1974 that for any finite set of vectors
spanning a...
Non-constructive existence proofs, which establish the existence
of objects without furnishing an efficient algorithm to produce
examples, abound in mathematics. How hard is it, computationally,
to find objects whose existence is guaranteed non...
The purpose of this talk is to explore how Lagrangian Floer
homology groups change under (non-Hamiltonian) symplectic isotopies
on a (negatively) monotone symplectic
manifold (M,ω)(M,ω) satisfying a strong non-degeneracy
condition. More precisely...
Binary neutron star mergers provide a unique probe of the
neutron star equation of state (EOS) across a wide range of
parameter space, from the zero-temperature EOS during the inspiral
to the finite-temperature EOS following the merger. In this
talk...
Mathew Barber (The Aga Khan University,
KITAB), Lorenz Nigst (The Aga Khan
University, KITAB), Sarah Bowen
Savant (The Aga Khan
University-ISMC), Peter Verkinderen (The
Aga Khan University, KITAB).
Hosted by Sabine Schmidtke (School of
Historical...
