Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-25T04:30:33.739Z Has data issue: false hasContentIssue false

RANK PROPERTIES OF ENDOMORPHISMS OF INFINITE PARTIALLY ORDERED SETS

Published online by Cambridge University Press:  16 March 2006

P. M. HIGGINS
Affiliation:
Department of Mathematics, University of Essex, Wivenhoe Park, Colchester, CO4 3SQ, United [email protected]
J. D. MITCHELL
Affiliation:
Mathematics Institute, University of St Andrews, North Haugh, St Andrews, Fife, KY16 9SS, United [email protected], [email protected]
M. MORAYNE
Affiliation:
Institute of Mathematics, Wrocław University of Technology, Wybrzeże Wyspiańskiego 27, 50–370 Wrocław, [email protected]
N. RUšKUC
Affiliation:
Mathematics Institute, University of St Andrews, North Haugh, St Andrews, Fife, KY16 9SS, United [email protected], [email protected]
Get access

Abstract

The relative rank $\mbox{\rm rank}(S:U)$ of a subsemigroup $U$ of a semigroup $S$ is the minimum size of a set $V\subseteq S$ such that $U$ together with $V$ generates the whole of $S$. As a consequence of a result of Sierpiński, it follows that for $U\leq \mathcal{T}_{X}$, the monoid of all self-maps of an infinite set $X$, $\mbox{\rm rank}(\mathcal{T}_{X}:U)$ is either 0, 1 or 2, or uncountable. In this paper, the relative ranks $\mbox{\rm rank}(\mathcal{T}_{X}:\mathcal{O}_{X})$ are considered, where $X$ is a countably infinite partially ordered set and $\mathcal{O}_{X}$ is the endomorphism monoid of $X$. We show that $\mbox{\rm rank}(\mathcal{T}_{X}:\mathcal{O}_{X})\leq 2$ if and only if either: there exists at least one element in $X$ which is greater than, or less than, an infinite number of elements of $X$; or $X$ has $|X|$ connected components. Four examples are given of posets where the minimum number of members of $\mathcal{T}_{X}$ that need to be adjoined to $\mathcal{O}_{X}$ to form a generating set is, respectively, 0, 1, 2 and uncountable.

Type
Papers
Copyright
The London Mathematical Society 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)