Classification of minimal polygons with specified singularity content

From MaRDI portal
(Redirected from Publication:2106286)




Abstract: It is known that there are only finitely many mutation-equivalence classes with a given singularity content, and each of these equivalence classes contains only finitely many minimal polygons. We describe an efficient algorithm to classify these minimal polygons. To illustrate this algorithm we compute all mutation-equivalence classes of Fano polygons with a fixed basket of singularities in two examples.





Describes a project that uses

Uses Software





This page was built for publication: Classification of minimal polygons with specified singularity content

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106286)