From ad744b76bd118455d1728980431b5070b7df39e9 Mon Sep 17 00:00:00 2001 From: Glen Whitney Date: Sat, 21 Oct 2017 01:17:58 +0200 Subject: [PATCH] typos --- gap/byconj.gi | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/gap/byconj.gi b/gap/byconj.gi index cef58f2..aa95425 100644 --- a/gap/byconj.gi +++ b/gap/byconj.gi @@ -65,11 +65,11 @@ InstallMethod("ConjugationQuandle", "for a group", [IsGroup and IsFinite], function(G) local fam, elts; - fam := CollectionFamily(ConjugatorFamily(ElementsFamily(FamilyObj(G)))); + fam := CollectionsFamily(ConjugatorFamily(ElementsFamily(FamilyObj(G)))); # Question: how do we easily/quickly determine a set of generators of # Conj(G) from a set of generators of G, so that we can handle infinite # conj-quandles here? - elts := List(Elements(G), g -> ConjugatorObj(g)); + elts := List(Elements(G), g -> ConjugatorObj(g) ); # What we would like to do is # return AsLeftQuandle[NC?](elts); # but that's NIY.