相关论文: On the algebraicity of Puiseux series

We deal with the algebraicity of an iterated Puiseux series in several variables in terms of the properties of its coefficients. Our aim is to generalize to several variables the results from [HM15]. We show that the algebraicity of such a…

Given a power series in finitely many variables that is algebraic over the corresponding polynomial ring over a subfield of the reals, we show that its convergence domain is semialgebraic over the real closure of the subfield. This gives in…

We explain how to encode an algebraic series by finite data and how to do effective arithmetic on the level of these encodings. The reasoning is based on the Newton-Puiseux algorithm and an effective equality test for algebraic series.…

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…

In this paper we study systems of autonomous algebraic ODEs in several differential indeterminates. We develop a notion of algebraic dimension of such systems by considering them as algebraic systems. Afterwards we apply differential…

Given a real polynomial function and a point in its zero locus, we defined a set consisting of algebraic real Puiseux series naturally attached to these data. We prove that this set determines the topology and the geometry of the real…

Let $K$ be a field of characteristic zero. We deal with the algebraic closure of the field of fractions of the ring of formal power series $K[[x_1,\ldots,x_r]]$, $r\geq 2$. More precisely, we view the latter as a subfield of an iterated…

We study polynomials with coefficients in a field L as dynamical systems where L is any algebraically closed and complete ultrametric field with dense valuation group and characteristic zero residual field. We give a complete description of…

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.…

A molecule is a nonzero non-unit element of an integral domain (resp., commutative cancellative monoid) having a unique factorization into irreducibles (resp., atoms). Here we study the molecules of Puiseux monoids as well as the molecules…

Given an algebraic variety we get Puiseux type parametrizations on suitable Reinhardt domains. These domains are defined using the amoeba of hypersurfaces containing the discriminant locus of a finite projection of the variety.

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…

We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…

An explicit expression for the cofactor related to an irreducible invariant algebraic curve of a polynomial dynamical system in the plane is derived. A sufficient condition for a polynomial dynamical system in the plane to have a finite…

In this paper, we study the algebraic, rational and formal Puiseux series solutions of certain type of systems of autonomous ordinary differential equations. More precisely, we deal with systems which associated algebraic set is of…

A relationship between Puiseux series satisfying an ordinary differential equation corresponding to a polynomial dynamical system and degrees of irreducible invariant algebraic curves is studied. A bound on the degrees of irreducible…

In this paper, a semigroup algebra consisting of polynomial expressions with coefficients in a field $F$ and exponents in an additive submonoid $M$ of $\mathbb{Q}_{\ge 0}$ is called a Puiseux algebra and denoted by $F[M]$. Here we study the…

We prove that the binary complexity of solving ordinary polynomial differential equations in terms of Puiseux series is single exponential in the number of terms in the series. Such a bound was given by Grigoriev [10] for Riccatti…

Puiseux series are power series in which the exponents can be fractional and/or negative rational numbers. Several computer algebra systems have one or more built-in or loadable functions for computing truncated Puiseux series -- perhaps…

We give a criterion when a polynomial $x^n-g$ is irreducible over a pseudofinite field. As an application we give an explicit description of algebraic closure of some pseudofinite fields of zero characteristic.