
Geometry, Topology, and Physics Seminar, Winter 2020
Organizers:
Dave Morrison and
Zhenghan Wang.
Meets 4:00  5:30 p.m.
on selected
Fridays in South Hall 6635.
Other Quarters: [
Spring, 2020;
Winter, 2020;
Fall, 2019;
Spring, 2018;
Winter, 2018;
Fall, 2017;
Spring, 2017;
Wnter, 2017;
Fall, 2016;
Spring, 2016;
Winter, 2016;
Fall, 2015;
Spring, 2015;
Winter, 2014;
Fall, 2013;
Fall, 2012;
Fall, 2011;
Winter, 2011;
Spring, 2010;
Winter, 2010;
Fall, 2009;
Spring, 2009;
Winter, 2009;
Fall, 2008;
Spring, 2008;
Winter, 2008;
Fall, 2007;
Spring, 2007;
Winter, 2007;
Fall, 2006
]
January 10 
Marek Filakovský (IST Austria)
We consider the following decision problem EMBED(k,d) in computational topology (where k \leq d are fixed positive integers): Given a finite simplicial complex K of dimension k, does there exist a (piecewiselinear) embedding of K into R^d?
The special case EMBED(1,2) is graph planarity, which is decidable in linear time, by the wellknown algorithm of Hopcroft and Tarjan.
In higher dimensions, EMBED(2,3) and EMBED(3,3) are known to be decidable (as well as NPhard), and recent results of Čadek et al., in combination with a classical theorem of Haefliger and Weber, imply that EMBED(k,d) can be solved in polynomial time for any fixed pair (k,d) of dimensions in the socalled \emph{metastable range} $d\geq (3(k+1))/2$.
Here, by contrast, we prove that EMBED(k,d) is algorithmically undecidable for almost all pairs of dimensions outside the metastable range, namely for $8\leq d<\floor{(3(k+1))/2}$. This almost completely resolves the decidability vs.\ undecidability of EMBED(k,d) in higher dimensions and establishes a sharp dichotomy between polynomialtime solvability and undecidability.
Our proof builds on work by Čadek et al., who showed how to encode an arbitrary system of Diophantine equations into a homotopytheoretic extension problem. We turn their construction into an embeddability problem, using techniques from piecewiselinear (PL) topology due to Zeeman, Irwin, and others.

January 24 
Theo JohnsonFreyd (Perimeter Institute)
The elliptic genus is a powerful deformation invariant of 2D SQFTs: if it is nonzero, then it protects the SQFT from admitting a deformation to one with spontaneous supersymmetry breaking. I will describe a "secondary" invariant, defined in terms of mock modularity, that goes beyond the elliptic genus, protecting SQFTs with vanishing elliptic genus. The existence of this invariant supports the hypothesis that the space of minimally supersymmetric 2D SQFTs provides a geometric model for universal elliptic cohomology. Based on joint works with D. Gaiotto and E. Witten.
Audio;
Lecture notes,

February 24 
Joint meeting with Differential Geometry seminar: 2:00 p.m.
Yongbin Ruan (Zhejiang University)
One of biggest and most difficult problems in the subject of GromovWitten theory is to compute higher genus GromovWitten invariants of compact CalabiYau 3fold such as the quintic 3folds. There have been a collection of remarkable conjectures from physics (BCOV Bmodel) regarding the universal structure or axioms of higher genus GromovWitten theory of CalabiYau 3folds. In the talk, I will first explain 4 BCOV axioms explicitly for the quintic 3folds. Then, I will outline a solution for 3+1/2 of them. This talk is based on the joint works with Q. Chen, F. Janda and S. Guo.

March 6 
Azat M. Gainutdinov (Institut DenisPoisson, CNRS, Université de Tours)
The famous ReshetikhinTuraev construction of 3d TQFTs has as an input data a modular tensor category that is assumed to be semisimple. In middle of 90's Lyubashenko has proposed a reasonable nonsemisimple version of modular categories and it was later shown that they produce mapping class group representations with new features not present in the RT construction. Examples of such categories are given by small quantum groups. However, a proper TQFT construction for Lyubashenko's theory was missing. In this talk, I will present our recent construction that provides such TQFTs with input data given by any not necessarily semisimple modular category over a field.


