14namespace layer3_group_actions {
15namespace induced_actions {
41 int type_len,
int verbose_level)
43 int f_v = (verbose_level >= 1);
46 cout <<
"action_on_flags::init" << endl;
52 cout <<
"action_on_flags::init the action must be "
53 "linear but is not" << endl;
66 cout <<
"action_on_flags::init n=" <<
n <<
" q=" <<
F->
q << endl;
74 cout <<
"action_on_flags::init degree = " <<
degree << endl;
80 cout <<
"action_on_flags::init done" << endl;
86 int f_v = (verbose_level >= 1);
90 cout <<
"action_on_flags::compute_image "
93 if (i < 0 || i >=
degree) {
94 cout <<
"action_on_flags::compute_image "
95 "i = " << i <<
" out of range" << endl;
99 cout <<
"Elt=" << endl;
104 cout <<
"action_on_flags::compute_image M1=" << endl;
108 cout <<
"action_on_flags::compute_image "
109 "before image_of_low_level" << endl;
111 for (h = 0; h <
Flag->
K; h++) {
113 M1 + h *
n,
M2 + h *
n, verbose_level - 1);
116 cout <<
"action_on_flags::compute_image "
117 "after image_of_low_level" << endl;
120 cout <<
"action_on_flags::compute_image M2=" << endl;
126 cout <<
"action_on_flags::compute_image "
127 << i <<
" maps to " << j << endl;
a maximal chain of subspaces
void unrank(long int rk, int *subspace, int verbose_level)
void init(int n, int *type, int type_len, field_theory::finite_field *F, int verbose_level)
long int rank(int *subspace, int verbose_level)
a permutation group in a fixed action.
void element_print_quick(void *elt, std::ostream &ost)
symmetry_group_type type_G
void image_of_low_level(void *elt, int *input, int *output, int verbose_level)
field_theory::finite_field * GFq
long int compute_image(int *Elt, long int i, int verbose_level)
void init(actions::action *A, int *type, int type_len, int verbose_level)
field_theory::finite_field * F
#define Int_matrix_print(A, B, C)
the orbiter library for the classification of combinatorial objects
groups::matrix_group * matrix_grp