.gitignore pdf files and list length profile

.gitignore

@@ -1,6 +1,7 @@
 *.o
+*.pdf
 enumerate
+idealbounds
 graph
-output/
-old/
-README.html
+D2n
+dominant_weights

D2n.c

@@ -0,0 +1,133 @@
+#include "thickenings.h"
+#include "weyl.h"
+#include "queue.h"
+
+#include <strings.h>
+#include <stdio.h>
+#include <inttypes.h>
+
+int main(int argc, const char *argv[])
+{
+	if(argc < 2) {
+		fprintf(stderr, "Rank argument required.\n");
+		return 1;
+	}
+	int rank = atoi(argv[1]);
+	if(rank <= 0 || rank > 1000) {
+		fprintf(stderr, "Rank must be a small positive integer.\n");
+		return 1;
+	}
+	if(rank % 2) {
+		fprintf(stderr, "Rank must be even.\n"); // opposition involution not trivial otherwise
+		return 1;
+	}
+
+	doublequotient_t *dq = (doublequotient_t*)malloc(sizeof(doublequotient_t));
+	simple_type_t type;
+	type.series = 'D';
+	type.rank = rank;
+	dq->type.n = 1;
+	dq->type.factors = &type;
+	dq->left_invariance = (1<<rank) - 2;
+	dq->right_invariance = 0;
+	dq->group = 0;
+	dq->grouplists = 0;
+	dq->groupletters = 0;
+	dq->count = 1 << (rank - 1);
+	dq->cosets = (doublecoset_t*)malloc(dq->count*sizeof(doublecoset_t));
+	dq->lists = (doublecoset_list_t*)malloc(2*dq->count*rank*sizeof(doublecoset_list_t)); // conservative estimate
+	int nlists = 0;
+
+	int *bitmask = malloc((1<<(rank-1)) * sizeof(int));
+	int *bitmask_reverse = malloc((1<<rank) * sizeof(int));
+	int index = 0;
+
+	LOG("Prepare.\n");
+
+	for(int i = 0; i < dq->count; i++) {
+		dq->cosets[i].index = i;
+		dq->cosets[i].bruhat_lower = (doublecoset_list_t*)0;
+		dq->cosets[i].bruhat_higher = (doublecoset_list_t*)0;
+		dq->cosets[i].min = (weylgroup_element_t*)0;
+		dq->cosets[i].max = (weylgroup_element_t*)0;
+	}
+
+	LOG("Create bitmasks.\n");
+
+	for(uint64_t i = 0; i < (1 << rank); i++) {
+		if(__builtin_popcountll(i) % 2 == 1)
+			bitmask_reverse[i] = -1;
+		else {
+			bitmask[index] = i;
+			bitmask_reverse[i] = index++;
+		}
+	}
+
+	LOG("Generate bruhat order.\n");
+
+	for(int i = 0; i < dq->count; i++) {
+		for(int j = 0; j < rank - 1; j++) {
+			if(!(bitmask[i] & BIT(j)) && (bitmask[i] & BIT(j+1))) {
+				int lowerind = bitmask_reverse[bitmask[i] ^ (BIT(j) | BIT(j+1))];
+				dq->lists[nlists].next = dq->cosets[i].bruhat_lower;
+				dq->cosets[i].bruhat_lower = &dq->lists[nlists];
+				dq->cosets[i].bruhat_lower->to = &dq->cosets[lowerind];
+				nlists++;
+			}
+		}
+		if((bitmask[i] & BIT(0)) && (bitmask[i] & BIT(1))) {
+			int lowerind = bitmask_reverse[bitmask[i] & ~(BIT(0) | BIT(1))];
+			dq->lists[nlists].next = dq->cosets[i].bruhat_lower;
+			dq->cosets[i].bruhat_lower = &dq->lists[nlists];
+			dq->cosets[i].bruhat_lower->to = &dq->cosets[lowerind];
+			nlists++;
+		}
+	}
+
+	LOG("Revert bruhat order.\n");
+
+	for(int i = 0; i < dq->count; i++) {
+		for(doublecoset_list_t *cur = dq->cosets[i].bruhat_lower; cur; cur = cur->next) {
+			dq->lists[nlists].next = cur->to->bruhat_higher;
+			cur->to->bruhat_higher = &dq->lists[nlists];
+			cur->to->bruhat_higher->to = &dq->cosets[i];
+			nlists++;
+		}
+	}
+
+	LOG("Find opposites.\n");
+
+	for(int i = 0; i < dq->count; i++) {
+		int oppind = bitmask_reverse[~bitmask[i] & ((1<<rank) - 1)];
+		dq->cosets[i].opposite = &dq->cosets[oppind];
+	}
+
+	/*
+	printf("\n");
+	printf("digraph test123 {\n");
+
+	for(int i = 0; i < dq->count; i++) {
+		for(doublecoset_list_t *cur = dq->cosets[i].bruhat_lower; cur; cur = cur->next) {
+			printf("\"0x%02x\" -> \"0x%02x\";\n", bitmask[i], bitmask[cur->to->index]);
+		}
+	}
+
+	printf("}\n\n");
+
+	printf("Opposites:\n");
+	for(int i = 0; i < dq->count; i++)
+		printf("0x%02x <-> %d 0x%02x\n", bitmask[i], dq->cosets[i].opposite->index, bitmask[dq->cosets[i].opposite->index]);
+	printf("\n");
+	*/
+
+	long count = enumerate_balanced_thickenings(dq, 0, 0);
+	printf("Found %ld balanced ideals.\n", count);
+
+	free(bitmask);
+	free(bitmask_reverse);
+	free(dq->lists);
+	free(dq->cosets);
+	free(dq);
+
+	return 0;
+}

Makefile

@@ -5,26 +5,45 @@ HEADERS=weyl.h thickenings.h queue.h bitvec.h
 SPECIAL_OPTIONS=-O3 -flto -funroll-loops -Winline
 
 OPTIONS=-m64 -march=native -std=gnu99 -D_GNU_SOURCE $(SPECIAL_OPTIONS)
+NAME=enumerate-balanced-ideals
 
 all: enumerate graph
 
+$(NAME).tar.bz2: $(NAME) $(HEADERS) enumerate.c weyl.c thickenings.c
+	tar cjhf $(NAME).tar.bz2 $(NAME)/enumerate.c $(NAME)/weyl.c $(NAME)/thickenings.c $(NAME)/weyl.h $(NAME)/thickenings.h $(NAME)/queue.h $(NAME)/bitvec.h $(NAME)/Makefile $(NAME)/graph.c
+
+$(NAME):
+	ln -s . $(NAME)
+
 enumerate: enumerate.o weyl.o thickenings.o
 	gcc $(OPTIONS) -o enumerate enumerate.o thickenings.o weyl.o
 
 graph: graph.o weyl.o
 	gcc $(OPTIONS) -o graph graph.o weyl.o
 
+D2n: D2n.o weyl.o thickenings.o
+	gcc $(OPTIONS) -o D2n D2n.o weyl.o thickenings.o
+
+dominant_weights: dominant_weights.o weyl.o thickenings.o
+	gcc $(OPTIONS) -o dominant_weights dominant_weights.o weyl.o thickenings.o -lcdd
+
 enumerate.o: enumerate.c $(HEADERS)
 	gcc $(OPTIONS) -c enumerate.c
 
 thickenings.o: thickenings.c $(HEADERS)
 	gcc $(OPTIONS) -c thickenings.c
 
+D2n.o: D2n.c $(HEADERS)
+	gcc $(OPTIONS) -c D2n.c
+
 weyl.o: weyl.c $(HEADERS)
 	gcc $(OPTIONS) -c weyl.c
 
 graph.o: graph.c $(HEADERS)
 	gcc $(OPTIONS) -c graph.c
 
+dominant_weights.o: dominant_weights.c $(HEADERS)
+	gcc $(OPTIONS) -c dominant_weights.c
+
 clean:
-	rm -f enumerate graph thickenings.o weyl.o enumerate.o graph.o
+	rm -f enumerate graph D2n dominant_weights thickenings.o weyl.o enumerate.o graph.o D2n.o dominant_weights.o $(NAME) $(NAME).tar.bz2

README.md

