Complexity of Triangular Representations of Algebraic Sets

2016/09/30 by Eli Amzallag, Amzallag, Eli, Gleb Pogudin +5
Mathematics · #13P10 #14Q20 #68W30 #Algebraic Geometry (math.AG) #Commutative Algebra (math.AC) #FOS: Mathematics #math.AC #math.AG #msc:13P10 #msc:14Q20 #msc:68W30

paper · pdf · doi:10.48550/arxiv.1609.09824

arxiv created 2018/09/17 · arxiv updated 2018/09/18

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.

Related

• Computing the decomposition group of a zero-dimensional ideal by elimination method
• Algorithms for Computing Triangular Decompositions of Polynomial Systems
• A Triangular Decomposition Algorithm for Differential Polynomial Systems with Elementary Computation Complexity
• Upper Bounds on Resolvent Degree via Sylvester's Obliteration Algorithm
• On the chordality of polynomial sets in triangular decomposition in top-down style