Minimality and mutation-equivalence of polygons

We introduce a concept of minimality for Fano polygons. We show that, up to mutation, there are only finitely many Fano polygons with given singularity content, and give an algorithm to determine representatives for all mutation-equivalence classes of such polygons. This is a key step in a program t...

Cijeli opis

Bibliografski detalji
Glavni autori: Prince, T, Kasprzyk, A, Nill, B
Format: Journal article
Jezik:English
Izdano: Cambridge University Press 2017