Complexity of Triangular Representations of Algebraic Sets
Algebraic Geometry
2018-09-18 v7 Commutative Algebra
Abstract
Triangular decomposition is one of the standard ways to represent the radical of a polynomial ideal. A general algorithm for computing such a decomposition was proposed by A. Szanto. In this paper, we give the first complete bounds for the degrees of the polynomials and the number of components in the output of the algorithm, providing explicit formulas for these bounds.
Cite
@article{arxiv.1609.09824,
title = {Complexity of Triangular Representations of Algebraic Sets},
author = {Eli Amzallag and Gleb Pogudin and Mengxiao Sun and Thieu N. Vo},
journal= {arXiv preprint arXiv:1609.09824},
year = {2018}
}