Paper Info
Title
Algorithmic tests for the normal crossing property
Abstract
Given a finite set of varieties in some nonsingular affine variety W. They are normal crossing if and only if at every point of W there is a regular system of. parameters such that each variety can be defined locally at the point by a subset of this parameter system. In this paper we present two algorithms to test this property. The first one is developed for hypersurfaces only, and it has a straightforward structure. The second copes with the general case by constructing finitely many regular parameter systems which are "witnesses" of the normal crossing of the varieties over open subsets of W. The ideas of the methods are applied in a computer program for resolution of singularities.
Year
DOI
Venue
2002
10.1007/978-3-540-24616-9_1
Lecture Notes in Artificial Intelligence
Field
DocType
Volume
Combinatorics,Finite set,Algorithmics,Affine variety,Resolution of singularities,Pure mathematics,Singularity,System of parameters,Hypersurface,Invertible matrix,Mathematics
Conference
2930
ISSN
Citations 
PageRank 
0302-9743
0
0.34
References 
Authors
4
1
Name
Order
Citations
PageRank
Gábor Bodnár1133.72