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

preprint2010arXivOpen access

Abstract

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.