@@ -1,74 +0,0 @@
-# Enumerate balanced ideals #
-
-A program to enumerate balanced ideals in [Weyl groups]. These are subsets of the Weyl group W which are ideals with respect to the Bruhat order and which are mapped to their complement by the involution on W which is given by left-multiplication with the longest element.
-
-Balanced ideals were used by [Kapovich-Leeb-Porti] to construct cocompact domains of discontinuity in flag manifolds for the action of Anosov representations. Essentially, their result says that, if P and Q are two parabolic subgroups of a Lie group G and W its restricted Weyl group, then for every P-Anosov representation and every balanced ideal in W which is left-invariant by P∩W and right-invariant by Q∩W, there is one cocompact domain of discontinuity in the flag manifold G/Q.
-
-As the number of balanced ideals grows superexponentially with the rank of the Lie group, we have made some effort to optimize the enumeration algorithm. For example, the ideals are stored as bit vectors, so that set operations can be realized as bitwise operations. Also, only half of the ideal is stored, as the other half can be reconstructed from the balanced condition. With these and some other tricks we get an algorithm which can find tens of millions of balanced ideals per second on a single core (although outputting them is a lot slower, so this is mostly useful for determining the number of balanced ideals).
-
-## Setup ##
-
-You need a terminal, gcc, and GNU Make. Navigate to the folder and run `make`. This produces the executables `enumerate` and `graph`. Their usage is described below.
-
-## Usage ##
-
-In the most basic case, we just specify a Weyl / Coxeter group by giving its [Cartan type] as the first argument, for example C3, G2, A1A2 (for the direct product of A1 and A2) etc. The output will be a list of all balanced ideals. For example:
-
-    $ ./enumerate A3
-    A3
-    Rank: 3 Order: 24       Positive Roots: 6       Cosets: 24
-
-    Balanced ideals:
-       0 left: a c right: ab  gen: caba
-       1 left: a c right:  bc gen: abcb
-       2 left:     right:     gen: cba acb abc
-       3 left:     right:     gen: cba acb aba bc
-       4 left:     right:     gen: cba abc bac
-       5 left:     right: a   gen: cba aba bac
-       6 left:     right:     gen: acb abc bcb ba
-       7 left:     right:  b  gen: acb aba bcb
-       8 left:     right:   c gen: abc bac bcb
-       9 left:  b  right:     gen: aba bac bcb
-
-    Found 10 balanced ideals
-
-There is one line for each balanced ideal. The first column is an index, the next two columns show the left- and right-invariance of the ideal as a subset of the generators `a,b,c` of the Weyl group (see below for an explanation of the labeling). Finally a minimal generating set of the balanced ideal is shown, in the sense that it is the smallest ideal containing these Weyl group elements.
-
-If we are only interested in balanced ideal with a certain left- and right-invariance, we cangive these as the second and third arguments. The subsets will be divided out in the beginning and the enumeration algorithm will run on the double cosets, making this also a lot faster.. The empty set can be specified as "-", so `enumerate A4 - -` does the same as `enumerate A4`.
-
-    $ ./enumerate C5 a bcde
-    <a> \ C5 / <bcde>
-    Rank: 5 Order: 3840     Positive Roots: 25      Cosets: 16
-
-    Balanced ideals:
-       0 left: abcd  right:  bcde gen: bcdabcaba
-       1 left: ab de right:  bcde gen: edbcaba
-       2 left: a cd  right:  bcde gen: cdbcaba edcba
-
-    Found 3 balanced ideals
-
-Finally, we can control the amount of output using the environment variable OUTPUT_LEVEL. Values from 0 to 4 are valid. The default is 2. For example:
-
-- `OUTPUT_LEVEL=0` means no output at all. This is rarely useful.
-- `OUTPUT_LEVEL=1` only shows the number of balanced ideals (in addition to some basic info about the group). This is currently the only mode that can take full advantage of the speed of the enumeration algorithm.
-- `OUTPUT_LEVEL=2` (the default) additionally prints one line for every balanced ideal found, as explained above.
-- `OUTPUT_LEVEL=3` additionally shows the list of all double cosets, giving a minimal wordlength representative for each of them.
-- `OUTPUT_LEVEL=4` prints the same, and also the Bruhat order on the double cosets as a dot file (which can be rendered by Graphviz), and the involution on the double quotient. If you only want to see the Bruhat order, it is better to use the `graph` tool, which is made specifically for that.
-
-```
-$ OUTPUT_LEVEL=1 ./enumerate C4
-C4
-Rank: 4 Order: 384      Positive Roots: 16      Cosets: 384
-
-Found 49404510 balanced ideals
-```
-
-## Labeling of the Weyl group generators ##
-
-The allowed Cartan types are `An`, `Bn`, `Cn`, `Dn`, `E6`, `E7`, `E8`, `F4` and `G2`, where n is any positive integer, plus any direct products of them. The Coxeter group generators / simple roots are labeled `a,b,c,d,...`, first by direct factor, and then from left to right in the following diagram. So for example in the Cartan type `C2C3`, the generators are `a,b,c,d,e`, with the products `ab` and `cd` having order 4, `de` having order 3 and any other pair commuting.
-
-![Coxeter Diagrams](http://florianstecker.net/git_files/enumerate-balanced-ideals/Finite_coxeter_edited.png)
-
-[Kapovich-Leeb-Porti]: https://arxiv.org/abs/1306.3837
-[Weyl groups]: https://en.wikipedia.org/wiki/Weyl_group
-[Cartan type]: https://en.wikipedia.org/wiki/Semisimple_Lie_algebra#Classification

dominant_weights.c

@@ -0,0 +1,180 @@
+#include <stdio.h>
+#include <string.h>
+#include <malloc.h>
+#include <setoper.h>
+#include <cdd.h>
+
+#include "weyl.h"
+#include "thickenings.h"
+
+doublequotient_t *dq;
+double *vector;
+char buf[1000], buf2[1000];
+
+typedef struct {
+	dd_MatrixPtr M;
+	dd_LPSolutionPtr lps;
+} info_t;
+
+static char* alphabetize(weylgroup_element_t *e, char *str)
+{
+  if(e->wordlength == 0)
+    sprintf(str, "1");
+  else {
+    for(int j = 0; j < e->wordlength; j++)
+      str[j] = e->word[j] + 'a';
+    str[e->wordlength] = 0;
+  }
+
+  return str;
+}
+
+static char* print_vector(double *v, int rank, char *buf)
+{
+	int written = 0;
+
+	for(int i = 0; i < rank; i++) {
+		written += sprintf(buf+written, "%.4f", v[i]);
+		if(i != rank -1) {
+			sprintf(buf+written, ", ");
+			written += 2;
+		}
+	}
+
+	return buf;
+}
+
+static char* print_vector_ptr(dd_Arow v, int rank, char *buf)
+{
+	int written = 0;
+
+	for(int i = 0; i < rank; i++) {
+		written += sprintf(buf+written, "%.4f", v[i][0]);
+		if(i != rank -1) {
+			sprintf(buf+written, ", ");
+			written += 2;
+		}
+	}
+
+	return buf;
+}
+
+static void balanced_thickening_callback(const bitvec_t *pos, int size, const enumeration_info_t *ei)
+{
+	int bit, funcbit, sign;
+	dd_rowset ImL, Lbasis;
+	dd_ErrorType err = dd_NoError;
+	info_t *info = (info_t*)ei->callback_data;
+	int rank = weyl_rank(dq->type);
+
+	for(int i = 0; i < size; i++) {
+		bit = i < size/2 ? bv_get_bit(pos, i) : !bv_get_bit(pos, size - 1 - i);
+		sign = bit ? 1 : -1;
+		info->M->matrix[i][0][0] = 0.0;
+		for(int j = 0; j < rank; j++)
+			info->M->matrix[i][j+1][0] = sign*vector[rank*i+j];
+//		printf("0 %.2f %.2f %.2f %d %d\n", sign*vector[3*i], sign*vector[3*i+1], sign*vector[3*i+2], bit, funcbit);
+    }
+
+	for(int i = 0; i < rank; i++) {
+		info->M->matrix[i+size][0][0] = 0.0;
+		for(int j = 0; j < rank; j++) {
+			if(i == j)
+				info->M->matrix[i+size][j+1][0] = 1.0;
+			else
+				info->M->matrix[i+size][j+1][0] = 0.0;
+		}
+	}
+
+//	dd_WriteMatrix(stdout, info->M);
+
+	dd_FindRelativeInterior(info->M, &ImL, &Lbasis, &(info->lps), &err);
+
+	if(set_card(Lbasis) != 0)
+		printf("codim = %ld\n", set_card(Lbasis));
+	else
+		printf("weight = (%s)\n", print_vector_ptr(info->lps->sol, rank + 1, buf));
+
+	dd_FreeLPSolution(info->lps);
+
+//	printf("\n");
+}
+
+static int apply_reflection(double *in, double *out, int rank, int reflection)
+{
+	memcpy(out, in, rank*sizeof(double));
+	/*
+	out[reflection] *= -1;
+	if(reflection != 0)
+		out[reflection-1] += in[reflection];
+	if(reflection != rank-1)
+		out[reflection+1] += in[reflection];
+	*/
+	out[reflection] *= -1;
+	if(reflection != 0)
+		out[reflection] += in[reflection-1];
+	if(reflection != rank-1)
+		out[reflection] += in[reflection+1];
+
+}
+
+int main(int argc, char *argv[])
+{
+	semisimple_type_t type;
+	simple_type_t simple;
+	info_t info;
+
+	type.n = 1;
+	type.factors = &simple;
+	simple.series = 'A';
+	simple.rank = 3;
+
+	dq = weyl_generate_bruhat(type, 0, 0);
+
+	int order = weyl_order(type);
+	int rank = weyl_rank(type);
+	weylgroup_element_t *group = dq->group;
+	vector = malloc(weyl_order(type)*weyl_rank(type)*sizeof(double));
+
+	for(int i = 0; i < rank; i++)
+		vector[i] = 0.0;
+
+	for(int i = 0; 2*i < rank; i++) {
+		for(int j = i; j < rank - i; j++) {
+			vector[j] += rank - 2*i;
+		}
+	}
+
+	/*
+	vector[0] = 4.1;
+	vector[1] = 6.1;
+	vector[2] = 5.9;
+	vector[3] = 3.9;
+	*/
+
+	printf("regular element: (%s)\n", print_vector(vector, rank, buf));
+
+	for(int i = 0; i < order; i++) {
+		printf("%s (%s)\n", alphabetize(&group[i], buf), print_vector(vector + rank*i, rank, buf2));
+
+		for(int j = 0; j < rank; j++)
+			if(group[i].left[j]->wordlength > group[i].wordlength)
+				apply_reflection(&vector[rank*i], &vector[rank*group[i].left[j]->index], rank, j);
+	}
+
+	printf("\n");
+
+	dd_set_global_constants();
+	info.M = dd_CreateMatrix(order+rank, rank+1);
+	info.M->representation = dd_Inequality;
+	info.M->numbtype = dd_Real;
+	info.M->objective = dd_LPmax;
+
+	enumerate_balanced_thickenings(dq, balanced_thickening_callback, &info);
+
+	dd_FreeMatrix(info.M);
+	weyl_destroy_bruhat(dq);
+	free(vector);
+
+	return 0;
+}

enumerate.c

@@ -9,353 +9,367 @@ char stringbuffer[100];
 char stringbuffer2[100];
 
 typedef struct {
-  doublequotient_t *dq;
-  int rank;
-  int order;
-  int positive;
-  int *buffer;
-  int level;
+	doublequotient_t *dq;
+	int rank;
+	int order;
+	int positive;
+	int *buffer;
+	int level;
 } info_t;
 
 static char* alphabetize(weylgroup_element_t *e, char *str)
 {
-  if(e->wordlength == 0)
-    sprintf(str, "1");
-  else {
-    for(int j = 0; j < e->wordlength; j++)
-      str[j] = e->word[j] + 'a';
-    str[e->wordlength] = 0;
-  }
+	if(e->wordlength == 0)
+		sprintf(str, "1");
+	else {
+		for(int j = 0; j < e->wordlength; j++)
+			str[j] = e->word[j] + 'a';
+		str[e->wordlength] = 0;
+	}
 
-  return str;
+	return str;
 }
 
 /*
-int shorten(int i, unsigned long left, unsigned long right, doublequotient_t *dq, int rank)
-{
+  int shorten(int i, unsigned long left, unsigned long right, doublequotient_t *dq, int rank)
+  {
   int other, shorter = i;
   do {
-    i = shorter;
-    for(int j = 0; j < rank; j++) {
-      other = graph[shorter].left[j];
-      if(left & (1 << j) &&
-	 graph[other].wordlength < graph[shorter].wordlength)
-	shorter = other;
-      other = graph[shorter].right[j];
-      if(right & (1 << j) &&
-	 graph[other].wordlength < graph[shorter].wordlength)
-	shorter = other;
-    }
+  i = shorter;
+  for(int j = 0; j < rank; j++) {
+  other = graph[shorter].left[j];
+  if(left & (1 << j) &&
+  graph[other].wordlength < graph[shorter].wordlength)
+  shorter = other;
+  other = graph[shorter].right[j];
+  if(right & (1 << j) &&
+  graph[other].wordlength < graph[shorter].wordlength)
+  shorter = other;
+  }
   } while(shorter != i);
 
   return shorter;
-}
+  }
 */
 
 void balanced_thickening_callback(const bitvec_t *pos, int size, const enumeration_info_t *ei)
 {
-  static long totcount = 0;
+	static long totcount = 0;
 
-  if(ei->callback_data) {
-    info_t *info = (info_t*)ei->callback_data;
+	if(ei->callback_data) {
+		info_t *info = (info_t*)ei->callback_data;
 
-    unsigned long right_invariance = FIRSTBITS(info->rank);
-    unsigned long left_invariance = FIRSTBITS(info->rank);
+		unsigned long right_invariance = FIRSTBITS(info->rank);
+		unsigned long left_invariance = FIRSTBITS(info->rank);
 
-    int bit1, bit2left, bit2right, left, right;
+		int bit1, bit2left, bit2right, left, right;
 
-    for(int i = 0; i < size; i++) {
-      bit1 = i < size/2 ? bv_get_bit(pos, i) : !bv_get_bit(pos, size - 1 - i);
-      for(int j = 0; j < info->rank; j++) {
-	left = info->dq->cosets[i].min->left[j]->coset->index;
-	right = info->dq->cosets[i].min->right[j]->coset->index;
-	bit2left = left < size/2 ? bv_get_bit(pos, left) : !bv_get_bit(pos, size - 1 - left);
-	bit2right = right < size/2 ? bv_get_bit(pos, right) : !bv_get_bit(pos, size - 1 - right);
-	if(bit1 != bit2left)
-	  left_invariance &= ~BIT(j);
-	if(bit1 != bit2right)
-	  right_invariance &= ~BIT(j);
-      }
-    }
+		for(int i = 0; i < size; i++) {
+			bit1 = i < size/2 ? bv_get_bit(pos, i) : !bv_get_bit(pos, size - 1 - i);
+			for(int j = 0; j < info->rank; j++) {
+				left = info->dq->cosets[i].min->left[j]->coset->index;
+				right = info->dq->cosets[i].min->right[j]->coset->index;
+				bit2left = left < size/2 ? bv_get_bit(pos, left) : !bv_get_bit(pos, size - 1 - left);
+				bit2right = right < size/2 ? bv_get_bit(pos, right) : !bv_get_bit(pos, size - 1 - right);
+				if(bit1 != bit2left)
+					left_invariance &= ~BIT(j);
+				if(bit1 != bit2right)
+					right_invariance &= ~BIT(j);
+			}
+		}
 
-    printf("%4d left: ", totcount++);
-    for(int j = 0; j < info->rank; j++)
-      printf("%c", left_invariance & (1 << j) ? j + 'a' : ' ');
-    printf(" right: ");
-    for(int j = 0; j < info->rank; j++)
-      printf("%c", right_invariance & (1 << j) ? j + 'a' : ' ');
+		printf("%4d left: ", totcount++);
+		for(int j = 0; j < info->rank; j++)
+			printf("%c", left_invariance & (1 << j) ? j + 'a' : ' ');
+		printf(" right: ");
+		for(int j = 0; j < info->rank; j++)
+			printf("%c", right_invariance & (1 << j) ? j + 'a' : ' ');
 
-    if(info->buffer) {
-      bitvec_t low, high;
-      bv_copy(pos, &low);
-      bv_negate(pos, &high);
+		int length_profile[65]; // can't handle more that 64 positive roots anyway
 
-      //      printf(" set: ");
-      //      bv_print(stdout, &low, size/2);
-      //      printf(" ");
-      //      bv_print(stdout, &high, size/2);
+		memset(length_profile, 0, (info->positive+1)*sizeof(int));
 
-      printf(" gen: ");
+		for(int i = 0; i < size; i++) {
+			bit1 = i < size/2 ? bv_get_bit(pos, i) : !bv_get_bit(pos, size - 1 - i);
+			if(bit1)
+				length_profile[info->dq->cosets[i].min->wordlength]++;
+		}
+
+		printf(" length profile:");
+		for(int i = 0; i <= info->positive; i++)
+			printf(" %d", length_profile[i]);
+
+		if(info->buffer) {
+			bitvec_t low, high;
+			bv_copy(pos, &low);
+			bv_negate(pos, &high);
+
+			//      printf(" set: ");
+			//      bv_print(stdout, &low, size/2);
+			//      printf(" ");
+			//      bv_print(stdout, &high, size/2);
+
+			printf(" gen: ");
 
 
-      for(int i = 0; i < size/2; i++) {
-	if(!bv_get_bit(&high, i))
-	  continue;
+			for(int i = 0; i < size/2; i++) {
+				if(!bv_get_bit(&high, i))
+					continue;
 
-	printf("%s ", alphabetize(info->dq->cosets[size-1-i].min, stringbuffer));
+				printf("%s ", alphabetize(info->dq->cosets[size-1-i].min, stringbuffer));
 
-	bv_difference(&high, &ei->principal_neg[size-1-i], &high);
-	bv_difference(&low,  &ei->principal_pos[size-1-i], &low);
-      }
+				bv_difference(&high, &ei->principal_neg[size-1-i], &high);
+				bv_difference(&low,  &ei->principal_pos[size-1-i], &low);
+			}
 
-      for(int i = size/2 - 1; i >= 0; i--) {
-	if(!bv_get_bit(&low, i))
-	  continue;
+			for(int i = size/2 - 1; i >= 0; i--) {
+				if(!bv_get_bit(&low, i))
+					continue;
 
-	printf("%s ", alphabetize(info->dq->cosets[i].min, stringbuffer));
+				printf("%s ", alphabetize(info->dq->cosets[i].min, stringbuffer));
 
-	bv_difference(&low, &ei->principal_pos[i], &low);
-      }
-    }
+				bv_difference(&low, &ei->principal_pos[i], &low);
+			}
+		}
 
-    int max_length = 0;
-    for(int i = 0; i < size/2; i++) {
-      if(bv_get_bit(pos, i)) {
-	if(info->dq->cosets[i].max->wordlength > max_length)
-	  max_length = info->dq->cosets[i].max->wordlength;
-      } else {
-	if(info->dq->cosets[size-i-1].max->wordlength > max_length)
-	  max_length = info->dq->cosets[size-i-1].max->wordlength;
-      }
-    }
-    //    printf(" max length: %d", max_length);
+		int max_length = 0;
+		for(int i = 0; i < size/2; i++) {
+			if(bv_get_bit(pos, i)) {
+				if(info->dq->cosets[i].max->wordlength > max_length)
+					max_length = info->dq->cosets[i].max->wordlength;
+			} else {
+				if(info->dq->cosets[size-i-1].max->wordlength > max_length)
+					max_length = info->dq->cosets[size-i-1].max->wordlength;
+			}
+		}
+		//    printf(" max length: %d", max_length);
 
-    /*
-    if(info->buffer) {
-      printf(" generators:");
-      queue_t queue;
-      int cur, left, right;
-      int *buffer = info->buffer;
+		/*
+		  if(info->buffer) {
+		  printf(" generators:");
+		  queue_t queue;
+		  int cur, left, right;
+		  int *buffer = info->buffer;
 
-      for(int i = 0; i < size/2; i++) {
-	buffer[i] = bv_get_bit(pos, i);
-	buffer[size-1-i] = !buffer[i];
-      }
-      for(int i = size-1; i >= 0; i--) {
-	if(buffer[i]) {
-	  weylgroup_element_t *shortest = shorten(i, left_invariance, right_invariance, info->dq);
-	  printf(" %s", alphabetize(shortest, stringbuffer));
-	  buffer[i] = 0;
-	  queue_init(&queue);
-	  queue_put(&queue, i);
-	  while((cur = queue_get(&queue)) != -1) {
-	    for(doublecoset_list_t *current = info->dq->coset[cur].bruhat_lower; current; current = current->next) {
-	      int idx = current->to - info->dq->cosets;
-	      if(buffer[idx]) {
-		buffer[idx] = 0;
-		queue_put(&queue, idx);
-	      }
-	    }
-	    for(int j = 0; j < info->rank; j++) {
-	      left = info->dq->coset[cur].min.left[j] - info->dq->cosets;
-	      if(left_invariance & (1 << j) &&
-		 info->graph[left].wordlength < info->graph[cur].wordlength &&
-		 buffer[left]) {
-		buffer[left] = 0;
-		queue_put(&queue, left);
-	      }
-	      right = info->graph[cur].left[j];
-	      if(right_invariance & (1 << j) &&
-		 info->graph[right].wordlength < info->graph[cur].wordlength &&
-		 buffer[right]) {
-		buffer[right] = 0;
-		queue_put(&queue, right);
-	      }
-	    }
-	  }
+		  for(int i = 0; i < size/2; i++) {
+		  buffer[i] = bv_get_bit(pos, i);
+		  buffer[size-1-i] = !buffer[i];
+		  }
+		  for(int i = size-1; i >= 0; i--) {
+		  if(buffer[i]) {
+		  weylgroup_element_t *shortest = shorten(i, left_invariance, right_invariance, info->dq);
+		  printf(" %s", alphabetize(shortest, stringbuffer));
+		  buffer[i] = 0;
+		  queue_init(&queue);
+		  queue_put(&queue, i);
+		  while((cur = queue_get(&queue)) != -1) {
+		  for(doublecoset_list_t *current = info->dq->coset[cur].bruhat_lower; current; current = current->next) {
+		  int idx = current->to - info->dq->cosets;
+		  if(buffer[idx]) {
+		  buffer[idx] = 0;
+		  queue_put(&queue, idx);
+		  }
+		  }
+		  for(int j = 0; j < info->rank; j++) {
+		  left = info->dq->coset[cur].min.left[j] - info->dq->cosets;
+		  if(left_invariance & (1 << j) &&
+		  info->graph[left].wordlength < info->graph[cur].wordlength &&
+		  buffer[left]) {
+		  buffer[left] = 0;
+		  queue_put(&queue, left);
+		  }
+		  right = info->graph[cur].left[j];
+		  if(right_invariance & (1 << j) &&
+		  info->graph[right].wordlength < info->graph[cur].wordlength &&
+		  buffer[right]) {
+		  buffer[right] = 0;
+		  queue_put(&queue, right);
+		  }
+		  }
+		  }
+		  }
+		  }
+		  if(info->level >= 5) {
+		  printf(" ids: [0");
+		  for(int i = 1; i < size/2; i++)
+		  if(bv_get_bit(pos, i))
+		  printf(", %d", info->graph[i].id);
+		  for(int i = 0; i < size/2; i++)
+		  if(!bv_get_bit(pos, i))
+		  printf(", %d", info->graph[size-1-i].id);
+		  printf("]");
+		  }
+		  }
+		*/
+
+		printf("\n");
 	}
-      }
-      if(info->level >= 5) {
-	printf(" ids: [0");
-	for(int i = 1; i < size/2; i++)
-	  if(bv_get_bit(pos, i))
-	    printf(", %d", info->graph[i].id);
-	for(int i = 0; i < size/2; i++)
-	  if(!bv_get_bit(pos, i))
-	    printf(", %d", info->graph[size-1-i].id);
-	printf("]");
-      }
-    }
-    */
-
-    printf("\n");
-  }
 }
 
 void balanced_thickening_simple_callback(const bitvec_t *pos, int size, const enumeration_info_t *ei)
 {
-  long *count = (long*)ei->callback_data;
+	long *count = (long*)ei->callback_data;
 
-  if((++(*count)) % 100000000 == 0) {
-    bv_print(stderr, pos, size/2);
-    fprintf(stderr, "\n");
-  }
+	if((++(*count)) % 100000000 == 0) {
+		bv_print(stderr, pos, size/2);
+		fprintf(stderr, "\n");
+	}
 }
 
 int main(int argc, const char *argv[])
 {
-  semisimple_type_t type;
-  unsigned long right_invariance, left_invariance;
-  int rank, order, positive;
-  int fixpoints;
+	semisimple_type_t type;
+	unsigned long right_invariance, left_invariance;
+	int rank, order, positive;
+	int fixpoints;
 
-  doublequotient_t *dq;
+	doublequotient_t *dq;
 
-  const char *alphabet = "abcdefghijklmnopqrstuvwxyz";
+	const char *alphabet = "abcdefghijklmnopqrstuvwxyz";
 
-  // read arguments
+	// read arguments
 
-  ERROR(argc < 2, "Too few arguments!\n");
+	ERROR(argc < 2, "Too few arguments!\n");
 
-  type.n = 0;
-  for(int i = 0; i < argc - 1; i++) {
-    if(argv[i+1][0] < 'A' || argv[i+1][0] > 'G')
-      break;
-    type.n++;
-  }
+	type.n = 0;
+	for(int i = 0; i < argc - 1; i++) {
+		if(argv[i+1][0] < 'A' || argv[i+1][0] > 'G')
+			break;
+		type.n++;
+	}
 
-  type.factors = (simple_type_t*)malloc(type.n*sizeof(simple_type_t));
-  for(int i = 0; i < type.n; i++) {
-    type.factors[i].series = argv[i+1][0];
-    type.factors[i].rank = argv[i+1][1] - '0';
-    ERROR(argv[i+1][0] < 'A' || argv[i+1][0] > 'G' || argv[i+1][1] < '1' || argv[i+1][1] > '9', "Arguments must be Xn with X out of A-G and n out of 1-9\n");
-  }
+	type.factors = (simple_type_t*)malloc(type.n*sizeof(simple_type_t));
+	for(int i = 0; i < type.n; i++) {
+		type.factors[i].series = argv[i+1][0];
+		type.factors[i].rank = argv[i+1][1] - '0';
+		ERROR(argv[i+1][0] < 'A' || argv[i+1][0] > 'G' || argv[i+1][1] < '1' || argv[i+1][1] > '9', "Arguments must be Xn with X out of A-G and n out of 1-9\n");
+	}
 
-  left_invariance = right_invariance = 0;
+	left_invariance = right_invariance = 0;
 
-  if(argc - type.n >= 3) {
-    if(strcmp(argv[type.n + 1], "-") != 0)
-      for(int i = 0; i < strlen(argv[type.n + 1]); i++)
-	left_invariance |= (1 << (argv[type.n + 1][i] - 'a'));
-    if(strcmp(argv[type.n + 2], "-") != 0)
-      for(int i = 0; i < strlen(argv[type.n + 2]); i++)
-	right_invariance |= (1 << (argv[type.n + 2][i] - 'a'));
-  }
+	if(argc - type.n >= 3) {
+		if(strcmp(argv[type.n + 1], "-") != 0)
+			for(int i = 0; i < strlen(argv[type.n + 1]); i++)
+				left_invariance |= (1 << (argv[type.n + 1][i] - 'a'));
+		if(strcmp(argv[type.n + 2], "-") != 0)
+			for(int i = 0; i < strlen(argv[type.n + 2]); i++)
+				right_invariance |= (1 << (argv[type.n + 2][i] - 'a'));
+	}
 
-  // generate graph
+	// generate graph
 
-  dq = weyl_generate_bruhat(type, left_invariance, right_invariance);
+	dq = weyl_generate_bruhat(type, left_invariance, right_invariance);
 
-  // print stuff
+	// print stuff
 
-  int output_level = 2;
-  if(getenv("OUTPUT_LEVEL"))
-    output_level = atoi(getenv("OUTPUT_LEVEL"));
+	int output_level = 2;
+	if(getenv("OUTPUT_LEVEL"))
+		output_level = atoi(getenv("OUTPUT_LEVEL"));
 
-  rank = weyl_rank(type);                // number of simple roots
-  order = weyl_order(type);              // number of Weyl group elements
-  positive = weyl_positive(type);        // number of positive roots
+	rank = weyl_rank(type);                // number of simple roots
+	order = weyl_order(type);              // number of Weyl group elements
+	positive = weyl_positive(type);        // number of positive roots
 
-  if(output_level >= 1) {
-    if(left_invariance) {
-      printf("<");
-      for(int j = 0; j < rank; j++)
-	if(left_invariance & BIT(j))
-	  fputc(alphabet[j], stdout);
-      printf("> \\ ");
-    }
+	if(output_level >= 1) {
+		if(left_invariance) {
+			printf("<");
+			for(int j = 0; j < rank; j++)
+				if(left_invariance & BIT(j))
+					fputc(alphabet[j], stdout);
+			printf("> \\ ");
+		}
 
-    for(int i = 0; i < type.n; i++)
-      printf("%s%c%d", i == 0 ? "" : " x ", type.factors[i].series, type.factors[i].rank);
+		for(int i = 0; i < type.n; i++)
+			printf("%s%c%d", i == 0 ? "" : " x ", type.factors[i].series, type.factors[i].rank);
 
-    if(right_invariance) {
-      printf(" / <");
-      for(int j = 0; j < rank; j++)
-	if(right_invariance & BIT(j))
-	  fputc(alphabet[j], stdout);
-      printf(">");
-    }
-    fprintf(stdout, "\n");
+		if(right_invariance) {
+			printf(" / <");
+			for(int j = 0; j < rank; j++)
+				if(right_invariance & BIT(j))
+					fputc(alphabet[j], stdout);
+			printf(">");
+		}
+		fprintf(stdout, "\n");
 
-    fprintf(stdout, "Rank: %d\tOrder: %d\tPositive Roots: %d\tCosets: %d\n\n", rank, order, positive, dq->count);
-  }
+		fprintf(stdout, "Rank: %d\tOrder: %d\tPositive Roots: %d\tCosets: %d\n\n", rank, order, positive, dq->count);
+	}
 
-  if(output_level >= 3) {
-    fprintf(stdout, "Shortest coset representatives: \n");
-    for(int i = 0, wl = 0; i < dq->count; i++) {
-      if(dq->cosets[i].min->wordlength > wl) {
-	printf("\n");
-	wl = dq->cosets[i].min->wordlength;
-      }
-      //      fprintf(stdout, "%s(%d) ", alphabetize(dq->cosets[i].min, stringbuffer), dq->cosets[i].max->wordlength);
-      fprintf(stdout, "%s ", alphabetize(dq->cosets[i].min, stringbuffer));
-    }
-    fprintf(stdout, "\n\n");
-  }
+	if(output_level >= 3) {
+		fprintf(stdout, "Shortest coset representatives: \n");
+		for(int i = 0, wl = 0; i < dq->count; i++) {
+			if(dq->cosets[i].min->wordlength > wl) {
+				printf("\n");
+				wl = dq->cosets[i].min->wordlength;
+			}
+			//      fprintf(stdout, "%s(%d) ", alphabetize(dq->cosets[i].min, stringbuffer), dq->cosets[i].max->wordlength);
+			fprintf(stdout, "%s ", alphabetize(dq->cosets[i].min, stringbuffer));
+		}
+		fprintf(stdout, "\n\n");
+	}
 
-  if(output_level >= 4) {
-    fprintf(stdout, "Bruhat order in graphviz format:\n");
-    fprintf(stdout, "digraph test123 {\n");
-    for(int i = 0; i < dq->count; i++)
-      for(doublecoset_list_t *current = dq->cosets[i].bruhat_lower; current; current = current->next)
-	fprintf(stdout, "%s -> %s;\n",
-		alphabetize(dq->cosets[i].min, stringbuffer),
-		alphabetize(current->to->min, stringbuffer2));
-    fprintf(stdout, "}\n\n");
-  }
+	if(output_level >= 4) {
+		fprintf(stdout, "Bruhat order in graphviz format:\n");
+		fprintf(stdout, "digraph test123 {\n");
+		for(int i = 0; i < dq->count; i++)
+			for(doublecoset_list_t *current = dq->cosets[i].bruhat_lower; current; current = current->next)
+				fprintf(stdout, "%s -> %s;\n",
+				        alphabetize(dq->cosets[i].min, stringbuffer),
+				        alphabetize(current->to->min, stringbuffer2));
+		fprintf(stdout, "}\n\n");
+	}
 
-  if(output_level >= 4) {
-    fprintf(stdout, "Opposites:\n");
-    for(int i = 0; i < dq->count; i++)
-      fprintf(stdout, "%s <-> %s\n",
-	      alphabetize(dq->cosets[i].min, stringbuffer),
-	      alphabetize(dq->cosets[i].opposite->min, stringbuffer2));
-    fprintf(stdout, "\n");
-  }
+	if(output_level >= 4) {
+		fprintf(stdout, "Opposites:\n");
+		for(int i = 0; i < dq->count; i++)
+			fprintf(stdout, "%s <-> %s\n",
+			        alphabetize(dq->cosets[i].min, stringbuffer),
+			        alphabetize(dq->cosets[i].opposite->min, stringbuffer2));
+		fprintf(stdout, "\n");
+	}
 
-  fixpoints = 0;
-  for(int i = 0; i < dq->count; i++)
-    if(dq->cosets[i].opposite == &dq->cosets[i]) {
-      if(output_level >= 1) {
-	if(fixpoints == 0)
-	  fprintf(stdout, "No balanced ideals since the longest element fixes the following cosets:");
-	fprintf(stdout, " %s", alphabetize(dq->cosets[i].min, stringbuffer));
-      }
-      fixpoints++;
-    }
-  if(output_level >= 1 && fixpoints)
-    fprintf(stdout, "\n\n");
+	fixpoints = 0;
+	for(int i = 0; i < dq->count; i++)
+		if(dq->cosets[i].opposite == &dq->cosets[i]) {
+			if(output_level >= 1) {
+				if(fixpoints == 0)
+					fprintf(stdout, "No balanced ideals since the longest element fixes the following cosets:");
+				fprintf(stdout, " %s", alphabetize(dq->cosets[i].min, stringbuffer));
+			}
+			fixpoints++;
+		}
+	if(output_level >= 1 && fixpoints)
+		fprintf(stdout, "\n\n");
 
 
-  if(!fixpoints) {
-    int *buffer = (int*)malloc(dq->count*sizeof(int));
+	if(!fixpoints) {
+		int *buffer = (int*)malloc(dq->count*sizeof(int));
 
-    info_t info;
-    info.dq = dq;
-    info.rank = weyl_rank(type);
-    info.order = weyl_order(type);
-    info.positive = weyl_positive(type);
-    info.buffer = buffer;
-    info.level = output_level;
+		info_t info;
+		info.dq = dq;
+		info.rank = weyl_rank(type);
+		info.order = weyl_order(type);
+		info.positive = weyl_positive(type);
+		info.buffer = buffer;
+		info.level = output_level;
 
-    ERROR(dq->count > 2*BV_BLOCKSIZE*BV_RANK, "We can handle at most %d cosets. Increase BV_RANK if more is needed.\n", 2*BV_BLOCKSIZE*BV_RANK);
+		ERROR(dq->count > 2*BV_BLOCKSIZE*BV_RANK, "We can handle at most %d cosets. Increase BV_RANK if more is needed.\n", 2*BV_BLOCKSIZE*BV_RANK);
 
-    long count;
-    if(output_level >= 2) {
-      fprintf(stdout, "Balanced ideals:\n");
-      count = enumerate_balanced_thickenings(dq, balanced_thickening_callback, &info);
-      fprintf(stdout, "\n");
-    } else {
-      long outputcount = 0;
-      count = enumerate_balanced_thickenings(dq, balanced_thickening_simple_callback, &outputcount);
-    }
+		long count;
+		if(output_level >= 2) {
+			fprintf(stdout, "Balanced ideals:\n");
+			count = enumerate_balanced_thickenings(dq, balanced_thickening_callback, &info);
+			fprintf(stdout, "\n");
+		} else {
+			long outputcount = 0;
+			count = enumerate_balanced_thickenings(dq, balanced_thickening_simple_callback, &outputcount);
+		}
 
-    if(output_level >= 1)
-      fprintf(stdout, "Found %ld balanced ideal%s\n", count, count == 1 ? "" : "s");
-  }
+		if(output_level >= 1)
+			fprintf(stdout, "Found %ld balanced ideal%s\n", count, count == 1 ? "" : "s");
+	}
 
-  weyl_destroy_bruhat(dq);
-  free(type.factors);
+	weyl_destroy_bruhat(dq);
+	free(type.factors);
 
-  return 0;
+	return 0;
 }

