Basic algorithms for rational function fields
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.
- Algorithms for Function Fields
- scientific article; zbMATH DE number 1273654
- Some algorithms of rational function algebra
- scientific article; zbMATH DE number 1128465
- An algorithm for computing an integral basis in an algebraic function field
- Logical Approaches to Computational Barriers
- Algorithms for quadratic forms over real function fields
- Algorithms for polynomial GCD computation over algebraic function fields
- Algorithmic Number Theory
- Algorithms for finite field arithmetic
- Recognizing simple subextensions of purely transcendental field extensions
- Gröbner bases applied to finitely generated field extensions
- The complexity of primes in computable unique factorization domains
- Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence
- Freeness, linear disjointness, and implicitization -- a classical approach.
- Computing restrictions of ideals in finitely generated \(k\)-algebras by means of Buchberger's algorithm
- Computation of unirational fields
- Rational invariants of a group action. Construction and rewriting
- Algebraic closure of a rational function
- Using basis computation to determine pseudo-multiplicative independence
- scientific article; zbMATH DE number 1254273 (Why is no real title available?)
- scientific article; zbMATH DE number 503186 (Why is no real title available?)
- scientific article; zbMATH DE number 701951 (Why is no real title available?)
- scientific article; zbMATH DE number 1163439 (Why is no real title available?)
- Algorithms for Function Fields
- Invariants: Computation and Applications
- Algorithm for globally identifiable reparametrizations of ODEs
- On multivariate rational function decomposition
- Algebraic identifiability of partial differential equation models
- Computing primitive elements of extension fields
- Realization theory for rational systems: minimal rational realizations
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)
