diff --git a/doc/learn/index.md b/doc/learn/index.md index 228a4178..a128fa76 100644 --- a/doc/learn/index.md +++ b/doc/learn/index.md @@ -96,8 +96,6 @@ parent: Documentation {% include namelink.html name="Steve Linton" %}, accepted for ISSAC (International Symposium on Symbolic and Algebraic Computation) 1998 at Rostock. -- [Advanced Programming in GAP 4]({{ site.baseurl }}/Doc/Talks/linz99.html). - Slides of many of the talks given at the 1999 Linz Workshop. - Talks from the [First CoDiMa Training School in Computational Discrete Mathematics](https://blogs.cs.st-andrews.ac.uk/codima/school2015/) (Manchester, November 2015). - Talks from the [Second CoDiMa Training School in Computational Discrete Mathematics](https://blogs.cs.st-andrews.ac.uk/codima/school2016/) diff --git a/faq.md b/faq.md index d3900b3f..2d69eee1 100644 --- a/faq.md +++ b/faq.md @@ -12,29 +12,6 @@ permalink: /faq/ {:toc} - - - -## Obtaining GAP - - - -### Can I obtain the algorithm and/or code for some function of GAP? - -The brief answer is: "Yes, GAP is open source." - -You can use tools such as 'grep' to search for the code. - -Also the answer to FAQ 2.6 may be helpful. - - - -### How do I find my way through the GAP Library? - -The following text, adapted from a -talk -by Alexander Hulpke at a Summer School at Linz in 1999, may be helpful. - ## Usage hints @@ -205,15 +182,7 @@ variables is significantly slower than local ones. ### I think I found a bug. -While we try to check the GAP system as rigorously as we -can, such a large system will inevitably contain bugs. We welcome bug -reports and regularly issue updates. However since GAP is -available free and the GAP authors work on the system as -part of their research, we would like to ask you to make sure that the -problem that you encountered really is a bug and that you are giving us -sufficient information to deal with it: please read the page -GAP Trouble -before sending us a bug report. +Please refer to the [reporting issues]({{ site.baseurl }}/issues/) page. @@ -332,11 +301,9 @@ A few approaches for this are: [ "IS_SSORT_LIST", "IsFinite", "IsSmallList", "IsSortedList", "IsDuplicateFree" ] ``` - This example point to an important consequence: lookup in b is much faster - than searching in a, since, as b is known to be sorted, binary search is used - for the lookup. An amusing instance of a painful learning experience in the - subject appears in the Forum thread starting in - . + This example point to an important consequence: lookup in `b` is much faster + than searching in `a`, since, as `b` is known to be sorted, binary search is used + for the lookup. @@ -424,9 +391,9 @@ as a PC group) or to a permutation group. For groups given by structural information, the construction can be much harder. There are a few general product constructions (direct and -semidirect product for example). The -[Issac 2000]({{ site.baseurl }}/Doc/Talks/talks.html) -tutorial gives some examples of constructing groups. +semidirect product for example). This +[tutorial by Alexander Hulpke](https://www.math.colostate.edu/~hulpke/paper/gap4tut.pdf) +gives some examples of constructing groups. Here then is the **example** to which the first paragraph referred: