相关论文: Blow-up Algorithm for Sum-of-Products Polynomials …

We first introduce and study the notion of multi-weighted blow-ups, which is later used to systematically construct an explicit yet efficient algorithm for functorial logarithmic resolution in characteristic zero, in the sense of Hironaka.…

We study the problem of resolving singularities via the blow-up of the module of derivations. Our main results are a positive answer for the case of curves and log-canonical surface singularities, i.e., a finite sequence of blow-ups along…

Tensor decomposition is now being used for data analysis, information compression, and knowledge recovery. However, the mathematical property of tensor decomposition is not yet fully clarified because it is one of singular learning…

A sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem.…

In characteristic zero, we construct a canonical, functorial resolution algorithm by weighted blow-ups that strictly preserves the normal crossings (nc) locus, effectively answering Kollar's problem. Operating in full generality, our…

This article shall serve as a quick reference for somebody who needs precise information on concepts and results related to resolution of singularities. As such, it is more a technical manual than a bedtime story. Topics which are covered:…

The log canonical threshold (lct) is a fundamental invariant in birational geometry, essential for understanding the complexity of singularities in algebraic varieties. Its real counterpart, the real log canonical threshold (rlct), also…

In characteristic zero, we construct logarithmic resolution of singularities, with simple normal crossings exceptional divisor, using weighted blow-ups.

In this paper we apply Shokurov's inductive method to study terminal and canonical singularities. As an easy consequence of the Minimal Model Program we show that for any three-dimensional log terminal singularity there exists some special,…

Let f be a real or complex polynomial. We give an algorithm to compute the set of generalized critical values. The algorithm uses a finite dimensional space of rational arcs along which we can reach all generalized critical values of f.

We prove that intersection multiplicity of two plane curves defined by Fulton's axioms is equivalent to the multiplicity computed using blowup. The algorithm based on the latter is presented and its complexity is estimated. We compute for…

Bernstein-Sato polynomial of a hypersurface is an important object with numerous applications. It is known, that it is complicated to obtain it computationally, as a number of open questions and challenges indicate. In this paper we propose…

Recent work has provided compelling evidence challenging the foundational manifold hypothesis for the token embedding spaces of Large Language Models (LLMs). These findings reveal the presence of geometric singularities around polysemous…

It is shown that, for any reduced algebraic variety in characteristic zero, one can resolve all but simple normal crossings (snc) singularities by a finite sequence of blowings-up with smooth centres which, at every step, avoids points…

A Poisson mixture is one of the practically important models in computer science, biology, and sociology. However, the theoretical property has not been studied because the posterior distribution can not be approximated by any normal…

We provide an efficient method of blowing up to compute leading order contributions of the recently introduced stringy canonical forms. The method is related to the well-known Hironaka's polyhedra game, and the given algorithm is also…

Categorical resolution of singularities has been constructed in arXiv:1212.6170. It proceeds by alternating two steps of seemingly different nature. We show how to use the formalism of filtered derived categories to combine the two steps…

In this talk we discuss sector decomposition. This is a method to disentangle overlapping singularities through a sequence of blow-ups. We report on an open-source implementation of this algorithm to compute numerically the Laurent…

Recent advances have clarified theoretical learning accuracy in Bayesian inference, revealing that the asymptotic behavior of metrics such as generalization loss and free energy, assessing predictive accuracy, is dictated by a rational…

We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…