School of Mathematics

The wrapped Fukaya category of an algebraic hypersurface $H$ in $(C*)^n$ is conjecturally related via homological mirror symmetry to the derived category of singularities of a toric Calabi-Yau manifold $X$, whose moment polytope is determined by the...

In a recent preprint with Sug Woo Shin (https://arxiv.org/abs/1609.04223) I construct Galois representations corresponding for cohomological cuspidal automorphic representations of general symplectic groups over totally real number fields under the...

I will discuss some recent work (mostly joint with Dan Cristofaro-Gardiner and Richard Hind) on the stabilized symplectic embedding problem for ellipsoids into balls. The main tools come from embedded contact homology.

We look at the following chain of symplectic embedding problems in dimension four. \[E(1, a) \to Z_4(A),\ E(1, a) \to C_4(A),\ E(1, a) \to P(A, ba) (b \in {\mathbb N}_{\geq 2}),\ E(1, a) \to T_4(A).\] Here $E(1, a)$ is a symplectic ellipsoid, $Z_4(A...

The intertwining wave operators are basic objects in the scattering theory of a Hamiltonian given as the sum of a Laplacian with a potential. These Hamiltonians are the classical Schroedinger operators of quantum mechanics. For the three dimensional...

Recently we proved with Durcik, Kovac, Skreb variational estimates providing sharp quantitative norm convergence results for bilinear ergodic averages with respect to two commuting transformations. The proof uses so called twisted technology...

Homological mirror symmetry postulates a derived equivalence between the wrapped Fukaya category of an exact symplectic manifold and a category of coherent sheaves or matrix factorizations on a mirror space. This talk will provide an introduction to...

Recently, a certain "monotone" version of the constraint satisfaction problem has proved an extremely useful tool for attacking problems in circuit, communication, and proof complexity theory. In this talk we discuss this version of the constraint...

Combinatorial geometry is a field that studies combinatorial problems that involve some simple geometric objects/notions, such as: lines, points, distances, collinearity. While such problems are often easy to state, some of them are very difficult...

Recently, a certain "monotone" version of the constraint satisfaction problem has proved an extremely useful tool for attacking problems in circuit, communication, and proof complexity theory. In this talk we discuss this version of the constraint...