-
Notifications
You must be signed in to change notification settings - Fork 6
/
conjugated.c
86 lines (66 loc) · 1.83 KB
/
conjugated.c
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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
#include <typedef.h>
#include <getput.h>
#include <matrix.h>
#include <base.h>
#include <datei.h>
int main(int argc,char **argv){
bravais_TYP *G,
*H,
*N;
matrix_TYP **base,
*erg;
bahn **strong;
int i;
char comment[1000];
read_header(argc,argv);
if ((is_option('h') && optionnumber('h')==0) || (FILEANZ < 3)){
printf("Usage: Conjugated file1 file2 file3\n");
printf("\n");
printf("file1: bravais_TYP containing the finite group G.\n");
printf("file2: bravais_TYP containing the finite group H.\n");
printf("file2: bravais_TYP containing the group N.\n");
printf("\n");
printf("The program checks whether there is an x in N with the\n");
printf("property that x H x^{-1} <= G, and returns this x if it\n");
printf("exists.\n");
printf("\n");
printf("WARNING: The program assumes that the orbit of H under N\n");
printf(" is finite.\n");
printf("\n");
if (is_option('h')){
exit(0);
}
else{
exit(31);
}
}
INFO_LEVEL = optionnumber('h');
G = get_bravais(FILENAMES[0]);
H = get_bravais(FILENAMES[1]);
N = get_bravais(FILENAMES[2]);
base = get_base(G);
strong = strong_generators(base,G,FALSE);
erg = conjugated(G,H,N->gen,N->gen_no,strong);
/* output */
if (erg != NULL){
sprintf(comment,"conjugated the group of %s INTO the group of %s",
FILENAMES[1],FILENAMES[0]);
put_mat(erg,NULL,comment,2);
free_mat(erg);
}
else{
printf("the groups are not conjugated under the group of %s\n",
FILENAMES[2]);
}
free_bravais(G);
free_bravais(H);
free_bravais(N);
for (i=0;i<G->dim;i++){
free_mat(base[i]);
free_bahn(strong[i]);
free(strong[i]);
}
free(strong);
free(base);
exit(0);
} /* main */