Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 
 

 

An enumeration process for racks


Authors: Jim Hoste and Patrick D. Shanahan
Journal: Math. Comp.
MSC (2010): Primary 20-04; Secondary 57M25
DOI: https://doi.org/10.1090/mcom/3374
Published electronically: August 31, 2018
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: Given a presentation for a rack $ \mathcal R$, we define a process which systematically enumerates the elements of $ \mathcal R$. The process is modeled on the systematic enumeration of cosets first given by Todd and Coxeter. This generalizes and improves the diagramming method for $ n$-quandles introduced by Winker. We provide pseudocode that is similar to that given by Holt, Eick, and O'Brien for the Todd-Coxeter process. We prove that the process terminates if and only if $ \mathcal R$ is finite, in which case, the procedure outputs an operation table for the finite rack. We conclude with an application to knot theory.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2010): 20-04, 57M25

Retrieve articles in all journals with MSC (2010): 20-04, 57M25


Additional Information

Jim Hoste
Affiliation: Department of Mathematics, Pitzer College, 1050 N Mills Avenue, Claremont, California 91711
Email: jhoste@pitzer.edu

Patrick D. Shanahan
Affiliation: Department of Mathematics, Loyola Marymount University, UHall 2700, Los Angeles, California 90045
Email: pshanahan@lmu.edu

DOI: https://doi.org/10.1090/mcom/3374
Received by editor(s): July 12, 2017
Received by editor(s) in revised form: February 16, 2018
Published electronically: August 31, 2018
Article copyright: © Copyright 2018 American Mathematical Society

American Mathematical Society