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

New Weyl group algorithm

Browse Source
This commit is contained in:
Florian Stecker
2016-11-20 23:19:08 +01:00
parent 3bd8ff019d
commit c4824abafd
7 changed files with 606 additions and 42 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
thickenings.h
View File

@@ -4,7 +4,7 @@
#define BV_QWORD_RANK 10
#include "bitvec.h"
#include "coxeter.h"
#include "weyl.h"
#define DEBUG(msg, ...) do{fprintf(stderr, msg, ##__VA_ARGS__); }while(0)
@@ -16,7 +16,7 @@ typedef struct _edgelist {
struct _edgelist *next;
} edgelist_t;
// describes an element of the Coxeter group; only "opposite" and "bruhat_lower" are being used for enumerating thickenings; everything else is just needed for initialization or output
// describes an element of the Weyl group; only "opposite" and "bruhat_lower" are being used for enumerating thickenings; everything else is just needed for initialization or output
typedef struct {
int *word;
int wordlength;
@@ -26,6 +26,7 @@ typedef struct {
edgelist_t *bruhat_lower;
edgelist_t *bruhat_higher;
int is_hyperplane_reflection; // boolean value
weylid_t id;
} node_t;
// printing functions