2019
DOI: 10.1016/j.jsc.2018.01.001
|View full text |Cite
|
Sign up to set email alerts
|

Effective computation of base points of ideals in two-dimensional local rings

Abstract: © 2018 Elsevier Ltd. We provide an algorithm that allows to describe the minimal log-resolution of an ideal in a smooth complex surface from the minimal log-resolution of its generators. In order to make this algorithm effective we present a modified version of the Newton-Puiseux algorithm that computes the Puiseux decomposition of a product of not necessarily reduced or irreducible elements together with their algebraic multiplicity in each factor.Peer ReviewedPostprint (author's final draft

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
2
2

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(7 citation statements)
references
References 10 publications
0
7
0
Order By: Relevance
“…One can compute the logresolution divisor of a using the algorithm from [2]. The log-resolution and its associated divisor F of a are precisely the proper birational morphism π and the divisor D from Example 2.8.…”
Section: 1mentioning
confidence: 99%
See 4 more Smart Citations
“…One can compute the logresolution divisor of a using the algorithm from [2]. The log-resolution and its associated divisor F of a are precisely the proper birational morphism π and the divisor D from Example 2.8.…”
Section: 1mentioning
confidence: 99%
“…Combining the algorithms developed in [2] and [5] with Algorithm 3.5 we may provide a method that, given a set of generators of a planar ideal a, returns the set of jumping numbers and a set of generators of the corresponding multiplier ideals. Namely, we have to perform the following steps:…”
Section: Multiplier Idealsmentioning
confidence: 99%
See 3 more Smart Citations