Related papers: Functorial flatification of proper morphisms

Resolution of singularities in positive characteristic remains a long-standing open problem in algebraic geometry. In characteristic zero, the problem was solved by Hironaka in 1964, work for which he was awarded the Fields Medal. Modern…

Our main result establishes functorial desingularization of noetherian quasi-excellent schemes over $\bfQ$ with ordered boundaries. A functorial embedded desingularization of quasi-excellent schemes of characteristic zero is deduced.…

In various applications, computers are required to compute approximations to univariate elementary and special functions such as $\exp$ and $\arctan$ to modest accuracy. This paper proposes a new heuristic for automating the design of such…

We provide isomorphism results for Hopf algebras that are obtained as graded twistings of function algebras on finite groups by cocentral actions of cyclic groups. More generally , we also consider the isomorphism problem for…

A collection of algorithms is described for numerically computing with smooth functions defined on the unit disk. Low rank approximations to functions in polar geometries are formed by synthesizing the disk analogue of the double Fourier…

We propose a Fourier-based approach for optimization of several clustering algorithms. Mathematically, clusters data can be described by a density function represented by the Dirac mixture distribution. The density function can be smoothed…

In this article, we show that a flat morphism of $k$-varieties ($\mathop{\mathrm{char}} k=0$) with locally constant geometric fibers becomes finite \'etale after reduction. When $k$ is a real closed field, we prove that such a morphism…

We describe a procedure for constructing formal normal forms of holomorphic maps with a hypersurface of fixed points, and we apply it to obtain a complete list of formal normal forms for 2-dimensional holomorphic maps tangential to a curve…

Branes and defects in topological Landau-Ginzburg models are described by matrix factorisations. We revisit the problem of deforming them and discuss various deformation methods as well as their relations. We have implemented these…

We pose a normal form of transition functions along some Levi-flat hypersurfaces obtained by suspension. By focusing on methods in circle dynamics and linearization theorems, we give a sufficient condition to obtain a normal form as a…

We construct a method by which we can calculate the precision with which an algorithm identifies the shape of a cluster. We present our results for several well known clustering algorithms and suggest ways to improve performance for newer…

We develop a general theory of extensions of flat functors along geometric morphisms of toposes, and apply it to the study of the class of theories whose classifying topos is equivalent to a presheaf topos. As a result, we obtain a…

We give a definition of a functor compactifying the functor of bundles on a surfaces. Earlier different authors have defined similar spaces as either images under a morphism or a quotient by an equivalence relation. We use the technique of…

We describe the birational correspondences, induced by the Fourier-Mukai functor, between moduli spaces of semistable sheaves on elliptic surfaces with sections, using the notion of $P$-stability in the derived category. We give explicit…

We consider random labelings of finite graphs conditioned on a small fixed number of peaks. We introduce a continuum framework where a combinatorial graph is associated with a metric graph and edges are identified with intervals. Next we…

Algorithms based on normalizing flows are emerging as promising machine learning approaches to sampling complicated probability distributions in a way that can be made asymptotically exact. In the context of lattice field theory,…

In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…

The clustering methods have been used in a variety of fields such as image processing, data mining, pattern recognition, and statistical analysis. Generally, the clustering algorithms consider all variables equally relevant or not…

For a field $k$ of characteristic $0$, we present an algorithm for deciding if a morphism $\phi:k[X_1,...,X_m]\to k[X_1,...,X_m]$ has an inverse. The algorithm also shows how to find the inverse when it exists.

We construct a stable infinity category with objects flow categories and morphisms flow bimodules; our construction has many flavors, related to a choice of bordism theory, and we discuss in particular framed bordism and the bordism theory…