#14455 ⟨
a
,
b
|
aaab
=
a
,
babbb
=
a
⟩
Up:
Monoids with two generators and two relations
Prev:
#14439
⟨
a
,
b
|
aaab
=
a
,
abbbb
=
a
⟩
Next:
#14463
⟨
a
,
b
|
aaab
=
a
,
bbabb
=
a
⟩
Quick links
Properties
Staircase diagram
Rewriting system
Properties
Presentation has sum-of-sides 11
Infinite non-cancellative commutative monoid
Not cancellative, because multiplication by
ab
is not injective:
ab
⋅
b
3
=
a
and
ab
⋅
a
2
=
a
, however
b
3
≠
a
2
Commutative Gröbner basis: ⟨
a
,
b
|
a
b
4
=
a
,
a
3
=
a
b
3
⟩
Cancellative quotient is isomorphic to ℤ
8
Enveloping group is isomorphic to ℤ
8
Group of units is isomorphic to ℤ
1
3 Archimedian components:
1,
a
,
b
Staircase diagram
Rewriting system
Format:
Pretty
Plain
Word to reduce:
Tips:
Lowercase letters stand for generators.
Spaces are ignored.
Numbers repeat the previous letter, e.g.
b90
.
Reduction strategy:
Leftmost
Rightmost
Path to normal form:
1
1
Reduction order:
Left-to-right recursive path with deg(
a
) = 0; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
9
⇒
a
[14]
2.
ba
⇒
a
7
[16]
3.
ab
⇒
a
7
[13]
# ab:aaab=a,babbb=a a/b aaaaaaaaa=a ba=aaaaaaa ab=aaaaaaa
