Basic algorithms for rational function fields (Q1284279)

Using Gröbner basis techniques the authors describe algorithms for solving various problems concerning subfields \({\mathbb{K}}({g}) = {\mathbb{K}}(g_1, \dots, g_m)\) of a rational function field \({\mathbb{K}}({x}) = {\mathbb{K}}(x_1, \dots, x_n)\): Computation of a canonical generating set of \({\mathbb{K}}({g})\), decide membership \(f \in {\mathbb{K}}({g})\) for \(f \in {\mathbb{K}}({x})\) and find all representations of \(f\) in \({g}\) in the affirmative case. Determination of the transcendence degree \(t\) of \({\mathbb{K}}({ x})\) over \({\mathbb{K}}({g})\), the algebraic and separability degree of \({\mathbb{K}}({x})\) over \({\mathbb{K}}({g})\) in case \(t = 0\), computation of a (separating) transcendence basis for \({\mathbb{K}}({x})\) over \({\mathbb{K}}({g})\) in case \(t > 0\). Decision of whether \(f \in {\mathbb{K}}({x})\) is algebraic over \({\mathbb{K}}({g})\), computation of its minimal polynomial in the algebraic case. Given \(f \in {\mathbb{K}}({a}, {x})\) and \({\mathbb{K}}\) algebraically closed, decide whether there is a specialization \({a} \rightarrow {\mathbb{K}}^v\) of the variables \({a}\) of \(f\) which yields an element of \({\mathbb{K}}({g})\). In their algorithms the authors make use of an ideal in \({\mathbb{K}}({g})[{Z}]\), (partly) avoiding the introduction of tag variables. The last section contains a short discussion of some practical considerations.