Matrix-F5 algorithms over finite-precision complete discrete valuation fields
Matrix-F5 algorithms over finite-precision complete discrete valuation fields
Let (f1,..., fs) ∈ Qp [X1,..., Xn]s be a sequence of homogeneous polynomials with p-adic coefficients. Such system may happen, for example, in arithmetic geometry. Yet, since Ap is not an effective field, classical algorithm does not apply.