Mescal
Loading...
Searching...
No Matches
monoid_ideals.h
Go to the documentation of this file.
1
6
7#ifndef IDEALS_H
8#define IDEALS_H
9
10 /* __ __ _ _ ___ _ _ */
11 /* | \/ | ___ _ __ ___ (_) __| |___ _ |_ _|__| | ___ __ _| |___ */
12 /* | |\/| |/ _ \| '_ \ / _ \| |/ _` / __(_) | |/ _` |/ _ \/ _` | / __| */
13 /* | | | | (_) | | | | (_) | | (_| \__ \_ | | (_| | __/ (_| | \__ \ */
14 /* |_| |_|\___/|_| |_|\___/|_|\__,_|___(_) |___\__,_|\___|\__,_|_|___/ */
15
16#include <stdbool.h>
17#include "monoid.h"
18
19
20
34dequeue* compute_r_ideal(morphism*,
35 uint,
36 bool*
37);
38
52dequeue* compute_l_ideal(morphism*,
53 uint,
54 bool*
55);
56
70dequeue* compute_j_ideal(morphism*,
71 uint,
72 bool*
73);
74
75
91dequeue* compute_r_ideal_alph(morphism*,
92 uint,
93 bool*,
94 bool*
95);
96
112dequeue* compute_l_ideal_alph(morphism*,
113 uint,
114 bool*,
115 bool*
116);
117
118
134dequeue* compute_j_ideal_alph(morphism*,
135 uint,
136 bool*,
137 bool*
138);
139
140
149uint get_rlink(morphism*,
150 parti*,
151 uint,
152 uint,
153 bool* alpha
154);
155
164uint get_llink(morphism*,
165 parti*,
166 uint,
167 uint,
168 bool* alpha
169);
170
171
172
173#endif
monoid.h
Implementation of morphisms into finite monoids.
compute_l_ideal
dequeue * compute_l_ideal(morphism *, uint, bool *)
Computation of the left ideal of an element.
Definition monoid_ideals.c:22
get_rlink
uint get_rlink(morphism *, parti *, uint, uint, bool *alpha)
Given an idempotent g and an element q such that g R q, compute an element s such that g = qr.
Definition monoid_ideals.c:65
compute_r_ideal_alph
dequeue * compute_r_ideal_alph(morphism *, uint, bool *, bool *)
Computation of a given restricted right ideal of an element. The restriction is given by a sub-alphab...
Definition monoid_ideals.c:38
compute_r_ideal
dequeue * compute_r_ideal(morphism *, uint, bool *)
Computation of the right ideal of an element.
Definition monoid_ideals.c:13
get_llink
uint get_llink(morphism *, parti *, uint, uint, bool *alpha)
Given an idempotent h and an element t such that h R t, compute an element s such that h = st.
Definition monoid_ideals.c:103
compute_l_ideal_alph
dequeue * compute_l_ideal_alph(morphism *, uint, bool *, bool *)
Computation of a given restricted left ideal of an element. The restriction is given by a sub-alphabe...
Definition monoid_ideals.c:47
compute_j_ideal
dequeue * compute_j_ideal(morphism *, uint, bool *)
Computation of the two-sided ideal of an element.
Definition monoid_ideals.c:30
compute_j_ideal_alph
dequeue * compute_j_ideal_alph(morphism *, uint, bool *, bool *)
Computation of a given restricted left/right ideal of an element. The restriction is given by a sub-a...
Definition monoid_ideals.c:55
dequeue
Type used to represent a dequeue of unsigned integers.
Definition type_dequeue.h:26
morphism
The type used to represent a morphism into a finite monoid.
Definition monoid.h:91
parti
First type used to represent a partition. This is not the one used by Union-Find.
Definition type_partitions.h:36