Preview
Unable to display preview. Download preview PDF.
References
J.APEL, W.LASSNER An algorithm for calculations in envelopping fields of Lie algebras, (1985), to appear in J. Symb. Comp.
J.APEL, W.LASSNER Computation of reduced Groebner bases and syzygies in envelopping algebras, (1986), Proc. SYMSAC'86
B.BUCHBERGER Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal, Ph. D. Thesis, Innsbruck, (1965)
B. BUCHBERGER Ein algorithmisches Kriterium fuer die Loesbarkeit eines algebraischen Gleichungssystems, Aeq. Math. 4 (1970), 374–383
B. BBUCHBERGER A criterion for detecting unnecessary reductions in the construction of Groebner bases, Proc. EUROSAM'79, L. N. C. S. 72 (1979), 3–21
B.BUCHBERGER Groebner bases: an algorithmic method in polynomial ideal theory, in N.K. BOSE (ed.) Recent trends inmultidimensional system theory, Reidel (1985)
A.GALLIGO Some algorithmic questions on ideals of differential operators, Proc. EUROCAL '85 Il, L.N.C.S. 204 (1985)
R. GEBAUER, H.M. MOELLER On an installation of Buchberger's algorithm, (1985), to appear in J. Symb. Comp.
A.KANDRI-RODY, V.WEISPFENNING Non-commutative Groebner base in algebras of solvable type, (1986), to appear in J. Symb. Comp.
L. ROBBIANO On the theory of graded structures, J. Symb. Comp. 2 (1986), 139–170
T.MORA Seven variations on standard bases, (1988)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mora, T. (1989). Groebner bases in non-commutative algebras. In: Gianni, P. (eds) Symbolic and Algebraic Computation. ISSAC 1988. Lecture Notes in Computer Science, vol 358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51084-2_14
Download citation
DOI: https://doi.org/10.1007/3-540-51084-2_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51084-0
Online ISBN: 978-3-540-46153-1
eBook Packages: Springer Book Archive