home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math
- Path: sparky!uunet!noc.near.net!black.clarku.edu!black.clarku.edu!djoyce
- From: djoyce@black.clarku.edu (Dave Joyce)
- Subject: Re: A word problem
- Message-ID: <djoyce.724444576@black.clarku.edu>
- Organization: Clark University (Worcester, MA)
- References: <1992Dec12.162349.29729@dcs.qmw.ac.uk>
- Date: 15 Dec 92 18:36:16 GMT
- Lines: 35
-
- In <1992Dec12.162349.29729@dcs.qmw.ac.uk> arodgers@dcs.qmw.ac.uk (Angus H Rodgers) writes:
-
- >Are there any finitely generated infinite semigroups in which
- >the idempotent law holds?
- >
- >The "free idempotent semigroup" (if that's the name for it) on
- >2 generators has 6 elements. I don't know if the f.i.s. on 3
- >generators is infinite, but it's certainly quite big.
- >
- [Description and comments for problem with an alphabet {a,b,c} deleted]
- >
- >Is there, nevertheless, a recipe or existence proof for arbitarily
- >long reduced words?
- >--
- >Gus Rodgers, Dept. of Computer Science, |
- >Queen Mary & Westfield College, Mile End |
- >Road, London, England. +44 71 975 5241 |
- >E-mail (JANET): arodgers@dcs.qmw.ac.uk | Post in haste, repent at leisure.
-
- This is a very interesting problem, but I haven't made any progress on it yet.
- As the length of the word increases, it looks like the number of reduced words
- of that length increases, but ever more slowly (when n=3).
-
- Sometimes the source of a problem helps in solving the problem. I'd like to
- know more about it.
-
- Does anyone know examples of idempotent semigroups (or idempotent monoids)
- besides the commutative ones? (Commutative ones are semilattices and don't
- help with this problem.)
-
-
- --
- David E. Joyce Dept. Math. & Comp. Sci.
- Internet: djoyce@black.clarku.edu Clark University
- BITnet: djoyce@clarku Worcester, MA 01610-1477
-