arXiv 0807.46742008-07-29math.AG

How to Compute a Puiseux Expansion

Nicholas J. Willis, Annie K. Didier, Kevin M. Sonnanburg

英文摘要：

In this paper, an explanation of the Newton-Peiseux algorithm is given. This explanation is supplemented with well-worked and explained examples of how to use the algorithm to find fractional power series expansions for all branches of a polynomial at the origin.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

An efficient method of finding a Puiseux expansion of a parametric singularity

We provide a very effective and explicit algorithm of finding a Puiseux expansion of a cuspidal singularity of a plane curve, when this singularity is given in a parametric form.

2009-12-08math.AG

Puiseux expansions and non-isolated points in algebraic varieties

We consider the problem of deciding whether a common solution to a multivariate polynomial equation system is isolated or not. We present conditions on a given truncated Puiseux series vector centered at the point ensuring that it is not isolated. In addition, in the case that the set of all common solutions of the system has dimension 1, we obtain further conditions specifying to what extent the given vector of truncated Puiseux series coincides with the initial part of a parametrization of a curve of solutions passing through the point.

2015-03-10math.AG

Irreducibility algorithm for the Weierstrass polynomials of two complex variables and the Puiseux expansions: Part[A], Part[B], Part[C]

It is very fundamental to study irreducible plane curve singularities in algebraic geometry. The contents of the paper consist of three parts, called Part[A], Part[B] and Part[C] with Good Appendix. Our aim is to prove by Part[B] and Part[C] that a complete irreducibility algorithm for the Weierstrass polynomial of two complex variables and the Puiseux expansions in Part[A] can be explicitly and rigorously computable in an elementary way, as follows. For brevity, Weierstrass polynomials may be written by W-polys throughout this paper.

2019-12-22math.AG

Puiseux power series solutions for systems of equations

We give an algorithm to compute term by term multivariate Puiseux series expansions of series arising as local parametrizations of zeroes of systems of algebraic equations at singular points. The algorithm is an extension of Newton's method for plane algebraic curves replacing the Newton polygon by the tropical variety of the ideal generated by the system. As a corollary we deduce a property of tropical varieties of quasi-ordinary singularities.

2009-12-01math.AG

Power Series Solutions of Non-Linear q-Difference Equations and the Newton-Puiseux Polygon

Adapting the Newton-Puiseux Polygon process to nonlinear q-difference equations of any order and degree, we compute their power series solutions, study the properties of the set of exponents of the solutions and give a bound for their $q-$Gevrey order in terms of the order of the original equation.

2022-10-03math.AG

Computing Puiseux series : a fast divide and conquer algorithm

Let $F\in \mathbb{K}[X, Y ]$ be a polynomial of total degree $D$ defined over a perfect field $\mathbb{K}$ of characteristic zero or greater than $D$. Assuming $F$ separable with respect to $Y$ , we provide an algorithm that computes the singular parts of all Puiseux series of $F$ above $X = 0$ in less than $\tilde{\mathcal{O}}(Dδ)$ operations in $\mathbb{K}$, where $δ$ is the valuation of the resultant of $F$ and its partial derivative with respect to $Y$. To this aim, we use a divide and conquer strategy and replace univariate factorization by dynamic evaluation. As a first main corollary, w…

2018-12-03math.AG

更多相关论文收起更多论文

计算代数曲面的Puiseux级数

Computing Puiseux Series for Algebraic Surfaces

University of Illinois at Chicago（伊利诺伊大学芝加哥分校）

本文提出了一种算法方法，用于计算代数曲面的Puiseux级数展开，该方法从曲面与坐标平面的交点出发，通过多面体方法计算法向量锥，并利用初始形式系统得到孤立解，从而确定级数展开的初始项。

2012-05-03cs.NAcs.SCmath.AG

Computing integral bases via localization and Hensel lifting

We present a new algorithm for computing integral bases in algebraic function fields of one variable, or equivalently for constructing the normalization of a plane curve. Our basic strategy makes use of the concepts of localization and completion, together with the Chinese remainder theorem, to reduce the problem to the task of finding integral bases for the branches of each singularity of the curve. To solve the latter task, in turn, we work with suitably truncated Puiseux expansions. In contrast to van Hoeij's algorithm, which also relies on Puiseux expansions (but pursues a different strate…

2021-03-09math.ACmath.AG

An algorithm for lifting points in a tropical variety

The aim of this paper is to give a constructive proof of one of the basic theorems of tropical geometry: given a point on a tropical variety (defined using initial ideals), there exists a Puiseux-valued ``lift'' of this point in the algebraic variety. This theorem is so fundamental because it justifies why a tropical variety (defined combinatorially using initial ideals) carries information about algebraic varieties: it is the image of an algebraic variety over the Puiseux series under the valuation map. We have implemented the ``lifting algorithm'' using Singular and Gfan if the base field ar…

2009-07-28math.ACmath.AG

用高斯-牛顿方法计算多项式同伦的幂级数解

The Method of Gauss-Newton to Compute Power Series Solutions of Polynomial Homotopies

University of Illinois at Chicago（伊利诺伊大学芝加哥分校）

本文探讨将高斯-牛顿方法从复浮点数算术扩展到具有复浮点数系数的截断幂级数域，通过线性化构建线性系统，并利用代数簇特性判断矩阵级数的正则性，通过块三角系统求解Hermite插值问题，展示在奇异点处使用热带代数几何方法计算Puiseux级数的应用。

2017-10-26cs.MScs.NAcs.SC