Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6861215 | Journal of Symbolic Computation | 2018 | 13 Pages |
Abstract
Based on an idea in Hironaka's proof of resolution of singularities, we present an algorithm for determining smoothness of algebraic varieties. The algorithm is inherently parallel and does not involve the calculation of codimension-sized minors of the Jacobian matrix of the variety. We also describe a hybrid method which combines the new method with the Jacobian criterion, thus making use of the strengths of both approaches. We have implemented all algorithms in the computer algebra system Singular. We compare the different approaches with respect to timings and memory usage. The test examples originate from questions in algebraic geometry, where the use of the Jacobian criterion is impractical due to the number and size of the minors involved.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Janko Böhm, Anne Frühbis-Krüger,