#1955 ⟨
a
,
b
,
c
|
abc
=
ac
,
bab
=1⟩
Up:
Monoid enumeration
Prev:
#1954
⟨
a
,
b
,
c
|
abc
=
ac
,
baa
=1⟩
Next:
#1956
⟨
a
,
b
,
c
|
abc
=
ac
,
bba
=1⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 8
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not right cancellative, because right multiplication by
c
is not injective:
a
⋅
c
=
c
and 1 ⋅
c
=
c
, however
a
≠ 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
a
<
b
<
c
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
ac
⇒
c
[5]
2.
ba
⇒
ab
[3]
3.
bc
⇒
c
[6]
4.
a
b
2
⇒ 1
[4]
# abc:abc=ac,bab=1 abc - - ac=c ba=ab bc=c abb=1