The Largest Subsemilattices of the Semigroup of Transformations on a Finite Set

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

7 pages

Scientific paper

Let T(X) be the semigroup of full transformations on a finite set X with n
elements. We prove that every subsemilattice of T(X) has at most 2^{n-1}
elements and that there are precisely n subsemilattices of size exactly
2^{n-1}, each isomorphic to the semilattice of idempotents of the symmetric
inverse semigroup on a set with n-1 elements.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The Largest Subsemilattices of the Semigroup of Transformations on a Finite Set 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 The Largest Subsemilattices of the Semigroup of Transformations on a Finite Set, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Largest Subsemilattices of the Semigroup of Transformations on a Finite Set will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-73366

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.