2000 character limit reached
On the algebraicity of Puiseux series
Published 17 Mar 2015 in math.AC | (1503.04965v2)
Abstract: We deal with the algebraicity of a Puiseux series in terms of the properties of its coefficients. We show that the algebraicity of a Puiseux series for given bounded degree is determined by a finite number of explicit polynomial formulae. Conversely, given a vanishing polynomial, there is a closed-form formula for the coefficients of the series in terms of the coefficients of the polynomial and of an initial part of the series.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.