Computing Puiseux Series for Algebraic Surfaces

Abstract

In this paper we outline an algorithmic approach to compute Puiseux series expansions for algebraic surfaces. The series expansions originate at the intersection of the surface with as many coordinate planes as the dimension of the surface. Our approach starts with a polyhedral method to compute cones of normal vectors to the Newton polytopes of the given polynomial system that defines the surface. If as many vectors in the cone as the dimension of the surface define an initial form system that has isolated solutions, then those vectors are potential tropisms for the initial term of the Puiseux series expansion. Our preliminary methods produce exact representations for solution sets of the cyclic $n$-roots problem, for $n=m^2$, corresponding to a result of Backelin.

accepted for presentation at ISSAC 2012

References in corpus (2)

• Construction, classification and parametrization of complex Hadamard matrices
• Polyhedral Methods for Space Curves Exploiting Symmetry Applied to the Cyclic n-roots Problem

Cited by in corpus (7)

• Accelerating Polynomial Homotopy Continuation on a Graphics Processing Unit with Double Double and Quad Double Arithmetic
• Computing Pretropisms for the Cyclic n-Roots Problem
• Solving Polynomial Systems in the Cloud with Polynomial Homotopy Continuation
• Polyhedral Methods for Space Curves Exploiting Symmetry Applied to the Cyclic n-roots Problem
• The Method of Gauss-Newton to Compute Power Series Solutions of Polynomial Homotopies
• Computing all Affine Solution Sets of Binomial Systems
• Elimination for generic sparse polynomial systems