scientific article; zbMATH DE number 1254273
From MaRDI portal
Publication:4227322
Let \(k\) be a field and \(k(x)\) its rational function field. A result of of Lüroth states that all intermediate fields of the extension \(k(x):k\) are simple. For elements \(p,q \in k(x)\), the paper introduces a fast Euclidean algorithm to compute a generator of \(k(p,q)\). An extended version of the algorithm allows one to express the generator in terms of \(p\) and \(q\). Moreover, if \(k\) has zero characteristic, the author presents a fast method to compute the generator of \(k(p) \cap k(q)\). For the entire collection see [Zbl 0903.00081].
Recommendations
Cited in
(12)- Fast reduction of algebraic lattices over cyclotomic fields
- Fast Hermite interpolation and evaluation over finite fields of characteristic two
- Rational solutions of first-order algebraic ordinary difference equations
- Generally rational polynomials in two variables
- Lattices Over Eisenstein Integers for Compute-and-Forward
- Fast Computation of the Nth Term of an Algebraic Series over a Finite Prime Field
- Asymptotes and perfect curves
- Fast Zeta Transforms for Lattices with Few Irreducibles
- Algorithms for computing maximal lattices in bilinear (and quadratic) spaces over number fields
- A proof of a theorem by Fried and MacRae and applications to the composition of polynomial functions
- On the problem of separating variables in multivariate polynomial ideals
- Rational solutions of ordinary difference equations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4227322)