Standard bases and some computations in rings of power series (Q921065)

Let \(K[[X_ 1,...,X_ n]]\) be the ring of formal power series over a field K in n indeterminates. Let T be the set of all terms in \(X_ 1,...,X_ n\) and denote by \(<\) an admissible term order. For every power series f, and every term t, c(t,f) denotes the coefficient of t in f; T(f) stands for all terms in f and LT(f) is the least element of T(f) with respect to \(<\). For a subset of \(K[[X_ 1,...,X_ n]]\), \(LT(S)=LT(f)| f\in S\). The author points out that there is no general proof for Hironaka's theorem for both arbitrary field and arbitrary admissible order. The Hironaka theorem goes as follows: Let \(I\subset K[[X_ 1,...,X_ n]]\), an ideal. Then there exists a finite set \(S\subset I\) such that for every f in I, there is g in S with LT(g)\(| LT(f)\). Any such S is a basis of I (called a standard basis). For any power series f and any standard basis \(S=g_ 1,...,g_ m\) of I, there exists a unique power series r such that \((1)\quad f=\sum^{m}_{i=1}g_ iq_ i+r\) \((q_ i\in K[[X_ 1,...,X_ n]]\); \((2)\quad for\) all \(s\in LT(S)\), \(t\in T(r):s| t.\) The author also states that some definitions of a standard basis are equivalent in case of formal power series rings. The proof of both results are given in the paper. The method of reduction of polynomials by an ideal basis is adapted to this case, leading to a proof by \(\lambda\)- induction. The main interest is in admissible orders, not being of type \(\omega\). The author entirely focuses on the lexicographical order. It is explained what ``effective calculation'' stands for in this case. The main part of the paper deals with a special case: division by a principal ideal, so that the problem of calculation a standard basis from any basis disappears. Further, an algorithm to compute the Hironaka remainder of a power series modulo a principal ideal with respect to the lexicographical term order is given.