#4266 ⟨
a
,
b
,
c
|
aab
=1,
bcac
=
c
⟩
Up:
Monoid enumeration
Prev:
#4263
⟨
a
,
b
,
c
|
aab
=1,
bcab
=
c
⟩
Next:
#4269
⟨
a
,
b
,
c
|
aab
=1,
bcba
=
c
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 8
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
aba
=
a
and
a
⋅ 1 =
a
, however
aba
≠ 1
Not right cancellative, because right multiplication by
c
is not injective:
bca
⋅
c
=
c
and 1 ⋅
c
=
c
, however
bca
≠ 1
Rewriting system
Format:
Pretty
Plain
Word:
Enter a word above to compute its normal form. Tips:
Lowercase letters stand for generators.
Spaces are ignored.
Numbers repeat the previous letter, e.g.
b90
.
Strategy:
Leftmost
Rightmost
Result:
1
1
Reduction order:
Left-to-right shortlex with
c
<
a
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
2
c
⇒
cac
[3]
2.
a
2
b
⇒ 1
[1]
3.
bcac
⇒
c
[2]
# abc:aab=1,bcac=c cab - - aac=cac aab=1 bcac=c