Pretropisms are candidates for the leading exponents of Puiseux series that represent positive dimensional solution sets of polynomial systems. We propose a new algorithm to both horizontally and vertically prune the tree of edges of a tuple of Newton polytopes. We provide experimental results with our preliminary implementation in Sage that demonstrates that our algorithm compares favorably to the definitional algorithm.
CITATION STYLE
Sommars, J., & Verschelde, J. (2016). Pruning algorithms for pretropisms of newton polytopes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9890 LNCS, pp. 489–503). Springer Verlag. https://doi.org/10.1007/978-3-319-45641-6_31
Mendeley helps you to discover research relevant for your work.