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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
|
// Copyright (C) 1995 The New York Group Theory Cooperative
// See magnus/doc/COPYRIGHT for the full notice.
//
// Contents: Informal tests of class HomomorphismBuilder.
//
// Principal Authors: Dmitry Bormotov
//
#include "HomomorphismBuilder.h"
int main( )
{
srand(1335);
FPGroup F;
cout << "Enter a FPGroup represenatation, i.e. <a,b,c| a^7, b = c> : "
<< endl;
Chars errMsg = cin >> F;
if( errMsg.length() > 0 ) {
cout << errMsg << endl;
exit(-1);
}
cout << endl;
cout << "You typed the FPGroup: " << F << endl << endl;
const int size = 2;
HomomorphismBuilder<Integer> HB(F, size);
HB.startComputation();
while( !HB.done() ) HB.continueComputation();
VectorOf< Matrix<Integer> > hom = HB.getHomomorphism();
cout << "homomorphism : " << endl;
for( int i = 0; i < F.numberOfGenerators(); i++ )
cout << hom[i] << endl;
/*
srand(1335);
FPGroup F;
cout << "Enter a FPGroup represenatation, i.e. <a,b,c| a^7, b = c> : "
<< endl;
Chars errMsg = cin >> F;
if( errMsg.length() > 0 ) {
cout << errMsg << endl;
exit(-1);
}
cout << endl;
cout << "You typed the FPGroup: " << F << endl << endl;
const int size = 2;
HomomorphismBuilder<Rational> HB(F, size);
HB.startComputation();
while( !HB.done() ) HB.continueComputation();
VectorOf< Matrix<Rational> > hom = HB.getHomomorphism();
cout << "homomorphism : " << endl;
for( int i = 0; i < F.numberOfGenerators(); i++ )
cout << hom[i] << endl;
*/
}
|
