Skip to main content
MathOverflow

Return to Answer

fixed broken link to springerlink.com; added full citation in tooltip
Source Link
edit approved Jun 7, 2022 at 17:10
The Amplitwist
edit approved Jun 7, 2022 at 17:10
The Amplitwist
  • 1.4k
  • 3
  • 11
  • 22

For monoids (which are associative) the Krohn-RhodesKrohn–Rhodes theorem gives a powerful decomposition result: every finite monoid is a quotient of a submonoid of an alternating wreath product of finite groups and monoids. Google suggests that Joel Wanderwerf may have generalized this theorem to arbitrary algebras in a 1996 article for the Semigroup Forum journala 1996 article for the Semigroup Forum journal, but I don't have access to this Springer journal so I can't say for sure.

For monoids (which are associative) the Krohn-Rhodes theorem gives a powerful decomposition result: every finite monoid is a quotient of a submonoid of an alternating wreath product of finite groups and monoids. Google suggests that Joel Wanderwerf may have generalized this theorem to arbitrary algebras in a 1996 article for the Semigroup Forum journal, but I don't have access to this Springer journal so I can't say for sure.

For monoids (which are associative) the Krohn–Rhodes theorem gives a powerful decomposition result: every finite monoid is a quotient of a submonoid of an alternating wreath product of finite groups and monoids. Google suggests that Joel Wanderwerf may have generalized this theorem to arbitrary algebras in a 1996 article for the Semigroup Forum journal, but I don't have access to this Springer journal so I can't say for sure.

Source Link
Neel Krishnaswami
Neel Krishnaswami
  • 9.2k
  • 1
  • 30
  • 54

For monoids (which are associative) the Krohn-Rhodes theorem gives a powerful decomposition result: every finite monoid is a quotient of a submonoid of an alternating wreath product of finite groups and monoids. Google suggests that Joel Wanderwerf may have generalized this theorem to arbitrary algebras in a 1996 article for the Semigroup Forum journal, but I don't have access to this Springer journal so I can't say for sure.