RAQ, a GAP System package for Racks And Quandles.
Go to file
2018-08-21 13:05:02 -07:00
doc Incorporate the tests generated by AutoDoc into tst/testall.g 2018-08-21 13:05:02 -07:00
lib Standardize on RAQ as the name of this package 2018-08-18 10:58:08 -07:00
tst Incorporate the tests generated by AutoDoc into tst/testall.g 2018-08-21 13:05:02 -07:00
CHANGES Organize raq into standard GAP package file tree 2018-08-16 21:12:38 -07:00
init.g Standardize on RAQ as the name of this package 2018-08-18 10:58:08 -07:00
LICENSE Initial commit 2018-08-01 04:35:36 +00:00
maketest.g Incorporate the tests generated by AutoDoc into tst/testall.g 2018-08-21 13:05:02 -07:00
PackageInfo.g Add AutoDoc record to PackageInfo and use entities for packages 2018-08-21 12:33:38 -07:00
read.g Standardize on RAQ as the name of this package 2018-08-18 10:58:08 -07:00
README.md Incorporate the tests generated by AutoDoc into tst/testall.g 2018-08-21 13:05:02 -07:00

RAQ, a GAP System package for Racks And Quandles.

The &RAQ; package provides a variety of facilities for constructing and computing with one-sided quasigroups, racks, and quandles in ⪆.

&RAQ; uses no external binaries, so installation consists only of placing its unpacked file tree in a directory in your package search path, e.g. the pkg directory of your ⪆ installation, or perhaps the .gap/pkg subdirectory of your home directory.

The authors of &RAQ; would like to acknowledge their debt to the creators of &RIG;, an earlier package for Racks in GAP; chief among whom is Leandro Vendramin. &RIG; was an inspiration for the creation of &RAQ;, and using and reading that package suggested many features needed in the development of &RAQ;.

Perhaps the following ⪆ interactive session, which constructs the conjugation quandle of the symmetric group on three elements and then performs a few simple computations on that quandle, will give the flavor of &RAQ;. (It is presumed that the &RAQ; package has already been loaded with LoadPackage("RAQ"); prior to these example commands being executed.)

gap> S3 := SymmetricGroup(3);
Sym( [ 1 .. 3 ] )
gap> Elements(S3);
[ (), (2,3), (1,2), (1,2,3), (1,3,2), (1,3) ]
gap> Q3 := ConjugationQuandle(S3);
<left quandle with 6 generators>
gap> elt := Elements(Q3); # the element ^p: below means conjugation by p in S3 
[ ^():, ^(2,3):, ^(1,2):, ^(1,2,3):, ^(1,3,2):, ^(1,3): ]
gap> elt[4]*elt[3]; # So this will produce (1,2,3)^{-1}(1,2)(1,2,3)
^(2,3):

Note in particular that &RAQ; generally, unless otherwise specifically requested, produces left quandles and racks. (That is to say, quandles in which for any fixed element l, the "left-multiplication by $l$" operation x\mapsto l*x is a permutation of the quandle.)