Geometria em Lisboa
Infinite staircases in ball packing problems.
Ana Rita Pires, University of Edinburgh.
Abstract
The symplectic version of the problem of packing K balls into a ball in the densest way possible (in 4 dimensions) can be extended to that of symplectically embedding an ellipsoid into a ball as small as possible. A classic result due to McDuff and Schlenk asserts that the function that encodes this problem has a remarkable structure: its graph has infinitely many corners, determined by Fibonacci numbers, that fit together to form an infinite staircase.
This ellipsoid embedding function can be equally defined for other targets, and this talk will be about other targets for which the function has and does not have an infinite staircase. Firstly we will see how in the case when these targets have lattice moment polygons, the targets with infinite staircases seem to be exactly those whose polygon is reflexive (i.e., has one interior lattice point). Secondly, we will look at the family of one-point blowups of $CP^2$, where the answer involves self-similar behaviour akin to the Cantor set.
This talk is based on various projects, joint with Dan Cristofaro-Gardiner, Tara Holm, Alessia Mandini, Maria Bertozzi, Tara Holm, Emily Maw, Dusa McDuff, Grace Mwakyoma, Morgan Weiler, and Nicki Magill.