#1663 ⟨
a
,
b
,
c
|
aab
=
ba
,
bbc
=1⟩
Up:
Monoid enumeration
Prev:
#1662
⟨
a
,
b
,
c
|
aab
=
ba
,
bac
=1⟩
Next:
#1664
⟨
a
,
b
,
c
|
aab
=
ba
,
bca
=1⟩
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
b
is not injective:
b
⋅
bcb
=
b
and
b
⋅ 1 =
b
, however
bcb
≠ 1
Not right cancellative, because right multiplication by
bc
is not injective:
bcb
⋅
bc
=
bc
and 1 ⋅
bc
=
bc
, however
bcb
≠ 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:
Right-to-left recursive path with deg(
a
) = deg(
c
) = 0,
a
<
c
; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
ba
⇒
a
2
b
[1]
2.
b
2
c
⇒ 1
[2]
# abc:aab=ba,bbc=1 reversed:ac/b - - ba=aab bbc=1