Using resultants for SAGBI basis verification in the univariate polynomial ring

DOI10.1016/J.JSC.2004.06.002zbMATH Open1156.13300OpenAlexW2135270145MaRDI QIDQ2456591FDOQ2456591

Authors: Anna Torstensson, Hans Öfverbeck, Victor Ufnarovski 

Publication date: 19 October 2007

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

Full work available at URL: https://doi.org/10.1016/j.jsc.2004.06.002

Recommendations

• scientific article; zbMATH DE number 2019950
• scientific article; zbMATH DE number 4196114
• Canonical bases for subalgebras on two generators in the univariate polynomial ring
• A new algorithm for computing SAGBI bases up to an arbitrary degree
• SAGBI and SAGBI-Gröbner bases over principal ideal domains

zbMATH Keywords

reductionresultantsubalgebraSAGBI basisunivariate polynomial ring

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational aspects and applications of commutative rings (13P99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On Abhyankar-Moh's Epimorphism Theorem
• Canonical bases for subalgebras on two generators in the univariate polynomial ring
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the computation of minimal polynomials
• Title not available (Why is that?)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Using resultants for SAGBI basis verification in the univariate polynomial ring

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