Related papers: Classification of Minimal Polygons with Specified …

We classify simple parametrisations of complex curve singularities. Simple means that all neighbouring singularities fall in finitely many equivalence classes. We take the neighbouring singularities to be the ones occurring in the versal…

We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…

An algorithm for resolution of singularities in characteristic zero is described. It is expressed in terms of multi-ideals, that essentially are defined as a finite sequence of pairs, each one consiting of a sheaf of ideals and a positive…

The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding, etc. As this problem is NP-hard in general, its convex relaxation, the nuclear norm minimization…

The aim of this note is to describe the structure of finite meadows. We will show that the class of finite meadows is the closure of the class of finite fields under finite products. As a corollary, we obtain a unique representation of…

We prove that the stable endomorphism rings of rigid objects in a suitable Frobenius category have only finitely many basic algebras in their derived equivalence class and that these are precisely the stable endomorphism rings of objects…

We explicitly determine the automorphism groups of all self-similar trees (a.k.a. trees with finitely many cone types). We show that any such automorphism group is a direct limit of certain finite products of finite symmetric groups, which…

Single image-level annotations only correctly describe an often small subset of an image's content, particularly when complex real-world scenes are depicted. While this might be acceptable in many classification scenarios, it poses a…

In this paper, we describe an algorithm for computing the left, right, or 2-sided congruences of a finitely presented semigroup or monoid with finitely many classes, and an alternative algorithm when the finitely presented semigroup or…

In this thesis, we develop algorithms similar to the Gaussian elimination algorithm in symplectic and split orthogonal similitude groups. As an application to this algorithm, we compute the spinor norm for split orthogonal groups. Also, we…

In many applications involving multi-media data, the definition of similarity between items is integral to several key tasks, e.g., nearest-neighbor retrieval, classification, and recommendation. Data in such regimes typically exhibits…

Given a closed smooth manifold $M$ of even dimension $2n\ge6$ with finite fundamental group, we show that the classifying space ${\rm BDiff}(M)$ of the diffeomorphism group of $M$ is of finite type and has finitely generated homotopy groups…

Associated with isoparametric foliations of unit spheres, there are two classes of minimal surfaces $-$ minimal isoparametric hypersurfaces and focal submanifolds. By virtue of their rich structures, we find new series of minimizing cones.…

This paper investigates the equivalence reduction for several classes of multivariate polynomial matrices and their Smith forms, establishing some criteria for such reduction. In particular, we employ algebra isomorphisms as a key tool to…

The minimal log discrepancy is an invariant of singularities that plays an important role in the birational classification of algebraic varieties. Shokurov conjectured that the minimal log discrepancy can always be bounded from above in…

We present an algorithm based on continuation techniques that can be applied to solve numerically minimization problems with equality constraints. We focus on problems with a great number of local minima which are hard to obtain by local…

In this work we employ machine learning to understand structured mathematical data involving finite groups and derive a theorem about necessary properties of generators of finite simple groups. We create a database of all 2-generated…

We compute the mapping class group-valued monodromy of any sufficiently ample linear system on any smooth simply connected projective surface, identifying this with the r-spin mapping class group associated to a maximal root of the adjoint…

We classify three-dimensional Fano varieties with canonical Gorenstein singularities of degree bigger than 64.

An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large enough. Applications to the syndrome computation…