arXiv · 1703.05266
Classification of Minimal Polygons with Specified Singularity Content
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.
Explore related subjects
Keep this discovery
Daniel Cavey, Edwin Kutas. 2017-03-15. Classification of Minimal Polygons with Specified Singularity Content. https://arxiv.org/abs/1703.05266
Cite the original work for its findings. Save a collection to share your selection of sources.