#21731 ⟨a, b | aaa=1, ababbbb=b⟩

Properties

Presentation has sum-of-sides 11
Finite non-commutative monoid with 111 elements

Elements

Elements in the center commute with all other elements.
An idempotent element x satisfies x² = x.
The order of x is the least n (if it exists) such that xⁿ = 1.
The index and period of x is the least m (index) and n (period) such that x^(m+n) = x^m.

1 element center:
- 1
3 non-trivial idempotents:
- bab³a, b¹², ab¹²a²
Order of generators:
- a: order 3
- b: index 1, period 12

Histogram:

order 3	2 elements	a, a²
index 1, period 1	3 elements	bab³a, b¹², ab¹²a²
index 1, period 2	3 elements	b⁶, ab⁶a², bab⁹a
index 1, period 3	24 elements	b⁴, ab⁴, bab³, b⁴a, ab⁴a, ...
index 1, period 4	18 elements	aba, ba², b³, ab³a², ab⁵, ...
index 1, period 6	24 elements	b², ab², bab, b²a, ab²a, ...
index 1, period 12	36 elements	b, ab, ba, aba², ab³, ...

Complete 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(b) = 0; deg(a) = 1

b¹³ ⇒ b
b²ab ⇒ ab³
a²b ⇒ bab⁴
(ab)² ⇒ b¹⁰
a³ ⇒ 1

# ab:aaa=1,ababbbb=b b/a
bbbbbbbbbbbbb=b
bbab=abbb
aab=babbbb
abab=bbbbbbbbbb
aaa=1

Right Cayley graph

Left Cayley graph

Other isomorphic instances

The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.

1 total

Σ	#	Presentation	Mapping
11	21745	⟨a, b \| aaa=1, abbbabb=b⟩	φ(a) = a, φ(b) = b

Up:	Monoids with two generators and two relations
Prev:	#21729 ⟨a, b \| aaa=1, ababbba=b⟩
Next:	#21739 ⟨a, b \| aaa=1, abbabba=b⟩