School of Mathematics

Barriers for rank methods in arithmetic complexity

Rafael Oliveira
University of Toronto
October 9, 2017

Arithmetic complexity is considered (for many good reasons) simpler to understand than Boolean complexity. And indeed, we seem to have significantly more lower bound techniques and results in arithmetic complexity than in Boolean complexity. Despite many successes and rapid progress, however, foundational challenges, like proving super-polynomial lower bounds on circuit or formula size for explicit polynomials, or super-linear lower bounds on explicit 3-dimensional tensors, remain elusive.

Wrapped Floer theory and Homological mirror symmetry for toric Calabi-Yau manifolds

Yoel Groman
Columbia University
October 9, 2017
Consider a Lagrangian torus fibration a la SYZ over a non compact base. Using techniques from arXiv:1510.04265, I will discuss the construction of wrapped Floer theory in this setting. Note that this setting is generally not exact even near infinity. The construction allows the formulation of a version of the homological mirror symmetry conjecture for open manifolds which are not exact near infinity.