---
title: Logarithmic and Weighted Resolution Algorithms
url: https://www.emergentmind.com/topics/logarithmic-and-weighted-resolution-algorithms
type: topic
---

# Logarithmic and Weighted Resolution Algorithms

A logarithmic and weighted resolution algorithm refers to a class of constructive, functorial procedures for principalization and resolution of singularities in algebraic geometry, exploiting the structure of logarithmic geometry and the algebraic machinery of weighted (often stack-theoretic) blow-ups. These methods achieve dramatic reductions in complexity compared to classical approaches via smooth blow-ups, offer fully canonical (history-free) algorithms, and are compatible with ambient logarithmic and stack-theoretic structures. The central principles were systematically developed by Abramovich, Temkin, Włodarczyk, McQuillan, Quek, Schober, and others, culminating in factorial-complexity algorithms and highly structured functorial correspondences in both embedded and non-embedded contexts [2512.01859][1906.07106][2503.13341][2303.00407][2008.02169][2005.05939].

## 1. Weighted Blow-Ups and Logarithmic Structures

Weighted blow-ups generalize the classical blow-up construction by introducing a vector of positive integer (or rational) weights $w = (w_1,\dots,w_n)$ associated to regular system of parameters $(x_1,\dots,x_n)$ on a smooth affine variety $X = \Spec A$. The weight-filtration of $A$ is defined by
\[
I_m := \langle x^a = x_1^{a_1}\cdots x_n^{a_n} : \sum_i w_i a_i \ge m \rangle \subset A,
\]
and the associated Rees algebra
\[
I_w := \bigoplus_{m\ge0} I_m\, t^m \subset A[t].
\]
The weighted blow-up is then
\[
\widetilde X = \Proj I_w \longrightarrow X.
\]
For centers defined by monomials with fractional orders, stack-theoretic methods are necessary—affine charts become orbifold charts with group actions encoding the weights [2512.01859][1906.07106][2503.13341][2008.02169]. Logarithmic geometry provides a framework where these weighted blow-ups extend to log schemes or fs log stacks with extra structure, enabling functorial treatment of boundary divisors and monomial ideals via log smoothness and Kummer-étale topology [2503.13341][2303.00407][2005.05939].

## 2. Invariants, Centers, and Principalization Criteria

Central to the method is a functorial, local invariant that governs both the choice of center and the control of singularities:

- In the weighted regime, the invariant is a lexicographically ordered finite tuple of positive rationals $(a_1, a_2, \dots, a_k)$, defined recursively from the orders of vanishing and corresponding coefficient ideals (via repeated maximal contact reductions and factorial renormalizations) [1906.07106][2008.02169][2303.00407].
- In the logarithmic context, the primary invariant is the “logarithmic order,” defined as
  \[
  \logord_x(I) = \min \{ d \mid D_X^{\le d}(I)_x = \O_{X, x} \},
  \]
  where $D_X^{\le d}$ is the sheaf of log differential operators of order $\le d$ [2303.00407][2503.13341].
- For hypersurfaces, polyhedral invariants such as the Newton polygon and the Bierstone–Milman invariant are used: the Newton graph’s faces dictate the primitive inward normals defining weighted centers; the initial forms along these faces control the reduction process [2512.01859].
- The canonical center is always the subscheme where the invariant achieves its maximum value, typically a locus defined by a weighted monomial ideal or a Kummer ideal in the log-geometry setting [2512.01859][2503.13341][2005.05939].

## 3. Algorithmic Procedure and Functoriality

Resolutions proceed algorithmically as follows:

1. **Initialization:** Given $(X, D, f)$ or $(Y, D, I)$, where $D$ is a simple normal crossings divisor and $I$ the ideal to resolve.
2. **Invariant Computation:** At each step, compute the relevant invariant (lex tuple, log order, or Newton/Bierstone–Milman data).
3. **Center Selection:** Identify the canonical center—closure of the maximal-invariant locus—equipped with explicit weight data or log-structure [2512.01859][1906.07106][2503.13341].
4. **Weighted Blow-Up:** Perform the stack-theoretic weighted blow-up along the center. In codimension $>1$, quotient singularities arise, and so all constructions are done in the category of (log-)Deligne–Mumford stacks [2512.01859][2005.05939][2303.00407].
5. **Update Structures:** Pull back the divisor, transform the ideal appropriately (using weak or strict transform), and enlarge the log-structure where required to maintain log smoothness [2512.01859][2503.13341].
6. **Termination Check:** Iterate until the invariant is minimal (i.e., only normal crossings remain), guaranteeing that the transform is principal/monomial and nonsingular [1906.07106][2503.13341][2008.02169].
7. **Functoriality:** All steps are canonical, no choices are made, and functoriality under (log-)smooth morphisms is strictly preserved; centers, invariants, and blow-ups pull back compatibly [2512.01859][1906.07106][2503.13341][2303.00407][2005.05939].

