Division and Slope Factorization of p-Adic Polynomials

被引:3
|
作者
Caruso, Xavier [1 ]
Roe, David [2 ]
Vaccon, Tristan [3 ]
机构
[1] Univ Rennes 1, F-35014 Rennes, France
[2] Univ Pittsburgh, Pittsburgh, PA 15260 USA
[3] Rikkyo Univ, JSPS, Tokyo, Japan
关键词
Algorithms; p-adic precision; Newton polygon; factorization; ALGORITHMS;
D O I
10.1145/2930889.2930898
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We study two important operations on polynomials defined over complete discrete valuation fields: Euclidean division and factorization. In particular, we design a simple and efficient algorithm for computing slope factorizations, based on Newton iteration. One of its main features is that we avoid working with fractional exponents. We pay particular attention to stability, and analyze the behavior of the algorithm using several precision models.
引用
收藏
页码:159 / 166
页数:8
相关论文
共 50 条