Article contents
Polyhedral convex cones and the equational theory of the bicyclic semigroup
Published online by Cambridge University Press: 09 April 2009
Abstract
To any given balanced semigroup identity U ≈ W a number of polyhedral convex cones are associated. In this setting an algorithm is proposed which determines whether the given identity is satisfied in the bicylic semigroup or in the semigroup . The semigroups BC and E deserve our attention because a semigroup variety contains a simple semigroup which is not completely simple (respectively, which is idempotent free) if and only if this variety contains BC (respectively, E). Therefore, for a given identity U ≈ W it is decidable whether or not the variety determined by U ≈ W contains a simple semigroup which is not completely simple (respectively, which is idempotent free).
MSC classification
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 2006
References
- 9
- Cited by