idealbounds.c

@@ -0,0 +1,74 @@
+#include "weyl.h"
+#include "queue.h"
+
+#include <limits.h>
+#include <string.h>
+#include <stdio.h>
+
+static char* alphabetize(weylgroup_element_t *e, char *str)
+{
+  if(e->wordlength == 0)
+    sprintf(str, "1");
+  else {
+    for(int j = 0; j < e->wordlength; j++)
+      str[j] = e->word[j] + 'a';
+    str[e->wordlength] = 0;
+  }
+
+  return str;
+}
+
+int main(int argc, char *argv[])
+{
+	semisimple_type_t type;
+	simple_type_t simple;
+	char buf[100];
+
+	simple.series = 'A';
+	simple.rank = atoi(argv[1]);
+	type.n = 1;
+	type.factors = &simple;
+
+	int order = weyl_order(type);
+	doublequotient_t *dq = weyl_generate_bruhat(type, 0, 0);
+
+	queue_t q;
+	int cur;
+	int *viewed = (int*)malloc(order*sizeof(int));
+	int found;
+	int minimum = INT_MAX;
+
+	for(int i = 0; i < order; i++) {
+		found = 0;
+		memset(viewed, 0, order*sizeof(int));
+		queue_init(&q);
+		queue_put(&q, dq->cosets[i].opposite->index);
+		while((cur = queue_get(&q)) != -1) {
+			if(cur == i) { // found what we were looking for
+				//	printf("foo: %d %d\n", i, dq->cosets[i].min->wordlength);
+				found = 1;
+				break;
+			}
+			for(doublecoset_list_t *current = dq->cosets[cur].bruhat_lower; current; current = current->next) {
+				if(!viewed[current->to->index]) {
+					viewed[current->to->index] = 1;
+					queue_put(&q, current->to->index);
+				}
+			}
+		}
+		if(!found) {
+			printf("%s %d not found\n", alphabetize(dq->cosets[i].min, buf), dq->cosets[i].min->wordlength);
+			if(dq->cosets[i].min->wordlength < minimum)
+				minimum = dq->cosets[i].min->wordlength;
+//			break;
+		} else {
+			printf("%s %d found\n", alphabetize(dq->cosets[i].min, buf), dq->cosets[i].min->wordlength);
+		}
+	}
+
+	printf("Minimum l(w) such that w0w can be in a balanced ideal: %d\n", minimum);
+
+	free(viewed);
+
+	return 0;
+}

