Abstract
We discuss several improvements to an algorithm for computing the rewriting number of a group. Our improvements speed up the computation by a couple of orders of magnitude. With the faster algorithm, we have shown that the rewriting number of the symmetric groupS 5 is 8.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Russel D. Blyth and Derek J. S. Robinson:Recent progress on rewritability in groups. InGroup Theory: Proceedings of the 1987 Singapore Group Theory Conference, pages 77–85, Walter de Gruyter, Berlin, 1989.
Russel D. Blyth and Derek J. S. Robinson:Solution of the solubility problem for rewritable groups. Journal of the London Mathematical Society. To appear.
Roy Campbell, Vincent Russo, and Gary Johnston:The design of a multiprocessor operating system. InProceedings of the USENIX C + +Workshop, pages 109–123, 1987. Also Technical Report No. UIUCDCS-R-87-1388, Department of Computer Science, University of Illinois at Urbana-Champaign.
Mario Curzio, Patrizia Longobardi, Mercede Maj, and Derek J. S. Robinson:A permutational property of groups. Archiv der Mathematik, 44:385–389, 1985.
Author information
Authors and Affiliations
Additional information
Supported by a fellowship from the Shell Oil Company Foundation.
Rights and permissions
About this article
Cite this article
Robison, A.D. An improved rewriting-number algorithm. BIT 30, 51–61 (1990). https://doi.org/10.1007/BF01932131
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01932131