首页/论文/2007.09449

arXiv 2007.094492020-07math.AG

A generalization of the Newton-Puiseux algorithm for semistable models

Paul Alexander Helminck

备注：: 45 pages, 7 figures

英文摘要：

In this paper we give an algorithm that calculates the skeleton of a tame covering of curves over a complete discretely valued field. The algorithm relies on the {tame simultaneous semistable reduction theorem}, for which we give a short proof. To use this theorem in practice, we show that we can find extensions of chains of prime ideals in normalizations using compatible power series. This allows us to reconstruct the skeleton of the covering. In studying the connections between power series and extensions of prime ideals, we obtain generalizations of classical theorems from number theory such as the Kummer-Dedekind theorem and Dedekind's theorem for cycles in Galois groups.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Tropical Newton-Puiseux polynomials II

Tropical Newton-Puiseux polynomials defined as piece-wise linear functions with rational coefficients at the variables, play a role of tropical algebraic functions. We provide explicit formulas for tropical Newton-Puiseux polynomials being the tropical zeroes of a univariate tropical polynomial with parametric coefficients.

2021-10-20math.AG

Tropical Newton-Puiseux polynomials

We introduce tropical Newton-Puiseux polynomials admitting rational exponents. A resolution of a tropical hypersurface is defined by means of a tropical Newton-Puiseux polynomial. A polynomial complexity algorithm for resolubility of a tropical curve is designed. The complexity of resolubility of tropical prevarieties of arbitrary codimensions is studied. Tropical Newton-Puiseux rational functions are introduced, and we prove that any tropical polynomial has a resolution in tropical Newton-Puiseux rational functions (this can be treated as a tropical analog of the algebraic closedness of the f…

2018-08-27math.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

Multivariable Newton-Puiseux Theorem for Generalised Quasianalytic Classes

We show how to solve explicitly an equation satisfied by a real function belonging to certain general quasianalytic classes. Examples of the classes under consideration are the collection of convergent generalised power series, a class of functions which contains some Dulac Transition Maps of real analytic planar vector fields, quasianalytic Denjoy-Carleman classes and the collection of multisummable series.

2014-05-11math.AG

Newton-Puiseux algorithm and triple points for planes curves

The paper is an introduction to the use of the classical Newton-Puiseux procedure, oriented to an algorithmic description of it. This procedure enables to get polynomial approximations for parameterizations of branches of an algebraic plane curve at a singular point. We look for an approach that can be easily grasped and almost self contained. We illustrate the use of the algorithm, first in a completely worked out example of a curve with a point of multiplicity 6, and secondly in the study of triple points on reduced plane curves.

2022-06-13math.AG

Newton-Puiseux Roots of Jacobian Determinants

Let $f(x,y), g(x,y)$ denote either a pair of holomorphic function germs, or a pair of monic polynomials in $x$ whose coefficients are Laurent series in $y$. A relative polar arc is a Newton-Puiseux root, $x=γ(y)$, of the Jacobian $J=f_yg_x-f_xg_y$. We define the tree-model, $T(f,g)$, for the pair, using the contact orders of the Newton-Puiseux roots of $f$ and $g$. We then describe how the $γ$'s climb, and where they leave, the tree. We shall also show by two examples that the way the $γ$'s leave the tree is not an invariant of the tree; this phenomenon is in sharp contrast to that in the one …

2002-11-26math.AG

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

Variations on inversion theorems for Newton-Puiseux series

Let $f(x,y)$ be a complex irreducible formal power series without constant term. One may solve the equation $f(x,y)=0$ by choosing either $x$ or $y$ as independent variable, getting two finite sets of Newton-Puiseux series. In 1967 and 1968, Abhyankar and Zariski published proofs of an \emph{inversion theorem}, expressing the \emph{characteristic exponents} of one set of series in terms of those of the other ones. In fact, a more general theorem, stated by Halphen in 1876 and proved by Stolz in 1879, relates also the \emph{coefficients} of the characteristic terms of both sets of series. This …

2016-12-12math.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

How to Compute a Puiseux Expansion

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.

2008-07-29math.AG

Adapted coordinates in two dimensions and a proof of Puiseux's theorem

A method for finding Puiseux series goes back to Isaac Newton, which gives the terms of Puiseux series through an infinite recursive process; an additional argument is then used to show that the resulting Puiseux series are convergent. This paper provides an argument based on Newton's method and some ideas from resolution of singularities that gives a quick proof of both the existence and convergence of Puiseux series. It is then shown that similar ideas can be used to give a short proof of the existence of smooth adapted coordinates for oscillatory integrals in two dimensions, a result first …

2008-09-21math.AGmath.CA

Enriched Riemann Sphere, Morse Stability and Equi-singularity in $\mathcal{O}_2$

The \textit{Enriched Riemann Sphere} $\C P_*^1$ is $\C P^1$ plus a set of \textit{infinitesimals}, having the Newton-Puiseux field $\F$ as coordinates. Complex Analysis is extended to the $\F$-\textit{Analysis} (\textit{Newton-Puiseux Analysis}). The classical \textit{Morse Stability Theorem} is also extended; the \textit{stability idea} is used to formulate an \textit{equi-singular deformation theorem} in $\C\{x,y\}(=\mathcal{O}_2)$.

2009-07-01math.AG

关于 (n+1) 空间中分支的解析等价性

On the analytic equivalence of branches in (n+1)-space

Universidade Estadual de Maringá（马里加州立大学）

研究在固定半群下，Mather A 群作用时 (n+1) 空间中不可约曲线的 Newton-Puiseux 参数化，建立保持 Newton-Puiseux 形式的参数消去准则，推广平面曲线已知结果。

2026-06-17math.AG

The Newton polygons of overconvergent F-crystals

R. Crew conjectured that every overconvergent F-isocrystal over k((t)) (k a field of positive characteristic) is quasi-unipotent (equivalently, potentially semistable), and so has ``generic'' and ``special'' Newton polygons. It is easy to construct a Newton polygon for an arbitrary overconvergent F-crystal that coincides with the generic Newton polygon for potentially semistable crystals. We give an analogous construction for the special Newton polygon, by showing that the F-crystal can be trivialized over a large auxiliary ring. In a subsequent preprint, we use this construction to prove the …

2001-06-22math.AG

Solvability of Equations by Quadratures and Newton's Theorem

Picard--Vessiot theorem (1910) provides a necessary and sufficient condition for solvability of linear differential equations of order $n$ by quadratures in terms of its Galois group. It is based on the differential Galois theory and is rather involved. J.Liouville in 1839 found an elementary criterium for such solvability for $n=2$. J.F.Ritt simplified Liouville's theorem (1948). In 1973 M. Rosenlicht proved a similar criterium for arbitrary $n$. Rosenlicht work relies on the valuation theory and is not elementary. In these notes we show that the elementary Liouville--Ritt method based on dev…

2018-09-21math.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

Constructive proof of extended Kapranov theorem

Kapranov Theorem is a well known generalization of Newton-Puiseux theorem for the case of several variables. This theorem is stated mainly in the context of tropical geometry. We present a new, constructive proof, that also characterizes the possible principal terms of points in a hypersurface contained in the algebraic torus $(K^*)^n$.

2008-10-27math.ACmath.AG