Basic algorithms for rational function fields

DOI10.1006/JSCO.1998.0246MaRDI QIDQ1284279zbMATH OpenOpenAlexFDO

Authors Joern Mueller-Quade, Rainer Steinwandt

Publication date 7 May 2000

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jsco.1998.0246

zbMATH Keywords

canonical generating setsfield membershipGröbner basisinvolution basisminimal polynomialprimary decompositionrational function fieldsubfieldstag variablestranscendence basis

Mathematics Subject Classification ID

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

Recommendations

• 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

Cited in

(21)

• 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)