Sep 14 – 16, 2020
Europe/Rome timezone

Algorithms for the large scale computation of Maximally-Mutable Laurent Polynomials

Sep 16, 2020, 11:00 AM
Chairman: Simonetta Abenda

Chairman: Simonetta Abenda

Scientific Programme


Giuseppe Pitton (Imperial College London)


Fano Polytopes are a family of integral lattice polytopes with important applications in Toric Geometry. Recent results in Mirror Symmetry [1] showed that it is possible to find deformation-equivalent families of Fano varieties by computing some Laurent polynomials, called Maximally-Mutable Laurent Polynomials [2], which are naturally associated to Fano Polytopes.
In this talk, I will illustrate the main challenges and the algorithms involved in the computation of Maximally-Mutable Laurent Polynomials for some families of Fano Polytopes in three dimensions.
I will also discuss the role of Machine Learning algorithms both for tuning the algorithm's parameters and for exploring the database of Maximally-Mutable Laurent Polynomials.
This is a joint work with Tom Coates and Alexander Kasprzyk.
[1] arXiv:1501.05334
[2] arXiv:1212.1785

Primary author

Giuseppe Pitton (Imperial College London)

Presentation materials

There are no materials yet.