#14455 ⟨
a
,
b
|
aaab
=
a
,
babbb
=
a
⟩
Up:
Monoid enumeration
Prev:
#14439
⟨
a
,
b
|
aaab
=
a
,
abbbb
=
a
⟩
Next:
#14463
⟨
a
,
b
|
aaab
=
a
,
bbabb
=
a
⟩
Contents
Properties
Commutative structure
Staircase diagram
Rewriting system
Properties
Sum of relation sides is 11
Infinite non-cancellative commutative monoid
Element
b
has infinite order
Not cancellative, because multiplication by
a
is not injective:
a
⋅
b
4
=
a
and
a
⋅ 1 =
a
, however
b
4
≠ 1
Commutative structure
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:
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 recursive path with deg(
b
) = 0; deg(
a
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
b
4
⇒
a
[6]
2.
ba
⇒
ab
[7]
3.
a
3
⇒
a
b
3
[5]
# ab:aaab=a,babbb=a b/a - - abbbb=a ba=ab aaa=abbb
