Skip to main content
I had repeated the same tablet twice and messed up with items 10 and 11
Source Link
Salvo Tringali
  • 10.5k
  • 2
  • 29
  • 64
  1. $S$ is the non-unitalunital semilattice (with identity/bottom element $x$) defined by the following table (a semilattice is a commutative semigroup in which every element is idempotent):
  1. $S$ is the unitalnon-unital semilattice (with identity/bottom element $x$) defined by the following table:
x y z
x x yz z
y yz y z
z z z z
  1. $S$ is the non-unital semilattice defined by the following table (a semilattice is a commutative semigroup in which every element is idempotent):
  1. $S$ is the unital semilattice (with identity/bottom element $x$) defined by the following table:
x y z
x x y z
y y y z
z z z z
  1. $S$ is the unital semilattice (with identity/bottom element $x$) defined by the following table (a semilattice is a commutative semigroup in which every element is idempotent):
  1. $S$ is the non-unital semilattice defined by the following table:
x y z
x x z z
y z y z
z z z z
further mistakes fixed
Source Link
Salvo Tringali
  • 10.5k
  • 2
  • 29
  • 64

As a complement to my previous non-answer, let me show that the OP's conjecture holds for any order-$3$ commutative semigroup $S$ that is not a group (equivalently, that is not a cyclic group of order $3$).

Up to the canonical anti-isomorphism between $S$a semigroup and its opposite semigroup, there are $17$ such semigroups of order $3$ (excluding the cyclic group of order $3$), of which only $11$ are commutative; see the Wikipedia article on order-$3$ semigroups here. Below, I'll list these $11$ commutative semigroups one by one and prove that they all satisfy the OP's conjecture. It may be a tedious task, but is going to help with another reduction.

All semigroups will be defined on the set $\{x, y, z\}$ through their Cayley tables. Since $\lfloor (3-1)/2 \rfloor = 1$, we only need to find, for each semigroup on the list, a permutation $(a,b,c)$ of the triple $(x,y,z)$ such that $ac = bc$.

  1. $S$ is the non-unital semilattice defined by the following table (a semilatticesemilattice is a commutative semigroup in which every element is idempotent):
  1. $S$ is the unital semilattice (with identity/bottom element $x$) defined by the following table (a semilattice is a commutative semigroup in which every element is idempotent):

As a complement to my previous non-answer, let me show that the OP's conjecture holds for any order-$3$ semigroup $S$ that is not a group (equivalently, that is not a cyclic group of order $3$).

Up to the canonical anti-isomorphism between $S$ and its opposite semigroup, there are $17$ such semigroups (excluding the cyclic group of order $3$), of which only $11$ are commutative; see the Wikipedia article on order-$3$ semigroups here. Below, I'll list these $11$ commutative semigroups one by one and prove that they all satisfy the OP's conjecture. It may be a tedious task, but is going to help with another reduction.

All semigroups will be defined on the set $\{x, y, z\}$ through their Cayley tables. Since $\lfloor (3-1)/2 \rfloor = 1$, we only need to find, for each semigroup on the list, a permutation $(a,b,c)$ of the triple $(x,y,z)$ such that $ac = bc$.

  1. $S$ is the non-unital semilattice defined by the following table (a semilattice is a commutative semigroup in which every element is idempotent):
  1. $S$ is the unital semilattice (with identity/bottom element $x$) defined by the following table (a semilattice is a commutative semigroup in which every element is idempotent):

As a complement to my previous non-answer, let me show that the OP's conjecture holds for any order-$3$ commutative semigroup $S$ that is not a group (equivalently, that is not a cyclic group of order $3$).

Up to the canonical anti-isomorphism between a semigroup and its opposite, there are $17$ semigroups of order $3$ (excluding the cyclic group of order $3$), of which only $11$ are commutative; see the Wikipedia article on order-$3$ semigroups here. Below, I'll list these $11$ commutative semigroups one by one and prove that they all satisfy the OP's conjecture. It may be a tedious task, but is going to help with another reduction.

All semigroups will be defined on the set $\{x, y, z\}$ through their Cayley tables. Since $\lfloor (3-1)/2 \rfloor = 1$, we need to find, for each semigroup on the list, a permutation $(a,b,c)$ of the triple $(x,y,z)$ such that $ac = bc$.

  1. $S$ is the non-unital semilattice defined by the following table (a semilattice is a commutative semigroup in which every element is idempotent):
  1. $S$ is the unital semilattice (with identity/bottom element $x$) defined by the following table:
fixed a couple of typos
Source Link
Salvo Tringali
  • 10.5k
  • 2
  • 29
  • 64

As a complement to my previous non-answer, let me show that the OP's conjecture holds for any order-$3$ semigroup $S$ that is not a group (equivalently, that is not a cyclic group of order $3$).

Up to the canonical anti-isomorphism between $S$ and its opposite semigroup, there are $17$ such semigroups (excluding the cyclic group of order $3$), of which only $11$ are commutative; see the Wikipedia article on order-$3$ semigroups here. Below, I'll list these $11$ commutative semigorupssemigroups one by one and prove that they all satisfy the OP's conjecture. It may be a tediousvtedious task, but is going to help with another reduction.

All semigroups will be defined on the set $\{x, y, z\}$ through their Cayley tables. Since $\lfloor (3-1)/2 \rfloor = 1$, we only need to find, for each semigroup on the list, a permutation $(a,b,c)$ of the ordered triple $(x,y,z)$ such that $ac = bc$.

 

As a complement to my previous non-answer, let me show that the OP's conjecture holds for any order-$3$ semigroup $S$ that is not a group.

Up to the canonical anti-isomorphism between $S$ and its opposite semigroup, there are $17$ such semigroups (excluding the cyclic group of order $3$), of which only $11$ are commutative; see the Wikipedia article on order-$3$ semigroups here. Below, I'll list these $11$ commutative semigorups one by one and prove that they all satisfy the OP's conjecture. It may be a tediousv task, but is going to help with another reduction.

All semigroups will be defined on the set $\{x, y, z\}$ through their Cayley tables. Since $\lfloor (3-1)/2 \rfloor = 1$, we need to find, for each semigroup on the list, a permutation $(a,b,c)$ of the ordered triple $(x,y,z)$ such that $ac = bc$.

As a complement to my previous non-answer, let me show that the OP's conjecture holds for any order-$3$ semigroup $S$ that is not a group (equivalently, that is not a cyclic group of order $3$).

Up to the canonical anti-isomorphism between $S$ and its opposite semigroup, there are $17$ such semigroups (excluding the cyclic group of order $3$), of which only $11$ are commutative; see the Wikipedia article on order-$3$ semigroups here. Below, I'll list these $11$ commutative semigroups one by one and prove that they all satisfy the OP's conjecture. It may be a tedious task, but is going to help with another reduction.

All semigroups will be defined on the set $\{x, y, z\}$ through their Cayley tables. Since $\lfloor (3-1)/2 \rfloor = 1$, we only need to find, for each semigroup on the list, a permutation $(a,b,c)$ of the triple $(x,y,z)$ such that $ac = bc$.

 
Source Link
Salvo Tringali
  • 10.5k
  • 2
  • 29
  • 64
Loading