Basic algorithms for rational function fields

canonical generating sets field membership Gröbner basis involution basis minimal polynomial primary decomposition rational function field subfields tag variables transcendence basis

Mathematics Subject Classification ID

Arithmetic theory of algebraic function fields (11R58) Algebraic number theory computations (11Y40) Computational methods for problems pertaining to field theory (12-08) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Symbolic computation and algebraic computation (68W30)

Review text

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.

Recommendations

Cited in

(21)

This page was built for publication: Basic algorithms for rational function fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1284279)