{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T21:18:07Z","timestamp":1648675087416},"reference-count":30,"publisher":"Wiley","license":[{"start":{"date-parts":[[2010,2,1]],"date-time":"2010-02-01T00:00:00Z","timestamp":1264982400000},"content-version":"unspecified","delay-in-days":3318,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["LMS J. Comput. Math."],"published-print":{"date-parts":[[2001]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The authors study a new method for coset enumeration in finitely presented groups. Their method uses prefix Gr\u00f6bner basis computation in the monoid ring ${\\mathbb{K}}[{\\cal M}]$, where ${\\mathbb{K}}$ is a computable field and ${\\cal M}$ a monoid presented by a convergent string-rewriting system. The method is compared to well-known methods for Todd-Coxeter enumeration, using examples from the literature where studies of these methods are reported. New insights into coset enumeration were gained using three different kinds of orderings, combined with new frameworks and strategies implemented in MRC 1.2.<\/jats:p>","DOI":"10.1112\/s1461157000000826","type":"journal-article","created":{"date-parts":[[2013,8,6]],"date-time":"2013-08-06T07:42:44Z","timestamp":1375774964000},"page":"74-134","source":"Crossref","is-referenced-by-count":0,"title":["Coset Enumeration Using Prefix Gr\u00f6bner Bases: An Experimental Approach"],"prefix":"10.1112","volume":"4","author":[{"given":"Birgit","family":"Reinert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Zeckzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2010,2,1]]},"reference":[{"key":"S1461157000000826_ref028","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574702"},{"key":"S1461157000000826_ref026","author":"Reinert","year":"1999","journal-title":"Coset enumeration using prefix Gr\u00f6bner bases in MRC-an experimental approach"},{"key":"S1461157000000826_ref022","unstructured":"22. Reinert B. , Observations on coset enumeration, Reports on computer algebra 23 (Centre for Computer Algebra, University of Kaiserslautern, 1998); http:\/\/www.mathematik.uni-kl.de\/~zca."},{"key":"S1461157000000826_ref021","article-title":"\u2018ACE for amateurs (Version 3.001)\u2019","author":"Ramsey","year":"1999","journal-title":"Technical Report 14, Centre for Discrete Mathematics and Computing"},{"key":"S1461157000000826_ref020","first-page":"1","volume-title":"Groups St. Andrews 1981, London Math. Soc. Lecture Note Ser.","volume":"71","author":"Ne\u00fcbuser","year":"1982"},{"key":"S1461157000000826_ref016","first-page":"3","volume-title":"Computational group theory","author":"Leech","year":"1984"},{"key":"S1461157000000826_ref015","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100036872"},{"key":"S1461157000000826_ref014","unstructured":"14. Holt D. F. , \u2018KBMAG (Knuth-Bendix in monoids and automatic groups)\u2019, 1996. http:\/\/ftp.maths.warwick.ac.uk\/people\/dfh\/kbmag2\/kbmag.tar.gz."},{"key":"S1461157000000826_ref011","article-title":"\u2018The trivial group made easy: a case study in coset enumeration\u2019","author":"Havas","year":"1999","journal-title":"Technical Report 15, Centre for Discrete Mathematics and Computing"},{"key":"S1461157000000826_ref008","first-page":"191","volume-title":"Proc. ISSAC","volume":"91","author":"Havas","year":"1991"},{"key":"S1461157000000826_ref006","first-page":"73","article-title":"\u2018The abstract groups Gm,n,n\u2019","volume":"45","author":"Coxeter","year":"1939","journal-title":"Trans. Amer. Math. Soc."},{"key":"S1461157000000826_ref024","author":"Reinert","year":"1998","journal-title":"a system for computing Gr\u00f6bner bases in monoid and group rings"},{"key":"S1461157000000826_ref003","volume-title":"Proc. RTA","volume":"96","author":"Buch","year":"1996"},{"key":"S1461157000000826_ref001","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0125"},{"key":"S1461157000000826_ref025","doi-asserted-by":"publisher","DOI":"10.1007\/s002000050122"},{"key":"S1461157000000826_ref007","unstructured":"7.The GAP Group, \u2018GAP\u2014Groups, algorithms, and programming\u2019, Version 4.2,2000. http:\/\/www-gap.dcs.st-and.ac.uk\/~gap."},{"key":"S1461157000000826_ref029","doi-asserted-by":"publisher","DOI":"10.1017\/S0013091500008221"},{"key":"S1461157000000826_ref005","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1973-0335610-5"},{"key":"S1461157000000826_ref019","doi-asserted-by":"publisher","DOI":"10.1145\/164081.164139"},{"key":"S1461157000000826_ref012","article-title":"\u2018Waldmeister: high-performance equational deduction\u2019","volume":"18","author":"Hillenbrand","year":"1999","journal-title":"J. Automat. Reason."},{"key":"S1461157000000826_ref009","unstructured":"9. Havas G. and Ramsey C. , \u2018Coset enumeration: ACE version 3\u2019, 1999. http:\/\/www.it.uq.edu.au\/~havas\/ace3.tar.gz."},{"key":"S1461157000000826_ref002","unstructured":"2. Buch A. and Hillenbrand Th. , \u2018Waldmeister: development of a high performance completion-based theorem prover\u2019, SEKI-ReportSR-96-01, 1996."},{"key":"S1461157000000826_ref023","volume-title":"Proc. ISSAC \u201898","author":"Reinert","year":"1998"},{"key":"S1461157000000826_ref030","unstructured":"30. Zeckzer D. , \u2018Implementation, applications and complexity of prefix Gr\u00f6bner bases in monoid and group rings\u2019, Ph.D. thesis, University of Kaiserslautern, December 2000."},{"key":"S1461157000000826_ref013","article-title":"\u2018XSSR:an experimental system for string-rewriting\u2014decision problems, algorithms, and implementation\u2019","author":"Hofbauer","year":"1999","journal-title":"Federated Logic Conference"},{"key":"S1461157000000826_ref018","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1962-051-5"},{"key":"S1461157000000826_ref010","unstructured":"10. Havas G. and Ramsey C. , \u2018Experiments in coset enumeration\u2019, Technical Report 13, Centre for Discrete Mathematics and Computing, University of Queensland, 1999."},{"key":"S1461157000000826_ref004","volume-title":"Proc. DISCO","volume":"96","author":"Buch","year":"1996"},{"key":"S1461157000000826_ref017","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80095-8"},{"key":"S1461157000000826_ref027","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80096-X"}],"container-title":["LMS Journal of Computation and Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1461157000000826","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T14:29:06Z","timestamp":1559831346000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1461157000000826\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"references-count":30,"alternative-id":["S1461157000000826"],"URL":"https:\/\/doi.org\/10.1112\/s1461157000000826","relation":{},"ISSN":["1461-1570"],"issn-type":[{"value":"1461-1570","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001]]}}}