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

added index attribute, fixed F4 Cartan matrix

Browse Source
This commit is contained in:
Florian Stecker
2017-01-31 21:08:36 +01:00
parent e3606dbc8f 0078da79a7
commit cc3e5952b1
4 changed files with 407 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
weyl.h
View File

@@ -38,8 +38,9 @@ struct _weylgroup_element {
weylgroup_element_t **left;
weylgroup_element_t **right;
weylgroup_element_t *opposite;
int is_root_reflection; // boolean value
weylid_t id;
int is_root_reflection; // boolean value
weylid_t id; // a unique id
int index;
// only set if quotient is generated
doublecoset_t *coset;
@@ -58,6 +59,7 @@ struct _doublecoset {
doublecoset_t *opposite;
weylgroup_element_t *max;
weylgroup_element_t *min;
int index;
};
struct _doublecoset_list {
@@ -69,7 +71,7 @@ struct _doublequotient {
semisimple_type_t type;
int left_invariance; // bitmask with rank bits
int right_invariance;
int count; // number of cosets
int count; // number of double cosets
doublecoset_t *cosets;
weylgroup_element_t *group;
doublecoset_list_t *lists; // only for memory allocation / freeing
@@ -79,15 +81,34 @@ struct _doublequotient {
/***************************** functions **************************************/
/* query some basic information on root systems / Weyl groups */
// the rank
int weyl_rank(semisimple_type_t type);
// the order of the weyl group
int weyl_order(semisimple_type_t type);
// the number of reduced positive roots
int weyl_positive(semisimple_type_t type);
// the Cartan matrix (has rank columns and rank rows)
void weyl_cartan_matrix(semisimple_type_t type, int *m);
// the opposition involution as a map from simple roots to simple roots (indexed from 0 to rank-1)
int weyl_opposition(semisimple_type_t type, int simple_root);
/* generate the Weyl group:
weyl_destroy() has to be used to free memory
*/
weylgroup_t *weyl_generate(semisimple_type_t type);
void weyl_destroy(weylgroup_t *group);
/* generate a double quotient of the Weyl group and its Bruhat order:
left_invariance and right_invariance are bitmaps specifying a subset of the simple roots
The Weyl group will be quotiented from the left and right by the subgroups generated by these simple root reflections
weyl_destroy_bruhat() has to be used to free memory
*/
doublequotient_t *weyl_generate_bruhat(semisimple_type_t type, int left_invariance, int right_invariance);
void weyl_destroy_bruhat(doublequotient_t *dq);