Computing Gröbner bases in monoid and group rings

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Computing Gröbner bases in monoid and group rings

Full text

Pdf (887 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1993 international symposium on Symbolic and algebraic computation table of contents

Kiev, Ukraine

Pages: 254 - 263

Year of Publication: 1993

ISBN:0-89791-604-2

Authors

Klaus Madlener
Birgit Reinert

Sponsor

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 22, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/164081.164139 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	Ba89	F. Baader. Unification in Commutative Theories, Hilbert's Basis Theorem and Grb'bner Bases. Proc. 3rd UNIF'89.
	Bu85	B. Buchberger. Grb'bner Bases: An Algorithmic Method in Polynomial Ideal Theory. N. K. Bose (ed). Multidimensional Systems Theory. Chapter 6. 1985. Dordrecht: Reidel. pp 184-232.
	KaKa84	A. Kandri-Rody and D. Kapur. An Algorithm for Computing the Grb'bner Basis of a Polynomial Ideal over an Euclidean Ring. Technical Information Series General Electric Company Corporate Research and Development Schenectady. NY 12345. Dec. 1984.
	KaKa88	A. Kandri-Rody , D. Kapur, Computing a Gro¨bner basis of a polynomial ideal over a Euclidian domain, Journal of Symbolic Computation, v.6 n.1, p.37-57, August 1988 [doi>10.1016/S0747-7171(88)80020-8]
	KaWe90	A. Kandr-Rody , V. Weispfenning, Non-commutative Gro¨bner bases in algebras of solvable type, Journal of Symbolic Computation, v.9 n.1, p.1-26, Jan. 1990 [doi>10.1016/S0747-7171(08)80003-X]
	KuMa89	N. Kuhn , K. Madlener, A method for enumerating cosets of a group presented by a canonical system, Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation, p.338-350, July 17-19, 1989, Portland, Oregon, United States [doi>10.1145/74540.74580]
	La76	M. Lauer. Kanonische Repra'sentanten fiir die Restklassen nach einem Polynomideal. Diplomarbeit. Universitiit Kaiserslautern. 1976.
	MaOt89	K. Madlener , F. Otto, About the descriptive power of certain classes of finite string-rewriting systems, Theoretical Computer Science, v.67 n.2-3, p.143-172, Oct. 1989 [doi>10.1016/0304-3975(89)90002-9]
	MaRe	K. Madlener, B. Reinert. On Grb'bner Bases in Monoid Rings. Internal Report (to appear 1993).
	Mo85	Ferdinando Mora, Groebner Bases for Non-Commutative Polynomial Rings, Proceedings of the 3rd International Conference on Algebraic Algorithms and Error-Correcting Codes, p.353-362, July 15-19, 1985
	NaOD89	Paliath Narendran , Colm Ó'Dúnlaing, Cancellativity in finitely presented semigroups, Journal of Symbolic Computation, v.7 n.5, p.457-472, May 1989 [doi>10.1016/S0747-7171(89)80028-8]
	We87	Volker Weispfenning, Gröbner bases for polynomial ideals over commutative regular rings, Proceedings of the European Conference on Computer Algebra, p.336-347, June 02-05, 1987
	We92	V. Weispfenning, Finite Gröbner bases in non-Noetherian skew polynomial rings, Papers from the international symposium on Symbolic and algebraic computation, p.329-334, July 27-29, 1992, Berkeley, California, United States [doi>10.1145/143242.143346]

CITED BY 3

	Birgit Reinert , Klaus Madlener , Teo Mora, A note on Nielsen reduction and coset enumeration, Proceedings of the 1998 international symposium on Symbolic and algebraic computation, p.171-178, August 13-15, 1998, Rostock, Germany
	E. L. Mansfield , A. Szanto, Elimination theory for differential difference polynomials, Proceedings of the 2003 international symposium on Symbolic and algebraic computation, p.191-198, August 03-06, 2003, Philadelphia, PA, USA
	Johannes Grabmeier , Erich Kaltofen , Volker Weispfenning, Cited References, Computer algebra handbook, Springer-Verlag New York, Inc., New York, NY, 2003