old/coxeter.c

@@ -0,0 +1,312 @@
+#include "coxeter.h"
+#include "queue.h"
+
+#include <memory.h>
+#include <gsl/gsl_linalg.h>
+#include <gsl/gsl_blas.h>
+
+static void applyGenerator(int i, double *x, double *y, int rank, double **schlaefliMatrix)
+{
+  memcpy(y, x, rank*sizeof(double));
+  for(int j = 0; j < rank; j++)
+    y[i] -= schlaefliMatrix[i][j]*x[j];
+}
+
+static int check_equal_sector(gsl_matrix *x1, gsl_matrix *x2, gsl_matrix *yinv, gsl_matrix *schlaefli, gsl_vector *starting, gsl_vector *i1, gsl_vector *i2)
+{
+  double scalarProduct;
+  int rank = x1->size1;
+
+  // calculate <y^{-1} * x1 * x2 * s, e_i> for all i, or identically the components of schlaefli*y^{-1}*x*s
+  gsl_blas_dgemv(CblasNoTrans, 1.0, x2, starting, 0.0, i1);
+  gsl_blas_dgemv(CblasNoTrans, 1.0, x1, i1, 0.0, i2);
+  gsl_blas_dgemv(CblasNoTrans, 1.0, yinv, i2, 0.0, i1);
+  gsl_blas_dgemv(CblasNoTrans, 1.0, schlaefli, i1, 0.0, i2);
+  for(int i = 0; i < rank; i++)
+    if(gsl_vector_get(i2, i) < 0)
+      return 0;
+  return 1;
+}
+
+static void invert(gsl_matrix *x, gsl_matrix *xinv)
+{
+  int rank = x->size1;
+  gsl_matrix *xLU = gsl_matrix_alloc(rank, rank);
+  gsl_permutation *p = gsl_permutation_alloc(rank);
+  int s;
+  gsl_matrix_memcpy(xLU, x);
+  gsl_linalg_LU_decomp(xLU, p, &s);
+  gsl_linalg_LU_invert(xLU, p, xinv);
+  gsl_permutation_free(p);
+  gsl_matrix_free(xLU);
+}
+
+static void generate_schlaefli_matrix(semisimple_type_t type, gsl_matrix *mat)
+{
+  gsl_matrix_set_zero(mat);
+  int offset = 0;
+
+  for(int k = 0; k < type.n; k++) {
+    if(type.factors[k].series == 'A') {
+      for(int i = 0; i < type.factors[k].rank; i++)
+	for(int j = 0; j < type.factors[k].rank; j++)
+	  if(i == j)
+	    gsl_matrix_set(mat, offset + i, offset + j, 2.0);
+	  else if(i - j == 1 || i - j == -1)
+	    gsl_matrix_set(mat, offset + i, offset + j, -1.0);
+    } else if(type.factors[k].series == 'B' || type.factors[k].series == 'C') {
+      for(int i = 0; i < type.factors[k].rank; i++)
+	for(int j = 0; j < type.factors[k].rank; j++)
+	  if(i == j)
+	    gsl_matrix_set(mat, offset + i, offset + j, 2.0);
+	  else if(i == 0 && j == 1 || i == 1 && j == 0)
+	    gsl_matrix_set(mat, offset + i, offset + j, -sqrt(2.0));
+	  else if(i - j == 1 || i - j == -1)
+	    gsl_matrix_set(mat, offset + i, offset + j, -1.0);
+    } else if(type.factors[k].series == 'D') {
+      for(int i = 0; i < type.factors[k].rank; i++)
+	for(int j = 0; j < type.factors[k].rank; j++)
+	  if(i == j)
+	    gsl_matrix_set(mat, offset + i, offset + j, 2.0);
+	  else if(i > 0 && j > 0 && (i - j == 1 || i - j == -1) || i == 0 && j == 2 || i == 2 && j == 0)
+	    gsl_matrix_set(mat, offset + i, offset + j, -1.0);
+    } else if(type.factors[k].series == 'F') {
+      ERROR(type.factors[k].rank != 4, "A Coxeter group of type %c%d does not exist or is not implemented!\n", type.factors[k].series, type.factors[k].rank);
+      for(int i = 0; i < 4; i++)
+	gsl_matrix_set(mat, offset + i, offset + i, 2.0);
+      for(int i = 0; i < 3; i++) {
+	gsl_matrix_set(mat, offset + i, offset + i + 1, i == 1 ? -sqrt(2.0) : -1.0);
+	gsl_matrix_set(mat, offset + i + 1, offset + i, i == 1 ? -sqrt(2.0) : -1.0);
+      }
+    } else if(type.factors[k].series == 'G') {
+      ERROR(type.factors[k].rank != 2, "A Coxeter group of type %c%d does not exist or is not implemented!\n", type.factors[k].series, type.factors[k].rank);
+      gsl_matrix_set(mat, offset + 0, offset + 0, 2.0);
+      gsl_matrix_set(mat, offset + 0, offset + 1, -sqrt(3.0));
+      gsl_matrix_set(mat, offset + 1, offset + 0, -sqrt(3.0));
+      gsl_matrix_set(mat, offset + 1, offset + 1, 2.0);
+    } else {
+      ERROR(1, "A Coxeter group of type %c%d does not exist or is not implemented!\n", type.factors[k].series, type.factors[k].rank);
+    }
+
+    offset += type.factors[k].rank;
+  }
+}
+
+int coxeter_rank(semisimple_type_t type)
+{
+  int rank = 0;
+  for(int i = 0; i < type.n; i++)
+    rank += type.factors[i].rank;
+  return rank;
+}
+
+int coxeter_order(semisimple_type_t type)
+{
+  int order = 1;
+  for(int i = 0; i < type.n; i++) {
+    if(type.factors[i].series == 'A') { // (rank+1)!
+      for(int j = 1; j <= type.factors[i].rank + 1; j++)
+	order *= j;
+    } else if(type.factors[i].series == 'B' || type.factors[i].series == 'C') { // 2^rank * rank!
+      for(int j = 1; j <= type.factors[i].rank; j++)
+	order *= 2*j;
+    } else if(type.factors[i].series == 'D') { // 2^(rank-1) * rank!
+      for(int j = 2; j <= type.factors[i].rank; j++)
+	order *= 2*j;
+    } else if(type.factors[i].series == 'E') {
+      if(type.factors[i].rank == 6)
+	order *= 51840;
+      else if(type.factors[i].rank == 7)
+	order *= 2903040;
+      else if(type.factors[i].rank == 8)
+	order *= 696729600;
+      else
+	ERROR(1, "A Coxeter group of type %c%d does not exist or is not implemented!\n", type.factors[i].series, type.factors[i].rank);
+    } else if(type.factors[i].series == 'F') {
+      ERROR(type.factors[i].rank != 4, "A Coxeter group of type %c%d does not exist or is not implemented!\n", type.factors[i].series, type.factors[i].rank);
+      order *= 1152;
+    } else if(type.factors[i].series == 'G') {
+      ERROR(type.factors[i].rank != 2, "A Coxeter group of type %c%d does not exist or is not implemented!\n", type.factors[i].series, type.factors[i].rank);
+      order *= 12;
+    } else if(type.factors[i].series == 'H') {
+      if(type.factors[i].rank == 2)
+	order *= 10;
+      else if(type.factors[i].rank == 3)
+	order *= 120;
+      else if(type.factors[i].rank == 4)
+	order *= 14400;
+      else
+	ERROR(1, "A Coxeter group of type %c%d does not exist or is not implemented!\n", type.factors[i].series, type.factors[i].rank);
+    } else {
+      ERROR(1, "A Coxeter group of type %c%d does not exist or is not implemented!\n", type.factors[i].series, type.factors[i].rank);
+    }
+  }
+  return order;
+}
+
+int coxeter_hyperplanes(semisimple_type_t type)
+{
+  int hyperplanes = 0;
+  for(int i = 0; i < type.n; i++) {
+    if(type.factors[i].series == 'A') // rank*(rank+1)/2
+      hyperplanes += (type.factors[i].rank * (type.factors[i].rank + 1)) / 2;
+    else if(type.factors[i].series == 'B' || type.factors[i].series == 'C') // rank * rank
+      hyperplanes += type.factors[i].rank * type.factors[i].rank;
+    else if(type.factors[i].series == 'D') // rank * (rank - 1)
+      hyperplanes += type.factors[i].rank * (type.factors[i].rank - 1);
+    else if(type.factors[i].series == 'E') {
+      if(type.factors[i].rank == 6)
+	hyperplanes += 36;
+      else if(type.factors[i].rank == 7)
+	hyperplanes += 63;
+      else if(type.factors[i].rank == 8)
+	hyperplanes += 120;
+      else
+	ERROR(1, "A Coxeter group of type %c%d does not exist or is not implemented!\n", type.factors[i].series, type.factors[i].rank);
+    } else if(type.factors[i].series == 'F') {
+      ERROR(type.factors[i].rank != 4, "A Coxeter group of type %c%d does not exist or is not implemented!\n", type.factors[i].series, type.factors[i].rank);
+      hyperplanes += 24;
+    } else if(type.factors[i].series == 'G') {
+      ERROR(type.factors[i].rank != 2, "A Coxeter group of type %c%d does not exist or is not implemented!\n", type.factors[i].series, type.factors[i].rank);
+      hyperplanes += 6;
+    } else {
+      ERROR(1, "A Coxeter group of type %c%d does not exist or is not implemented!\n", type.factors[i].series, type.factors[i].rank);
+    }
+  }
+  return hyperplanes;
+}
+
+unsigned long opposition_involution(semisimple_type_t type, unsigned long theta)
+{
+  int offset = 0;
+  unsigned long result = 0;
+  for(int i = 0; i < type.n; i++) {
+    unsigned long current = (theta >> offset) & ((1 << type.factors[i].rank) - 1);
+    unsigned long iota_current;
+
+    if(type.factors[i].series == 'B' || type.factors[i].series == 'C' || type.factors[i].series == 'F' || type.factors[i].series == 'G') {
+      iota_current = current;
+    } else if(type.factors[i].series == 'A') {
+      iota_current = 0;
+      for(int j = 0; j < type.factors[i].rank; j++)
+	iota_current += ((current >> j) & 1) << (type.factors[i].rank - 1 - j);
+    } else if(type.factors[i].series == 'D') {
+      if(type.factors[i].rank % 2 == 0) {
+	iota_current = current;
+      } else {
+	ERROR(1, "The opposition involution for type %c%d is not yet implemented!\n", type.factors[i].series, type.factors[i].rank);
+      }
+    } else if(type.factors[i].series == 'E') {
+      ERROR(1, "The opposition involution for En is not yet implemented!\n");
+    }
+
+    result += iota_current << offset;
+    offset += type.factors[i].rank;
+  }
+
+  return result;
+}
+
+static void generate_starting_vector(int rank, gsl_matrix *schlaefli, gsl_vector *result)
+{
+  gsl_matrix *schlaefliLU = gsl_matrix_alloc(rank, rank);
+  gsl_vector *diagonal = gsl_vector_alloc(rank);
+  gsl_permutation *p = gsl_permutation_alloc(rank);
+  int s;
+  for(int i = 0; i < rank; i++)
+    gsl_vector_set(diagonal, i, 1.0);
+  gsl_matrix_memcpy(schlaefliLU, schlaefli);
+  gsl_linalg_LU_decomp(schlaefliLU, p, &s);
+  gsl_linalg_LU_solve(schlaefliLU, p, diagonal, result);
+  gsl_permutation_free(p);
+  gsl_vector_free(diagonal);
+  gsl_matrix_free(schlaefliLU);
+}
+
+void generate_coxeter_graph(semisimple_type_t type, int *result)
+{
+  int rank = coxeter_rank(type);
+  int order = coxeter_order(type);
+  int element_count;
+  gsl_matrix *schlaefliMatrix = gsl_matrix_alloc(rank, rank);
+  gsl_vector *startingVector = gsl_vector_alloc(rank);
+  gsl_matrix *generators = (gsl_matrix*)malloc(rank*sizeof(gsl_matrix));
+  double *generators_data = (double*)malloc(rank*rank*rank*sizeof(double));
+  gsl_matrix *elements = (gsl_matrix*)malloc(order*sizeof(gsl_matrix));
+  double *elements_data = (double*)malloc(rank*rank*order*sizeof(double));
+  gsl_matrix *inverses = (gsl_matrix*)malloc(order*sizeof(gsl_matrix));
+  double *inverses_data = (double*)malloc(rank*rank*order*sizeof(double));
+  gsl_vector *i1 = gsl_vector_alloc(rank);
+  gsl_vector *i2 = gsl_vector_alloc(rank);
+  gsl_matrix *current_element = gsl_matrix_alloc(rank, rank);
+  queue_t queue;
+  int current;
+
+  for(int i = 0; i < rank; i++)
+    generators[i] = gsl_matrix_view_array(generators_data + i*rank*rank, rank, rank).matrix;
+  for(int i = 0; i < order; i++)
+    elements[i] = gsl_matrix_view_array(elements_data + i*rank*rank, rank, rank).matrix;
+  for(int i = 0; i < order; i++)
+    inverses[i] = gsl_matrix_view_array(inverses_data + i*rank*rank, rank, rank).matrix;
+
+  generate_schlaefli_matrix(type, schlaefliMatrix);
+  generate_starting_vector(rank, schlaefliMatrix, startingVector);
+
+  for(int i = 0; i < rank; i++) {
+    gsl_matrix_set_identity(&generators[i]);
+    for(int j = 0; j < rank; j++)
+      if(i == j)
+	gsl_matrix_set(&generators[i], i, j, -1.0);
+      else
+	gsl_matrix_set(&generators[i], i, j, -gsl_matrix_get(schlaefliMatrix, i, j));
+    //    gsl_matrix_fprintf(stdout, &generators[i], "%f");
+    //    printf("\n");
+  }
+
+  queue_init(&queue);
+  queue_put(&queue, 0);
+  element_count = 1;
+  gsl_matrix_set_identity(&elements[0]);
+  gsl_matrix_set_identity(&inverses[0]);
+  while((current = queue_get(&queue)) != -1) {
+    for(int i = 0; i < rank; i++) {
+      int j;
+      for(j = 0; j < element_count; j++) {
+	if(check_equal_sector(&generators[i], &elements[current], &inverses[j], schlaefliMatrix, startingVector, i1, i2)) { // generators[i] * elements[current] = elements[j]
+	  result[rank*current + i] = j;
+	  break;
+	}
+      }
+      // if no existing element equals generators[i] * elements[current], create one
+      if(j == element_count) {
+	ERROR(element_count >= order, "Got more elements than the order of the group should be!\n");
+	gsl_blas_dgemm(CblasNoTrans, CblasNoTrans, 1.0, &generators[i], &elements[current], 0.0, &elements[element_count]);
+	invert(&elements[element_count], &inverses[element_count]);
+	result[rank*current + i] = element_count;
+	queue_put(&queue, element_count);
+	element_count++;
+      }
+    }
+  }
+
+  ERROR(element_count != order, "Something went wrong building the Coxeter group. Found %d elements, %d expected\n", element_count, order);
+
+  /*
+  for(int i = 0; i < order; i++) {
+    printf("%d: ", i);
+    for(int j = 0; j < rank; j++)
+      printf("%d ", result[rank*i + j]);
+    printf("\n");
+  }
+  */
+
+  gsl_vector_free(startingVector);
+  gsl_vector_free(i1);
+  gsl_vector_free(i2);
+  gsl_matrix_free(schlaefliMatrix);
+  gsl_matrix_free(current_element);
+  free(generators);
+  free(elements);
+  free(generators_data);
+  free(elements_data);
+}

