Mathematics – Combinatorics
Scientific paper
2012-01-18
Mathematics
Combinatorics
16 pages, one table Fixed typos and generalized Theorems 5.1 and 5.2
Scientific paper
It is known that if every group satisfying an identity of the form yx ~ xU(x,y)y is abelian, so is every semigroup that satisfies that identity. Because a group has an identity element and the cancellation property, it is easier to show that a group is abelian than that a semigroup is. If we know that it is, then there must be a sequence of substitutions using xU(x,y)y ~ yx that transforms xy to yx. We examine such sequences and propose finding them as a challenge to proof by computer. Also, every model of y ~ xU(x,y)x is a group. This raises a similar challenge, which we explore in the special case y ~ x^my^px^n. In addition we determine the free model with two generators of some of these identities. In particular, we find that the free model for y ~ x^2yx^2 has order 32 and is the product of D4 (the symmetries of a square), C2, and C2, and point out relations between such identities and Burnside's Problem concerning models of x^n= e.
No associations
LandOfFree
Semigroup Identities, Proofs, and Artificial Intelligence does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Semigroup Identities, Proofs, and Artificial Intelligence, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Semigroup Identities, Proofs, and Artificial Intelligence will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-253422