#2237 ⟨
a
,
b
,
c
|
abab
=1,
abcb
=1⟩
Up:
Monoid enumeration
Prev:
#2234
⟨
a
,
b
,
c
|
abab
=1,
abac
=1⟩
Next:
#2238
⟨
a
,
b
,
c
|
abab
=1,
acac
=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
a
is not injective:
a
⋅ (
ba
)
2
=
a
and
a
⋅ 1 =
a
, however (
ba
)
2
≠ 1
Not right cancellative, because right multiplication by
b
is not injective:
c
⋅
b
=
ab
and
a
⋅
b
=
ab
, however
c
≠
a
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.
cb
⇒
ab
[3]
2.
(
ab
)
2
⇒ 1
[1]
# abc:abab=1,abcb=1 abc - - cb=ab abab=1