old/coxeter.h

@@ -0,0 +1,20 @@
+#ifndef COXETER_H
+#define COXETER_H
+
+typedef struct {
+  char series;
+  int rank;
+} simple_type_t;
+
+typedef struct {
+  int n;
+  simple_type_t *factors;
+} semisimple_type_t;
+
+void generate_coxeter_graph(semisimple_type_t type, int *result);
+int coxeter_order(semisimple_type_t type);
+int coxeter_hyperplanes(semisimple_type_t type);
+int coxeter_rank(semisimple_type_t type);
+unsigned long opposition_involution(semisimple_type_t type, unsigned long theta);
+
+#endif

old/process-old.c

@@ -0,0 +1,193 @@
+#include <stdio.h>
+#include <string.h>
+#include <sys/stat.h>
+
+#include "thickenings.h"
+#include "coxeter.h"
+#include "queue.h"
+
+#define SWAP(t, a, b) do {t tmp = a; a = b; b = tmp;} while(0)
+
+char *stringify_SLn1_permutation(int *word, int wordlength, int rank, char *str)
+{
+  for(int i = 0; i <= rank; i++)
+    str[i] = '1' + i;
+  str[rank+1] = 0;
+
+  for(int i = 0; i < wordlength; i++) {
+    char tmp = str[word[i]];
+    str[word[i]] = str[word[i]+1];
+    str[word[i]+1] = tmp;
+  }
+  return str;
+}
+
+
+char *stringify_Onn1_permutation(int *word, int wordlength, int rank, char *str)
+{
+  for(int i = 0; i <= rank*2; i++)
+    str[i] = '1' + i;
+  str[2*rank+1] = 0;
+
+  for(int i = 0; i < wordlength; i++) {
+    if(word[i] == 0)
+      SWAP(char, str[rank-1], str[rank+1]);
+    else {
+      SWAP(char, str[rank-word[i]], str[rank-word[i]-1]);
+      SWAP(char, str[rank+word[i]], str[rank+word[i]+1]);
+    }
+  }
+  return str;
+}
+
+int main(int argc, const char *argv[])
+{
+  FILE *infile;
+  struct stat st;
+  int rank, order, hyperplanes;
+  semisimple_type_t type;
+  int n;
+  signed char *level;
+  node_t *graph;
+  int *left, *right;
+  int left_invariant, right_invariant;
+  int left_invariant_wanted = 0, right_invariant_wanted = 0;
+
+  unsigned long left_invariance, right_invariance;
+  edgelist_t *edgelists;
+  int *words;
+
+  queue_t queue;
+  int current;
+  int *seen;
+  int *generators;
+  int ngens;
+
+  char string_buffer1[1000];
+  const char *alphabet = "abcdefghijklmnopqrstuvwxyz";
+
+  // parse arguments
+
+  if(argc < 2)
+    infile = stdin;
+  else {
+    if(strcmp(argv[1], "-") == 0)
+      infile = stdin;
+    else
+      infile = fopen(argv[1], "rb");
+
+    if(argc >= 4) {
+      if(strcmp(argv[2], "-") != 0)
+	for(int i = 0; i < strlen(argv[2]); i++)
+	  left_invariant_wanted |= (1 << (argv[2][i] - 'a'));
+      if(strcmp(argv[3], "-") != 0)
+	for(int i = 0; i < strlen(argv[3]); i++)
+	  right_invariant_wanted |= (1 << (argv[3][i] - 'a'));
+    }
+  }
+
+  fread(&type.n, sizeof(int), 1, infile);  // we completely trust the input data
+  type.factors = malloc(type.n * sizeof(simple_type_t));
+  fread(type.factors, sizeof(simple_type_t), type.n, infile);
+  fread(&left_invariance, sizeof(simple_type_t), type.n, infile);
+  fread(&right_invariance, sizeof(simple_type_t), type.n, infile);
+
+  // get graph
+
+  rank = coxeter_rank(type);
+  order = coxeter_order(type);
+  hyperplanes = coxeter_hyperplanes(type);
+  ERROR(strlen(alphabet) < rank, "The alphabet has too few letters\n");
+  seen = (int*)malloc(order*sizeof(int));
+  generators = (int*)malloc(order*sizeof(int));
+  level = (signed char*)malloc(order*sizeof(int));
+
+  graph = graph_alloc(type);
+  prepare_graph(type, graph);
+
+  // finally do stuff
+
+  int counter = 0;
+
+  while(fread(level, sizeof(signed char), order, infile) == order) {
+
+    /*
+    if((counter++) % 100000 == 0)
+      print_thickening(rank, order, level, 0, 0, 0, alphabet, stdout);
+    continue;
+    */
+
+    left_invariant = right_invariant = -1; // all 1s
+    for(int j = 0; j < order; j++) {
+      for(int k = 0; k < rank; k++) {
+	if(level[j] > 0 && level[graph[j].left[k]] < 0 || level[j] < 0 && level[graph[j].left[k]] > 0) {
+	  left_invariant &= ~(1 << k);
+	}
+	if(level[j] > 0 && level[graph[j].right[k]] < 0 || level[j] < 0 && level[graph[j].right[k]] > 0) {
+	  right_invariant &= ~(1 << k);
+	}
+      }
+    }
+
+    if((~left_invariant & left_invariant_wanted) == 0 && (~right_invariant & right_invariant_wanted) == 0) {
+      ngens = 0;
+      memset(generators, 0, order*sizeof(int));
+      for(int j = 0; j < order; j++) {
+	if(level[j] == HEAD_MARKER && generators[j] == 0) { // ignore the generator, if it is equivalent to one already seen
+	  ngens++;
+	  queue_init(&queue);
+	  queue_put(&queue, j);
+	  while((current = queue_get(&queue)) != -1) {
+	    if(generators[current] == 0) { // visit everyone only once
+	      generators[current] = ngens;
+	      for(int k = 0; k < rank; k++) {
+		if(left_invariant & (1 << k))
+		queue_put(&queue, graph[current].left[k]);
+		if(right_invariant & (1 << k))
+		  queue_put(&queue, graph[current].right[k]);
+	      }
+	    }
+	  }
+	}
+      }
+
+      printf("left: ");
+      for(int j = 0; j < rank; j++)
+	printf("%c", left_invariant & (1 << j) ? alphabet[j] : ' ');
+      printf(" right: ");
+      for(int j = 0; j < rank; j++)
+	printf("%c", right_invariant & (1 << j) ? alphabet[j] : ' ');
+      printf(" generators: ");
+
+      memset(seen, 0, order*sizeof(int));
+      for(int i = 0; i < order; i++) {
+	if(generators[i] != 0 && seen[generators[i]-1] == 0) {
+	  seen[generators[i]-1] = 1;
+	  //	if(type.n == 1 && type.factors[0].series == 'A')
+	  //	  printf("%s ", stringify_SLn1_permutation(graph[i].word, graph[i].wordlength, rank, string_buffer1));
+	  //	else if(type.n == 1 && (type.factors[0].series == 'B' || type.factors[0].series == 'C'))
+	  //	  printf("%s ", stringify_Onn1_permutation(graph[i].word, graph[i].wordlength, rank, string_buffer1));
+	  //	else
+	  if(i == 0)
+	    printf("1 ");
+	  else
+	    printf("%s ", alphabetize(graph[i].word, graph[i].wordlength, alphabet, string_buffer1));
+	}
+      }
+
+      printf("\n");
+    }
+  }
+
+  if(infile != stdin)
+    fclose(infile);
+
+  // cleanup
+
+  graph_free(type, graph);
+  free(seen);
+  free(generators);
+  free(type.factors);
+
+  return 0;
+}

