Related papers: Classification of Minimal Polygons with Specified …

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 the mutation-equivalence classes of such…

We classify Fano polygons with finite mutation class. This classification exploits a correspondence between Fano polygons and cluster algebras, refining the notion of singularity content due to Akhtar and Kasprzyk. We also introduce…

We study a subclass of K\"ahler-Einstein Fano polygons and how they behave under mutation. The polygons of interest are K\"ahler-Einstein Fano triangles and symmetric Fano polygons. In particular, we find an explicit bound for the number of…

We classify the unimodular equivalence classes of inclusion-minimal polygons with a certain fixed lattice width. As a corollary, we find a sharp upper bound on the number of lattice points of these minimal polygons.

We present algorithms for classifying rational polygons with fixed denominator and number of interior lattice points. Our approach is to first describe maximal polygons and then compute all subpolygons, where we eliminate redundancy by a…

We state a number of conjectures that together allow one to classify a broad class of del Pezzo surfaces with cyclic quotient singularities using mirror symmetry. We prove our conjectures in the simplest cases. The conjectures relate…

We determine restrictions on the singularity content of a Fano polygon, or equivalently of certain orbifold del Pezzo surfaces. We establish bounds on the maximum number of 1/R(1,1) singularities in the basket of residual singularities. In…

We study Fano threefolds with~terminal singularities admitting a "minimal" action of a finite group. We prove that under certain additional assumptions such a variety does not contain planes. We also obtain an upper bounds of the number of…

We list combinatorial criteria of some singularities, which appear in the Minimal Model Program or in the study of (singular) Fano varieties, for spherical varieties. Most of the results of this paper are already known or are quite easy…

The feasibility of a classification-by-rank program for modular categories follows from the Rank-Finiteness Theorem. We develop arithmetic, representation theoretic and algebraic methods for classifying modular categories by rank. As an…

We address the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative…

We show that the minimal log discrepancy of any isolated Fano cone singularity is at most the dimension of the variety. This is based on its relation with dimensions of moduli spaces of orbifold rational curves. We also propose a…

We consider minimal compactifications of the complex affine plane. Minimal compactifications of the affine plane with at most log canonical singularities are classified. Moreover, every minimal compactification of the affine plane with at…

In many classification tasks there is a requirement of monotonicity. Concretely, if all else remains constant, increasing (resp. decreasing) the value of one or more features must not decrease (resp. increase) the value of the prediction.…

Let $n$ be a positive integer, and let $R$ be a (possibly infinite dimensional) finitely presented algebra over a computable field of characteristic zero. We describe an algorithm for deciding (in principle) whether $R$ has at most finitely…

We characterize the smallest finite spaces with the same homotopy groups of the spheres. Similarly, we describe the minimal finite models of any finite graph. We also develop new combinatorial techniques based on finite spaces to study…

After giving a short introduction on smooth lattice polytopes, I will present a proof for the finiteness of smooth lattice polytopes with few lattice points. The argument is then turned into an algorithm for the classification of smooth…

We prove that for any e>0, there exists only finitely many e-log terminal spherical Fano varieties of fixed dimension. We also introduce an invariant of a spherical subgroup H in a reductive group G which measures how nice an equivariant…

We survey the known results about simple permutations. In particular, we present a number of recent enumerative and structural results pertaining to simple permutations, and show how simple permutations play an important role in the study…

In this article, we describe an algorithm to determine whether a permutation class C given by a finite basis B of excluded patterns contains a finite number of simple permutations. This is a continuation of the work initiated in [Brignall,…