## 4. Complexity and Comparative Efficiency

Weighted and logarithmic resolution algorithms offer substantial complexity improvements over classical methods. In the weighted case:
\[
N(n, r) \le (n+1)! \times r,
\]
where $n$ is the ambient dimension and $r$ is (embedded) codimension; for a hypersurface this yields the single-factorial bound $N(n,1) \le (n+1)!$, greatly improving upon doubly-exponential or tower-exponential bounds of classical Hironaka-type algorithms [2512.01859].

Empirically, computational implementations (e.g., resweighted.lib in SINGULAR) report that for complicated singularities, the number of blow-ups required by the weighted scheme is dramatically fewer than for history-dependent or smooth-center schemes. For example, in $\mathbb{A}^3$ for the singularity $x^2 + y^2 + z^3$,
- Weighted: $5$ blow-ups, $8$ charts
- Villamayor: $27$ blow-ups, $35$ charts

[2008.02169]. This suggests that in practical computation, factorial reductions transfer to observable efficiency gains.

## 5. Extensions: Higher Codimension, Stacks, and Logarithmic Settings

For ideals of arbitrary codimension, the method proceeds via principalization in an ambient smooth variety: embed $X$ into $Y$ of dimension $n+r$, apply the weighted/log resolution, restrict back, and account for quotient singularities via stack-theoretic constructions. At each stage, weighted blow-ups are performed in the category of smooth log-DM stacks; exceptional divisors are simple normal crossings in the stack sense; the stacky nature does not impede iteration or functoriality, as stacky and coarse moduli modifications are connected in the final output [2512.01859][2005.05939][2303.00407].

Logarithmic schemes and toroidal stacks enable these procedures to extend to contexts such as fs (fine-and-saturated) log schemes, toroidal Deligne–Mumford stacks, and even non-archimedean analytic spaces, provided the requisite functoriality (classically: under smooth maps, logarithmic: under log-smooth maps) [2303.00407][2005.05939]. The invariants, admissible centers, and transformations generalize to include Kummer covers, monomial ideals, and toroidal blow-ups, always preserving or restoring log smoothness and principalization properties [2503.13341][2303.00407][2005.05939].

## 6. Worked Examples and Structural Properties

Several illustrative examples clarify the algorithmic process:

- For $x^5 + x^3 y^3 + y^8 \subset \mathbb{A}^2$, the maximal order is $5$, and one weighted blow-up along $(x^{1/3}, y^{1/2})$ produces a smooth chart [2008.02169].
- In the log/toroidal context, ideals like $(t^2+u^2)$ on $(\mathbb{A}^2, u=0)$ are resolved by a single blow-up along $(t,u)$, capitalizing on the log structure [2303.00407][2503.13341].

Characteristic features of these methods include:
- Immediate improvement at every step: the maximal invariant strictly drops after each blow-up.
- Canonical (choice-free) selection of centers: centers are always at the maximal locus, and their structure is determined solely from the current singularity, not any historical data.
- Functorial behavior: algorithms and outputs depend only on the current scheme, invariant, and divisor/log-structure.
- Reduction to classical (Hironaka-type) resolution possible after destackification and toroidal normalization [2005.05939][2303.00407].

## 7. Comparative and Contextual Analysis

The main distinctions between logarithmic, weighted, and classical resolution can be summarized as follows:

| Algorithmic Class   | Invariant Type      | Centers       | Functoriality          | Complexity Bound  |
|---------------------|--------------------|---------------|------------------------|-------------------|
| Classical           | Pairs/Boundary     | Smooth        | Smooth maps            | Doubly-exponential |
| Logarithmic         | Log order          | Log centers   | Log-smooth maps        | Improved, few steps |
| Weighted            | Rational/lex tuple | Weighted, stacky | All smooth maps    | Factorial $n!$   |

Classical resolution requires bookkeeping of exceptional divisors, monomial stages, and has non-canonical center selection. Logarithmic and weighted schemes eliminate history, unify all choices under a single invariant, and operate via canonical weighted blow-ups or Kummer blowings-up, effecting principalization in far fewer steps and opening paths to generalizations across broader mathematical contexts [2512.01859][2303.00407][2005.05939].

Major open questions concern precise complexity estimates in relation to input degree and generalization to positive characteristic, where the stacky/weighted machinery does not directly apply due to wild ramification and failure of structure theorems [2503.13341][2303.00407][2005.05939].

---

Source: https://www.emergentmind.com/topics/logarithmic-and-weighted-resolution-algorithms