Coset enumeration strategies
| dc.creator | Havas, George | |
| dc.date | 1994-06-15 | |
| dc.date.accessioned | 2026-07-07T09:15:07Z | |
| dc.date.available | 2026-07-07T09:15:07Z | |
| dc.description | A primary reference on computer implementation of coset enumeration procedures is a 1973 paper of Cannon, Dimino, Havas and Watson. Programs and techniques described there are updated in this paper. Improved coset definition strategies, space saving techniques and advice for obtaining improved performance are included. New coset definition strategies for Felsch-type methods give substantial reductions in total cosets defined for some pathological enumerations. Significant time savings are achieved for coset enumeration procedures in general. Statistics on performance are presented, both in terms of time and in terms of maximum and total cosets defined for selected enumerations. | |
| dc.description | This report appeared in ISSAC'91 (Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, Stephen M. Watt, editor), ACM Press, New York, 1991, pp. 191-199 | |
| dc.identifier | https://arxiv.org/abs/math/9406202 | |
| dc.identifier | http://arxiv.org/abs/math/9406202 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/152911 | |
| dc.subject | Group Theory | |
| dc.title | Coset enumeration strategies | |
| dc.type | text |