A completion procedure for computing canonical basis for a k-Subalgebra

Authors:
D. Kapur;K. Madlener
Affiliations:
-;-
Venue:
Proceedings of the third conference on Computers and mathematics
Year:
1989

Citing 0
Cited 12

Canonical subalgebraic bases in non-commutative polynomial rings

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Regular Gröbner bases

Journal of Symbolic Computation
SAGBI bases under composition

Journal of Symbolic Computation
Reduction of permutation-invariant polynomials

Information and Computation
Computing modular invariants of p-groups

Journal of Symbolic Computation
Applications of SAGBI-bases in dynamics

Journal of Symbolic Computation - Special issue: Algebra and computer analysis
Cited References

Computer algebra handbook
Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Using symmetries in the eigenvalue method for polynomial systems

Journal of Symbolic Computation
Using resultants for SAGBI basis verification in the univariate polynomial ring

Journal of Symbolic Computation
Computing restrictions of ideals in finitely generated k-algebras by means of Buchberger's algorithm

Journal of Symbolic Computation
Converting subalgebra bases with the Sagbi walk

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract