1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
|
The directory 'magnus/back_end/experiments' contains several
examples of how one can apply magnus to perform experiments which
sometimes are difficult or impossible to make running simple graphical
interface. To compile any of the programs first make sure you are in
the directory 'magnus/back_end/experiments', then type 'make
<filename>', where <filename> is the name of the program you want to
run. Then go to the directory 'test/bin' and run it. The names and
brief descriptions of implemented programs are listed below. If you
want to write a new program, you have to add it's name to the list of
tests in the Makefile (look for the string "TESTS = ' in the
Makefile). Then put your program into the 'test' directory, and run
make as described above.
The list of experiments.
1. abelianOrder
Contents: this program computes orders of all abelian groups
satisfying the following pattern:
< a,b; a^2 b^3, a^3 b^2 >,
< a,b,c; a^2 b^3 c^4, a^3 b^4 c^2, a^4 b^2 c^3 >, etc.
2. ortest
Contents:
The program finds the shortest trivial word in an one-relator
group. The algorithm is horrobly exponential, so if you give
it a group with more then two generators, don't expect results
in reasonable time.
3. primitive
Contents:
The program counts the number of primitive elements in a free
group.
4. HNConjecture
Contents:
An experiment which looks for a counter-example to the
Hanna Neumann conjecture: if A and B are finitely generated
subgroups of a free group of finite rank, and I is the
intersection of A and B, then rk(I)-1 <= (rk(A)-1)(rk(B)-1).
|
