florian/enumerate-balanced-ideals
1
0
Fork 0
Code Issues Pull Requests Releases Activity

Recursion

Browse Source
This commit is contained in:
Florian Stecker 2016-10-19 16:40:03 +02:00
parent 5bcb30b5c1
commit 241065565d
2 changed files with 130 additions and 129 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Makefile
View File

@ -1,5 +1,5 @@
HEADERS=coxeter.h thickenings.h queue.h HEADERS=coxeter.h thickenings.h queue.h
OPTIONS=-O3 -m64 -flto -funroll-loops -std=gnu99 OPTIONS=-O3 -m64 -march=native -flto -funroll-loops -std=gnu99 -pg
all: generate process all: generate process

163
thickenings.c
View File

@ -275,60 +275,50 @@ void prepare_graph(semisimple_type_t type, node_t *graph, edgelist_t **edgelists
free(seen); free(seen);
} }
long enumerate_balanced_thickenings(semisimple_type_t type, node_t *graph, const char *alphabet, FILE *outfile) /*********************************** THE ACTUAL ENUMERATION ****************************************/
{
int rank, order;
signed char *level;
long count;
int is_fat, is_slim;
int current_level, head, current;
int i;
edgelist_t *edge;
queue_t queue; typedef struct {
int rank;
int printstep = 0; int order;
if(getenv("PRINTSTEP")) const node_t *graph;
printstep = atoi(getenv("PRINTSTEP")); int printstep;
const char *alphabet;
rank = coxeter_rank(type); FILE *outfile;
order = coxeter_order(type); } enumeration_info_t;
level = (signed char*)malloc(order*sizeof(int));
count = 0;
memset(level, 0, order*sizeof(int));
current_level = 1;
head = order - 1;
level[head] = HEAD_MARKER;
while(current_level > 0) {
// calculate transitive closure; that is, fill current_level in every spot which must be marked with the current head (but was not already marked before), and -current_level in every opposite spot (including opposite to the head) // calculate transitive closure; that is, fill current_level in every spot which must be marked with the current head (but was not already marked before), and -current_level in every opposite spot (including opposite to the head)
is_slim = 1; static int transitive_closure(const enumeration_info_t *info, signed char *level, int head, int current_level)
{
int is_slim = 1;
queue_t queue;
int current;
edgelist_t *edge;
queue_init(&queue); queue_init(&queue);
level[graph[head].opposite] = -current_level; level[info->graph[head].opposite] = -current_level;
queue_put(&queue, head); queue_put(&queue, head);
for(int i = head + 1; level[i] != HEAD_MARKER && i < order; i++) { // everything which is right to the head and empty will not get marked in this or higher levels, so we can mark its opposite
for(int i = head + 1; level[i] != HEAD_MARKER && i < info->order; i++) { // everything which is right to the head and empty will not get marked in this or higher levels, so we can mark its opposite
if(level[i] == current_level) { if(level[i] == current_level) {
is_slim = 0; is_slim = 0;
break; break;
} if(level[i] == 0) { } if(level[i] == 0) {
level[i] = -current_level; level[i] = -current_level;
level[graph[i].opposite] = current_level; level[info->graph[i].opposite] = current_level;
queue_put(&queue, graph[i].opposite); queue_put(&queue, info->graph[i].opposite);
} }
} }
if(is_slim) { if(is_slim) {
while((current = queue_get(&queue)) != -1) { while((current = queue_get(&queue)) != -1) {
edge = graph[current].bruhat_lower; edge = info->graph[current].bruhat_lower;
while(edge) { while(edge) {
if(level[edge->to] < 0) { if(level[edge->to] < 0) {
is_slim = 0; is_slim = 0;
break; break;
} else if(level[edge->to] == 0) { } else if(level[edge->to] == 0) {
level[edge->to] = current_level; level[edge->to] = current_level;
level[graph[edge->to].opposite] = -current_level; level[info->graph[edge->to].opposite] = -current_level;
queue_put(&queue, edge->to); queue_put(&queue, edge->to);
} }
edge = edge->next; edge = edge->next;
@ -336,30 +326,18 @@ long enumerate_balanced_thickenings(semisimple_type_t type, node_t *graph, const
} }
} }
// now we have something, check if it is a balanced thickening; if so, write to stdout return is_slim;
if(is_slim) {
is_fat = 1;
for(int i = 0; i < order; i++) {
if(level[i] == 0) {
is_fat = 0;
break;
}
}
if(is_fat) {
// ERROR(count >= MAX_THICKENINGS, "Too many balanced thickenings! Increase MAX_THICKENINGS\n");
fwrite(level, sizeof(signed char), order, outfile);
count++;
}
} }
static inline void output_thickening(const enumeration_info_t *info, signed char *level, int current_level, int is_slim, int is_fat, long count)
{
// if printstep is set accordingly, write state to stderr // if printstep is set accordingly, write state to stderr
if(is_slim && is_fat && printstep > 0 && (count + 1) % printstep == 0) { if(is_slim && is_fat && info->printstep > 0 && (count + 1) % info->printstep == 0) {
print_thickening(rank, order, level, current_level, alphabet, stderr); print_thickening(info->rank, info->order, level, current_level, info->alphabet, stderr);
fprintf(stderr, "\n"); fprintf(stderr, "\n");
} }
else if(printstep < 0) { else if(info->printstep < 0) {
print_thickening(rank, order, level, current_level - !is_slim, alphabet, stderr); print_thickening(info->rank, info->order, level, current_level - !is_slim, info->alphabet, stderr);
fprintf(stderr, " "); fprintf(stderr, " ");
if(is_slim) { if(is_slim) {
fprintf(stderr, "S"); fprintf(stderr, "S");
@ -368,48 +346,71 @@ long enumerate_balanced_thickenings(semisimple_type_t type, node_t *graph, const
} }
fprintf(stderr, "\n"); fprintf(stderr, "\n");
} }
}
// now find the next one! static long enumerate_tree(const enumeration_info_t *info, signed char *level, int current_level, int head)
{
ERROR(current_level >= HEAD_MARKER, "HEAD_MARKER too small!\n");
// try to find empty spot to the left of "head", but only if it is slim, as otherwise there is no point in adding even more level[head] = HEAD_MARKER;
int is_slim = transitive_closure(info, level, head, current_level);
int is_fat;
int count = 0;
// we have a candidate, check if it is a balanced thickening; if so, write to stdout
if(is_slim) { if(is_slim) {
for(i = head - 1; i >= 0; i--) is_fat = 1;
for(int i = head - 1; i >= 0; i--)
if(level[i] == 0) if(level[i] == 0)
break; is_fat = 0;
if(i >= 0) {
head = i;
level[head] = HEAD_MARKER;
current_level++;
ERROR(current_level >= HEAD_MARKER, "HEAD_MARKER to small!\n");
continue;
}
}
// if none was found, try to move "head" to the left output_thickening(info, level, current_level, is_slim, is_fat, count);
while(current_level > 0) {
for(i = head - 1; i >= 0; i--) if(is_fat) {
if(level[i] == 0 || level[i] >= current_level || level[i] <= -current_level) count++;
break; fwrite(level, sizeof(signed char), info->order, info->outfile);
if(i >= 0) { // if this was successful, just move head } else {
level[head] = 0; for(int i = head - 1; i >= 0; i--)
head = i; if(level[i] == 0)
level[head] = HEAD_MARKER; count += enumerate_tree(info, level, current_level + 1, i);
break;
} else { // if moving the head is not possible, take the next head to the right
current_level--;
level[head] = 0;
do {
head++;
} while(head < order && level[head] != HEAD_MARKER);
} }
} }
// clean up // clean up
for(int i = 0; i < order; i++) level[head] = 0;
for(int i = 0; i < info->order; i++)
if(level[i] >= current_level && level[i] != HEAD_MARKER || level[i] <= -current_level) if(level[i] >= current_level && level[i] != HEAD_MARKER || level[i] <= -current_level)
level[i] = 0; level[i] = 0;
return count;
} }
long enumerate_balanced_thickenings(semisimple_type_t type, node_t *graph, const char *alphabet, FILE *outfile)
{
// int rank, order;
signed char *level;
long count = 0;
enumeration_info_t info;
queue_t queue;
int current;
info.rank = coxeter_rank(type);
info.order = coxeter_order(type);
info.graph = graph;
info.alphabet = (char*)alphabet;
info.outfile = outfile;
info.printstep = 0;
if(getenv("PRINTSTEP"))
info.printstep = atoi(getenv("PRINTSTEP"));
level = (signed char*)malloc(info.order*sizeof(int));
memset(level, 0, info.order*sizeof(int));
for(int i = info.order - 1; i >= 0; i--)
count += enumerate_tree(&info, level, 1, i);
free(level); free(level);
return count; return count;