A note on Nielsen reduction and coset enumeration

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A note on Nielsen reduction and coset enumeration

Full text

Pdf (285 KB)

Source

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

Rostock, Germany

Pages: 171 - 178

Year of Publication: 1998

ISBN:1-58113-002-3

Authors

Birgit Reinert	Universität Kaiserslautern, 67663 Kaiserslautern, Germany
Klaus Madlener	Universität Kaiserslautern, 67663 Kaiserslautern, Germany
Teo Mora	DISI, Via Dodecaneso, 35, 16146 Genova, Italy

Sponsors

German Comp Soc : GI - Gesellshaft for Informatik
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 9, Downloads (12 Months): 23, Citation Count: 1

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/281508.281607 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.

	1	M. E. Alonso et al.. The Big Mother of All the Dualities. Draft, 1995.
	2	J Avenhaus , K Madlener, The Nielsen reduction and P-complete problems in free groups, Theoretical Computer Science, v.32 n.1-2, p.61-76, July 1984 [doi>10.1016/0304-3975(84)90024-0]
	3	Benjamin Benninghofen , Susanne Kemmerich , Michael M. Richter, Systems of reductions, Springer-Verlag, London, 1987
	4	Ronald V. Book , Friedrich Otto, String-rewriting systems, Springer-Verlag, London, 1993
	5	M. A. Borges and M. Borges. Gr5bner bases property on elimination ideal in the noncommutative case. In B. Buchberger and F. Winkler, editors, GrSbner Bases and Applications (Proc. of the Conference 33 Years of GrSbner Bases), volume 251 of London Mathematical Society Lecture Notes Series, pages 323-337. Cambridge University Press, 1998.
	6	B. Buchberger. Ein Algorithmus zum Auf-finden der Basiselemente des Restklassenrings nach einem nulldimensionalen Polynomideal. PhD thesis, Universit~t Innsbruck, 1965.
	7	H. Michael Möller , Bruno Buchberger, The Construction of Multivariate Polynomials with Preassigned Zeros, Proceedings of the European Computer Algebra Conference on Computer Algebra, p.24-31, April 05-07, 1982
	8	J. C. Faugère , P. Gianni , D. Lazard , T. Mora, Efficient computation of zero-dimensional Gro¨bner bases by change of ordering, Journal of Symbolic Computation, v.16 n.4, p.329-344, Oct. 1993 [doi>10.1006/jsco.1993.1051]
	9	G. Hermann. Die Frage der endlich vielen Schritte in der Theorie der Polynomideale. Mathematische Annalen, 95:737-788, 1926.
	10	D. L. Johnson. Presentation of Groups. Cambridge University Press, 1976.
	11	D. Knuth and P. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263-297. Pergamon Press, Oxford, 1970.
	12	N. Kuhn, K. Madlener, and F. Otto. Computing presentations for subgroups of polycyclic groups and of context-free groups. Applicable Algebra in Engineering, Communication and Computing, 5:287-316, 1994.
	13	R. C. Lyndon and P. E. Schupp. Combinatorial Group Theory. Springer, 1977.
	14	Klaus Madlener , Birgit Reinert, Computing Gröbner bases in monoid and group rings, Proceedings of the 1993 international symposium on Symbolic and algebraic computation, p.254-263, July 06-08, 1993, Kiev, Ukraine [doi>10.1145/164081.164139]
	15	K. Madlener and B. Reinert. String rewriting and GrSbner bases- a general approach to monoid and group rings. In Proceedings of the Workshop on Symbolic Rewriting Techniques, Monte Verita, 1995, pages 127-180. Birkh~user, 1998.
	16	Klaus Madlener , Birgit Reinert, Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings, Theoretical Computer Science, v.208 n.1-2, p.3-31, Nov. 28, 1998 [doi>10.1016/S0304-3975(98)00077-2]
	17	S. Margolis, J. Meakin, and M. Sapir. Algorithmic problems in groups, semigroups and inverse monoids. In J. Fountain, editor, Semigroups, Formal Languages and Groups, pages 147-214. Kluwer Academic Press, 1993.
	18	M. G. Marinari, H. M. MSller, and T. Mora. GrSbner bases of ideals defined by functionals with an application to ideals of projective points. Applicable Algebra in Engineering, Communication and Computing, 4:103- 145, 1993.
	19	T. Mora. GrSbner bases and the word problem. Genova, 1987.
	20	J. Neubiiser. An elementary introduction to coset table methods in computational group theory. In C. M. Campbell and E. F. Robertson, editors, Groups St. Andrews 1981, L.M.S. Lecture Notes 71, pages 1-45. Cambridge University Press, 1982.
	21	J. Nielsen. Om Regning reed ikke kommutative Faktoren og dens Anvendelse i Gruppeteorien. Mat. Tidsskr. B., pages 77-94, 1921.
	22	B. Reinert. On GrSbner Bases in Monoid and Group Rings. PhD thesis, Universit~t Kaiserslautern, 1995.
	23	C. Sims. Computation with Finitely Presented Groups. Cambridge University Press, 1994.
	24	J. Todd and H. Coxeter. A practical method for enumerating cosets of a finite abstract group. In Proc. Edinburgh Math. Soc., volume 5, pages 26-34, 1936.