2000 character limit reached
On semigroups of endomorphisms of a chain with restricted range
Published 12 Jun 2013 in math.RA | (1306.2774v1)
Abstract: Let $X$ be a finite or infinite chain and let $O(X)$ be the monoid of all endomorphisms of $X$. In this paper, we describe the largest regular subsemigroup of $O(X)$ and Green's relations on $O(X)$. In fact, more generally, if $Y$ is a nonempty subset of $X$ and $O(X,Y)$ the subsemigroup of $O(X)$ of all elements with range contained in $Y$, we characterize the largest regular subsemigroup of $O(X,Y)$ and Green's relations on $O(X,Y)$. Moreover, for finite chains, we determine when two semigroups of the type $O(X,Y)$ are isomorphic and calculate their ranks.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.