Access the full text.
Sign up today, get DeepDyve free for 14 days.
S. Banach (1935)
Sur un théorème de M. SierpińskiFundamenta Mathematicae, 25
Wybrze˙ ze Wyspia´Wyspia´nskiego
J. Howie (1971)
Products of idempotents in certain semigroups of transformationsProceedings of the Edinburgh Mathematical Society, 17
H. Macpherson, P. Neumann (1990)
Subgroups of Infinite Symmetric GroupsJournal of The London Mathematical Society-second Series
Matthew GouldAbstractThe
Finite Posets Whose Monoids of Order-preserving Maps Are Abundant
CO4 3SQ peteh@essex.ac
P. Higgins, J. Mitchell, N. Ruškuc (2003)
GENERATING THE FULL TRANSFORMATION SEMIGROUP USING ORDER PRESERVING MAPPINGSGlasgow Mathematical Journal, 45
J. Howie, N. Ruškuc, P. Higgins (1998)
On relative ranks of full transformation semigroupsCommunications in Algebra, 26
J. Howie (1995)
Fundamentals of semigroup theory
(1935)
Fund. Math
G. Gomes, J. Howie (1992)
On the ranks of certain semigroups of order-preserving transformationsSemigroup Forum, 45
F. Galvin (1995)
Generating Countable Sets of PermutationsJournal of The London Mathematical Society-second Series, 51
M. Adams, M. Gould (1989)
Posets whose monoids of order-preserving maps are regularOrder, 6
P. Higgins, J. Howie, J. Mitchell, N. Ruškuc (2003)
COUNTABLE VERSUS UNCOUNTABLE RANKS IN INFINITE SEMIGROUPS OF TRANSFORMATIONS AND RELATIONSProceedings of the Edinburgh Mathematical Society, 46
G. Grätzer, J. Sichler (1970)
ON THE ENDOMORPHISM SEMIGROUP (AND CATEGORY) OF BOUNDED LATTICESPacific Journal of Mathematics, 35
T. Harju (2001)
Ordered Sets
W. Sierpinski (1935)
Sur les suites infinies de fonctions définies dans les ensembles quelconquesFundamenta Mathematicae, 24
S. Shelah, S. Thomas (1986)
Subgroups of small index in infinite symmetric groups. IIJournal of Symbolic Logic, 54
N. Ruškuc (1994)
On the rank of completely 0-simple semigroupsMathematical Proceedings of the Cambridge Philosophical Society, 116
P. Higgins, J. Howie, N. Ruškuc (1998)
Generators and factorisations of transformation semigroupsProceedings of the Royal Society of Edinburgh: Section A Mathematics, 128
The relative rank (S : U) of a subsemigroup U of a semigroup S is the minimum size of a set V ⊆ 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 ⩽ TX, the monoid of all self‐maps of an infinite set X, rank(TX : U) is either 0, 1 or 2, or uncountable. In this paper, the relative ranks rank(TX : OX) are considered, where X is a countably infinite partially ordered set and OX is the endomorphism monoid of X. We show that rank(TX : OX) ⩽ 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 TX that need to be adjoined to OX to form a generating set is, respectively, 0, 1, 2 and uncountable. 2000 Mathematics Subject Classification 08A35 (primary), 06A07, 20M20 (secondary).
Bulletin of the London Mathematical Society – Wiley
Published: Apr 1, 2006
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.