-
Notifications
You must be signed in to change notification settings - Fork 6
/
super-k-groups.c
140 lines (114 loc) · 3.59 KB
/
super-k-groups.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
129
130
131
132
133
134
/* author: Oliver Heidbuechel */
/* last change: 09.12.2002 */
#include <ZZ.h>
#include<typedef.h>
#include<getput.h>
#include<matrix.h>
#include<longtools.h>
#include<tools.h>
#include"zass.h"
#include <base.h>
#include <bravais.h>
#include <graph.h>
#include <presentation.h>
#include <name.h>
int main (int argc, char *argv[])
{
bravais_TYP *P, *R, **S;
int i, anz, OPT[6], *orbitlength = NULL;
char comment[1000],
file[1000];
bahn **strong;
matrix_TYP *presentation,
**base;
read_header(argc, argv);
if ( (is_option('p') && FILEANZ < 3) || (!is_option('p') && FILEANZ < 2) ||
(is_option('h') && optionnumber('h') == 0) ){
printf("\n");
printf("Usage: %s 'file1' [-h] [-a [-n]] [-f] [-t] [-p 'file2'] 'p_1' ... 'p_n'\n", argv[0]);
printf("\n");
printf("file1: Spacegroup R in standard affine form (without translations)\n");
printf("file2: (optional) Pointgroup P of R (with correct normalizer)\n");
printf("p_i : primes\n");
printf("\n");
printf("Calculates the minimal klassengleich supergroups with p_i-power index.\n");
printf("\n");
printf("Options:\n");
printf("-h : Give this help.\n");
printf("-a : Calculate supergroups up to conjugation under\n");
printf(" the affine normalizer of R.\n");
printf("-n : Print the lengthes of the orbits\n");
printf(" (this only works together with the option a).\n");
printf("-f : Print the supergroups in files 'file1_j'.\n");
printf("-t : Omit the last dim R generators.\n");
printf("-d : Only for debugging!\n");
printf("\n");
printf("Cf.: KSubgroups, Graph\n\n");
exit(11);
}
INFO_LEVEL = optionnumber('h');
/* get data */
R = get_bravais(FILENAMES[0]);
if (is_option('t'))
R->gen_no -= (R->dim - 1);
if (is_option('p')){
P = get_bravais(FILENAMES[1]);
}
else{
P = point_group(R, 2);
normalisator(P, NULL, NULL, 0, FALSE, FALSE);
}
/* presentation */
base = get_base(P);
strong = strong_generators(base, P, TRUE);
OPT[0] = 0;
presentation = pres(strong, P, OPT);
for (i = 0; i < P->dim; i++){
free_mat(base[i]);
free_bahn(strong[i]);
free(strong[i]);
}
free(strong);
free(base);
/* primes */
memset(P->divisors, 0, 100 * sizeof(int));
if (is_option('p')){
for (i = 2; i < FILEANZ; i++)
P->divisors[atoi(FILENAMES[i])]++;
}
else{
for (i = 1; i < FILEANZ; i++)
P->divisors[atoi(FILENAMES[i])]++;
}
/* calculate and print minimal klassengleich supergroups of prime-power-index */
S = min_k_super(P, R, presentation, &anz, is_option('a'), is_option('d'), &orbitlength);
/* print the minimal klassengleich subgroups of prime-power-index */
if (is_option('a') && is_option('n')){
fprintf(stderr, "\nLengthes of the orbits:\n");
for (i = 1; i <= anz; i++)
fprintf(stderr, "%i ", orbitlength[i]);
fprintf(stderr, "\n\n");
}
if (is_option('f')){
for (i = 0; i < anz; i++){
sprintf(comment, "%d-th minimal klassengleich supergroup of %s", i + 1, FILENAMES[0]);
sprintf(file, "%s_%d", FILENAMES[0], i + 1);
put_bravais(S[i], file, comment);
}
}
else
for (i = 0; i < anz; i++)
put_bravais(S[i],0,0);
/* clean */
if (orbitlength)
free(orbitlength);
if (is_option('t'))
R->gen_no += (R->dim - 1);
free_bravais(R);
free_bravais(P);
for (i = 0; i < anz; i++)
free_bravais(S[i]);
free(S);
free_mat(presentation);
exit(0);
}