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

[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+basis&go=Go Gr��bner basis]minimal polynomialprimary decompositionsubfieldstranscendence basisrational function fieldcanonical generating setsfield membershipinvolution basistag variables

Mathematics Subject Classification ID

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

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

(16)

• Computation of unirational fields
• scientific article; zbMATH DE number 1163439 (Why is no real title available?)
• Rational invariants of a group action. Construction and rewriting
• Using basis computation to determine pseudo-multiplicative independence
• Recognizing simple subextensions of purely transcendental field extensions
• Algorithm for globally identifiable reparametrizations of ODEs
• Algorithms for Function Fields
• Gröbner bases applied to finitely generated field extensions
• On multivariate rational function decomposition
• Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence
• Realization theory for rational systems: minimal rational realizations
• Invariants: Computation and Applications
• Algebraic closure of a rational function
• Computing primitive elements of extension fields
• The complexity of primes in computable unique factorization domains
• Computing restrictions of ideals in finitely generated \(k\)-algebras by means of Buchberger's algorithm

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)