Recognise this Cayley table? Almost embedded +_2 [closed]
up vote
0
down vote
favorite
Finding monoids represented by very simple string rewrite systems. Come to a monoid of the following form.
({0,1,2} , * )
Where * is the binary operation with the following Cayley table:
* 0 1 2
0 0 1 2
1 1 2 1
2 2 1 2
Does anyone recognise this Cayley table?
If it helps, I'd expect the next monoid in my generation, M = ({0,1,2,3}, *)
Where * is the bi.op with the Cayley table:
* 0 1 2 3
0 0 1 2 3
1 1 2 3 1
2 2 3 1 2
3 3 1 2 3
In general * for a Monoid, M=( A , *) where |A| = n
* 0 1 2 .. n-1
0 0 1 2 .. n-1
1 1 2 3 .. 1
2 2 3 4 .. 2
. . . . .
n-1 n-1 1 2 .. n-1
group-theory word-problem monoid
edited Nov 21 at 13:11
Nicky Hekster
28k53254
asked Nov 21 at 11:29
O.Gage
12
closed as unclear what you're asking by MJD, Derek Holt, Paul Plummer, amWhy, user10354138 Nov 29 at 19:57
Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.
add a comment |
up vote
0
down vote
favorite
Finding monoids represented by very simple string rewrite systems. Come to a monoid of the following form.
({0,1,2} , * )
Where * is the binary operation with the following Cayley table:
* 0 1 2
0 0 1 2
1 1 2 1
2 2 1 2
Does anyone recognise this Cayley table?
If it helps, I'd expect the next monoid in my generation, M = ({0,1,2,3}, *)
Where * is the bi.op with the Cayley table:
* 0 1 2 3
0 0 1 2 3
1 1 2 3 1
2 2 3 1 2
3 3 1 2 3
In general * for a Monoid, M=( A , *) where |A| = n
* 0 1 2 .. n-1
0 0 1 2 .. n-1
1 1 2 3 .. 1
2 2 3 4 .. 2
. . . . .
n-1 n-1 1 2 .. n-1
group-theory word-problem monoid
edited Nov 21 at 13:11
Nicky Hekster
28k53254
asked Nov 21 at 11:29
O.Gage
12
closed as unclear what you're asking by MJD, Derek Holt, Paul Plummer, amWhy, user10354138 Nov 29 at 19:57
Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.
2
The only question I can find in your post is "Does anyone recognise this kayley table?". Is that really what you wanted to find out?
– MJD
Nov 21 at 12:15
1
The nonzero elements form a submonoid isomorphic to the cyclic group of order $n$. So the monoid here is the cyclic group of order $n$ with a new identity element $0$ adjoined.
– Derek Holt
Nov 21 at 16:20
To clarify. I'm currently researching monoids which admit a presentation by a complete string rewriting system as to provide a solution to the word problem. Have produced the table from the s.r.s < a | { (aaaa, a) } >. In working through classes of string rewrite systems I've managed to find some nice paterns in the multiplication tables (probably a more correct term than Kayley table as we are outside group theory). Nice tables like modular addition have cropped up. Was wondering if this was a nice table with a name that anyone recognised.
– O.Gage
Nov 24 at 20:52
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Finding monoids represented by very simple string rewrite systems. Come to a monoid of the following form.
({0,1,2} , * )
Where * is the binary operation with the following Cayley table:
* 0 1 2
0 0 1 2
1 1 2 1
2 2 1 2
Does anyone recognise this Cayley table?
If it helps, I'd expect the next monoid in my generation, M = ({0,1,2,3}, *)
Where * is the bi.op with the Cayley table:
* 0 1 2 3
0 0 1 2 3
1 1 2 3 1
2 2 3 1 2
3 3 1 2 3
In general * for a Monoid, M=( A , *) where |A| = n
* 0 1 2 .. n-1
0 0 1 2 .. n-1
1 1 2 3 .. 1
2 2 3 4 .. 2
. . . . .
n-1 n-1 1 2 .. n-1
group-theory word-problem monoid
edited Nov 21 at 13:11
Nicky Hekster
28k53254
asked Nov 21 at 11:29
O.Gage
12
Finding monoids represented by very simple string rewrite systems. Come to a monoid of the following form.
({0,1,2} , * )
Where * is the binary operation with the following Cayley table:
* 0 1 2
0 0 1 2
1 1 2 1
2 2 1 2
Does anyone recognise this Cayley table?
If it helps, I'd expect the next monoid in my generation, M = ({0,1,2,3}, *)
Where * is the bi.op with the Cayley table:
* 0 1 2 3
0 0 1 2 3
1 1 2 3 1
2 2 3 1 2
3 3 1 2 3
In general * for a Monoid, M=( A , *) where |A| = n
* 0 1 2 .. n-1
0 0 1 2 .. n-1
1 1 2 3 .. 1
2 2 3 4 .. 2
. . . . .
n-1 n-1 1 2 .. n-1
group-theory word-problem monoid
group-theory word-problem monoid
edited Nov 21 at 13:11
Nicky Hekster
28k53254
asked Nov 21 at 11:29
O.Gage
12
edited Nov 21 at 13:11
Nicky Hekster
28k53254
asked Nov 21 at 11:29
O.Gage
12
edited Nov 21 at 13:11
Nicky Hekster
28k53254
edited Nov 21 at 13:11
Nicky Hekster
28k53254
edited Nov 21 at 13:11
Nicky Hekster
28k53254
28k53254
asked Nov 21 at 11:29
O.Gage
12
asked Nov 21 at 11:29
O.Gage
12
asked Nov 21 at 11:29
O.Gage
12
12
closed as unclear what you're asking by MJD, Derek Holt, Paul Plummer, amWhy, user10354138 Nov 29 at 19:57
Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.
closed as unclear what you're asking by MJD, Derek Holt, Paul Plummer, amWhy, user10354138 Nov 29 at 19:57
Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.
2
The only question I can find in your post is "Does anyone recognise this kayley table?". Is that really what you wanted to find out?
– MJD
Nov 21 at 12:15
1
The nonzero elements form a submonoid isomorphic to the cyclic group of order $n$. So the monoid here is the cyclic group of order $n$ with a new identity element $0$ adjoined.
– Derek Holt
Nov 21 at 16:20
To clarify. I'm currently researching monoids which admit a presentation by a complete string rewriting system as to provide a solution to the word problem. Have produced the table from the s.r.s < a | { (aaaa, a) } >. In working through classes of string rewrite systems I've managed to find some nice paterns in the multiplication tables (probably a more correct term than Kayley table as we are outside group theory). Nice tables like modular addition have cropped up. Was wondering if this was a nice table with a name that anyone recognised.
– O.Gage
Nov 24 at 20:52
add a comment |
2
The only question I can find in your post is "Does anyone recognise this kayley table?". Is that really what you wanted to find out?
– MJD
Nov 21 at 12:15
1
The nonzero elements form a submonoid isomorphic to the cyclic group of order $n$. So the monoid here is the cyclic group of order $n$ with a new identity element $0$ adjoined.
– Derek Holt
Nov 21 at 16:20
To clarify. I'm currently researching monoids which admit a presentation by a complete string rewriting system as to provide a solution to the word problem. Have produced the table from the s.r.s < a | { (aaaa, a) } >. In working through classes of string rewrite systems I've managed to find some nice paterns in the multiplication tables (probably a more correct term than Kayley table as we are outside group theory). Nice tables like modular addition have cropped up. Was wondering if this was a nice table with a name that anyone recognised.
– O.Gage
Nov 24 at 20:52
2
2
The only question I can find in your post is "Does anyone recognise this kayley table?". Is that really what you wanted to find out?
– MJD
Nov 21 at 12:15
The only question I can find in your post is "Does anyone recognise this kayley table?". Is that really what you wanted to find out?
– MJD
Nov 21 at 12:15
1
1
The nonzero elements form a submonoid isomorphic to the cyclic group of order $n$. So the monoid here is the cyclic group of order $n$ with a new identity element $0$ adjoined.
– Derek Holt
Nov 21 at 16:20
The nonzero elements form a submonoid isomorphic to the cyclic group of order $n$. So the monoid here is the cyclic group of order $n$ with a new identity element $0$ adjoined.
– Derek Holt
Nov 21 at 16:20
To clarify. I'm currently researching monoids which admit a presentation by a complete string rewriting system as to provide a solution to the word problem. Have produced the table from the s.r.s < a | { (aaaa, a) } >. In working through classes of string rewrite systems I've managed to find some nice paterns in the multiplication tables (probably a more correct term than Kayley table as we are outside group theory). Nice tables like modular addition have cropped up. Was wondering if this was a nice table with a name that anyone recognised.
– O.Gage
Nov 24 at 20:52
To clarify. I'm currently researching monoids which admit a presentation by a complete string rewriting system as to provide a solution to the word problem. Have produced the table from the s.r.s < a | { (aaaa, a) } >. In working through classes of string rewrite systems I've managed to find some nice paterns in the multiplication tables (probably a more correct term than Kayley table as we are outside group theory). Nice tables like modular addition have cropped up. Was wondering if this was a nice table with a name that anyone recognised.
– O.Gage
Nov 24 at 20:52
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
2
The only question I can find in your post is "Does anyone recognise this kayley table?". Is that really what you wanted to find out?
– MJD
Nov 21 at 12:15
1
The nonzero elements form a submonoid isomorphic to the cyclic group of order $n$. So the monoid here is the cyclic group of order $n$ with a new identity element $0$ adjoined.
– Derek Holt
Nov 21 at 16:20
To clarify. I'm currently researching monoids which admit a presentation by a complete string rewriting system as to provide a solution to the word problem. Have produced the table from the s.r.s < a | { (aaaa, a) } >. In working through classes of string rewrite systems I've managed to find some nice paterns in the multiplication tables (probably a more correct term than Kayley table as we are outside group theory). Nice tables like modular addition have cropped up. Was wondering if this was a nice table with a name that anyone recognised.
– O.Gage
Nov 24 at 20:52