-
Notifications
You must be signed in to change notification settings - Fork 6
/
same_generators.c
128 lines (104 loc) · 3.17 KB
/
same_generators.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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
#include <typedef.h>
#include <getput.h>
#include <gmp.h>
#include <zass.h>
#include <matrix.h>
#include <tools.h>
#include <bravais.h>
#include <datei.h>
int main(int argc,char **argv){
int i,
j,
k,
anz,
denominator,
**words;
bravais_TYP *P,
**R;
char comment[1000];
matrix_TYP *coz,
**RG;
read_header(argc,argv);
if ((is_option('h') && optionnumber('h')==0) ||
((FILEANZ < 2))){
printf("Usage: %s 'file1' 'file2' ['file3' .....]\n",argv[0]);
printf("\n");
printf("file1: bravais_TYP containing the point group G.\n");
printf("file2: bravais_TYP containing the space group R_1.\n");
printf("filex: bravais_TYP containing additional space groups.\n");
printf("\n");
printf("For each group in the files 'file2' 'file3' ... the program\n");
printf("tries to find elements in the space group with the same\n");
printf("linear part as the generators in file1.\n");
printf("WARNING: If this is impossible, the program will run into an\n");
printf(" infinite loop.\n");
printf("\n");
printf("CF. Extensions, Extract,Z_equiv.\n");
if (is_option('h')){
exit(0);
}
else{
exit(31);
}
}
INFO_LEVEL = optionnumber('h');
anz = FILEANZ-1;
R = (bravais_TYP **) malloc( anz * sizeof(bravais_TYP *));
/* read the files the user specified */
P = get_bravais(FILENAMES[0]);
for (i=0;i<anz;i++)
R[i] = get_bravais(FILENAMES[i+1]);
for (i=0;i<anz;i++){
RG = (matrix_TYP **) malloc( R[i]->gen_no * sizeof(matrix_TYP*));
words = (int **) malloc(P->gen_no * sizeof(int *));
denominator = 1;
for (j=0;j<R[i]->gen_no;j++){
RG[j] = copy_mat(R[i]->gen[j]);
RG[j]->cols--;
RG[j]->rows--;
Check_mat(RG[j]);
if (!RG[j]->flags.Integral){
fprintf(stderr,"The point group has to be integral\n");
exit(3);
}
/* kgv2rat(R[i]->gen[j]); */
rat2kgv(R[i]->gen[j]);
denominator *= (R[i]->gen[j]->kgv / GGT(R[i]->gen[j]->kgv,denominator));
}
/* stick the rigth INTEGRAL cocycle at the end of the RG[j] */
for (j=0;j<R[i]->gen_no;j++){
RG[j]->cols++;
RG[j]->rows++;
for (k=0;k<RG[j]->rows-1;k++)
RG[j]->array.SZ[k][R[i]->dim-1] = (denominator / R[i]->gen[j]->kgv) *
R[i]->gen[j]->array.SZ[k][R[i]->dim-1];
RG[j]->array.SZ[R[i]->dim-1][R[i]->dim-1] = 1;
Check_mat(RG[j]);
}
/* get the cocycle on the right generators */
coz = reget_gen(RG,R[i]->gen_no,P,words,TRUE);
/* the cozykle has to become the right denominator */
coz->kgv = denominator;
Check_mat(coz);
/* output */
sprintf(comment,"standartized cocycle for the group of %s",FILENAMES[i+1]);
put_cocycle(coz,P->dim,P->gen_no,NULL,comment);
for (j=0;j<R[i]->gen_no;j++){
free_mat(RG[j]);
}
for (j=0;j<P->gen_no;j++){
free(words[j]);
}
free(words);
free(RG);
}
/* clean up */
free_bravais(P);
for (i=0;i<anz;i++)
free_bravais(R[i]);
free(R);
if (FALSE){
put_bravais(P,NULL,NULL);
}
exit(0);
} /* main */