old/process.c

@@ -0,0 +1,189 @@
+#include <stdio.h>
+#include <string.h>
+#include <sys/stat.h>
+
+#include "thickenings.h"
+#include "weyl.h"
+#include "queue.h"
+
+int main(int argc, const char *argv[])
+{
+  FILE *infile;
+  semisimple_type_t type;
+  unsigned long left_invariance, right_invariance; // these are the invariances we have already modded out
+  unsigned long left_invariant, right_invariant; // these are the invariances of the thickening under consideration
+  int rank, cosets;
+  node_t *graph;
+  signed char *thickening;
+  int *seen, *generators;
+  queue_t queue;
+  int ngenerators;
+  int current;
+
+  char string_buffer1[1000];
+  const char *alphabet = "abcdefghijklmnopqrstuvwxyz";
+
+  if(argc < 2)
+    infile = stdin;
+  else
+    infile = fopen(argv[1], "rb");
+
+  // we completely trust the input data
+  ERROR(fread(&type.n, sizeof(int), 1, infile) == 0, "The input file seems to be empty!\n");
+  type.factors = malloc(type.n * sizeof(simple_type_t));
+  fread(type.factors, sizeof(simple_type_t), type.n, infile);
+  fread(&left_invariance, sizeof(simple_type_t), type.n, infile);
+  fread(&right_invariance, sizeof(simple_type_t), type.n, infile);
+
+  rank = weyl_rank(type);
+  graph = graph_alloc(type);
+  cosets = prepare_simplified_graph(type, left_invariance, right_invariance, graph);
+
+  thickening = (signed char*)malloc(cosets*sizeof(signed char));
+  generators = (int*)malloc(cosets*sizeof(int));
+  seen = (int*)malloc(cosets*sizeof(int));
+
+  while(fread(thickening, sizeof(signed char), cosets, infile) == cosets) {
+
+    // determine invariances of this thickening
+    left_invariant = right_invariant = -1; // set all bits to 1
+    for(int j = 0; j < cosets; j++) {
+      for(int k = 0; k < rank; k++) {
+	if(thickening[j] > 0 && thickening[graph[j].left[k]] < 0 ||
+	   thickening[j] < 0 && thickening[graph[j].left[k]] > 0)
+	  left_invariant &= ~(1 << k);
+	if(thickening[j] > 0 && thickening[graph[j].right[k]] < 0 ||
+	   thickening[j] < 0 && thickening[graph[j].right[k]] > 0)
+	  right_invariant &= ~(1 << k);
+      }
+    }
+
+    // print this stuff
+    printf("left: ");
+    for(int j = 0; j < rank; j++)
+      printf("%c", left_invariant & (1 << j) ? alphabet[j] : ' ');
+    printf(" right: ");
+    for(int j = 0; j < rank; j++)
+      printf("%c", right_invariant & (1 << j) ? alphabet[j] : ' ');
+    printf(" generators: ");
+
+    // find a minimal set of weyl group elements such that the union of the ideals generated by their cosets wrt the invariances determined above gives the thickening
+    // in the first step, mark everything which is equivalent to a "head" by a generator id
+    ngenerators = 0;
+    memset(generators, 0, cosets*sizeof(int));
+    for(int j = 0; j < cosets; j++) {
+      if(thickening[j] == HEAD_MARKER && generators[j] == 0) { // ignore the generator, if it is equivalent to one already seen
+	ngenerators++;
+	queue_init(&queue);
+	queue_put(&queue, j);
+	while((current = queue_get(&queue)) != -1) {
+	  if(generators[current] == 0) { // visit everyone only once
+	    generators[current] = ngenerators;
+	    for(int k = 0; k < rank; k++) {
+	      if(left_invariant & (1 << k))
+		queue_put(&queue, graph[current].left[k]);
+	      if(right_invariant & (1 << k))
+		queue_put(&queue, graph[current].right[k]);
+	    }
+	  }
+	}
+      }
+    }
+
+    // in the second step, go through the list in ascending word length order and print the first appearance of each generator id
+    memset(seen, 0, cosets*sizeof(int));
+    for(int i = 0; i < cosets; i++) {
+      if(generators[i] != 0 && seen[generators[i]-1] == 0) {
+	seen[generators[i]-1] = 1;
+	printf("%s ", alphabetize(graph[i].word, graph[i].wordlength, alphabet, string_buffer1));
+      }
+    }
+
+    printf("\n");
+  }
+
+  if(infile != stdin)
+    fclose(infile);
+
+  graph_free(type, graph);
+  free(type.factors);
+  free(thickening);
+}
+  /*******************************************************************************************
+
+  seen = (int*)malloc(order*sizeof(int));
+  generators = (int*)malloc(order*sizeof(int));
+  level = (signed char*)malloc(order*sizeof(int));
+
+  graph = graph_alloc(type);
+  prepare_graph(type, graph);
+
+  // finally do stuff
+
+  int counter = 0;
+
+  while(fread(level, sizeof(signed char), order, infile) == order) {
+
+    if((~left_invariant & left_invariant_wanted) == 0 && (~right_invariant & right_invariant_wanted) == 0) {
+      ngens = 0;
+      memset(generators, 0, order*sizeof(int));
+      for(int j = 0; j < order; j++) {
+	if(level[j] == HEAD_MARKER && generators[j] == 0) { // ignore the generator, if it is equivalent to one already seen
+	  ngens++;
+	  queue_init(&queue);
+	  queue_put(&queue, j);
+	  while((current = queue_get(&queue)) != -1) {
+	    if(generators[current] == 0) { // visit everyone only once
+	      generators[current] = ngens;
+	      for(int k = 0; k < rank; k++) {
+		if(left_invariant & (1 << k))
+		queue_put(&queue, graph[current].left[k]);
+		if(right_invariant & (1 << k))
+		  queue_put(&queue, graph[current].right[k]);
+	      }
+	    }
+	  }
+	}
+      }
+
+      printf("left: ");
+      for(int j = 0; j < rank; j++)
+	printf("%c", left_invariant & (1 << j) ? alphabet[j] : ' ');
+      printf(" right: ");
+      for(int j = 0; j < rank; j++)
+	printf("%c", right_invariant & (1 << j) ? alphabet[j] : ' ');
+      printf(" generators: ");
+
+      memset(seen, 0, order*sizeof(int));
+      for(int i = 0; i < order; i++) {
+	if(generators[i] != 0 && seen[generators[i]-1] == 0) {
+	  seen[generators[i]-1] = 1;
+	  //	if(type.n == 1 && type.factors[0].series == 'A')
+	  //	  printf("%s ", stringify_SLn1_permutation(graph[i].word, graph[i].wordlength, rank, string_buffer1));
+	  //	else if(type.n == 1 && (type.factors[0].series == 'B' || type.factors[0].series == 'C'))
+	  //	  printf("%s ", stringify_Onn1_permutation(graph[i].word, graph[i].wordlength, rank, string_buffer1));
+	  //	else
+	  if(i == 0)
+	    printf("1 ");
+	  else
+	    printf("%s ", alphabetize(graph[i].word, graph[i].wordlength, alphabet, string_buffer1));
+	}
+      }
+
+      printf("\n");
+    }
+  }
+
+  if(infile != stdin)
+    fclose(infile);
+
+  // cleanup
+
+  graph_free(type, graph);
+  free(seen);
+  free(generators);
+  free(type.factors);
+
+  return 0;
+}
+*/

old/test.c

@@ -0,0 +1,41 @@
+#include <stdio.h>
+
+#include "weyl.h"
+
+static void print_element(weylgroup_element_t *e)
+{
+  if(e->wordlength == 0)
+    printf("1");
+  else
+    for(int j = 0; j < e->wordlength; j++)
+      printf("%c", e->word[j] + 'a');
+}
+
+int main()
+{
+  semisimple_type_t type;
+  simple_type_t t;
+  type.n = 1;
+  type.factors = &t;
+  t.series = 'A';
+  t.rank = 3;
+
+  int order = weyl_order(type);
+  doublequotient_t *dq = weyl_generate_bruhat(type, 0x02, 0x03);
+
+  for(int i = 0; i < dq->count; i++) {
+    print_element(dq->cosets[i].min);
+    printf(" -> ");
+    for(doublecoset_list_t *current = dq->cosets[i].bruhat_lower; current; current = current->next) {
+      print_element(current->to->min);
+      printf(" ");
+    }
+    printf("| ");
+    print_element(dq->cosets[i].opposite->min);
+    printf("\n");
+  }
+
+  weyl_destroy_bruhat(dq);
+
+  return 0;
+}