arXiv · math/0401103
Maximal clones on uncountable sets that include all permutations
Abstract
We first determine the maximal clones on a set X of infinite regular cardinality which contain all permutations but not all unary functions, extending a result of Heindorf's for countably infinite X. If |X| is countably infinite or weakly compact, this yields a list of all maximal clones containing the permutations since in that case the maximal clones above the unary functions are known. We then generalize a result of Gavrilov's to obtain on all infinite X a list of all maximal submonoids of the monoid of unary functions which contain the permutations.
Explore related subjects
Keep this discovery
Michael Pinsker. 2005-05-14. Maximal clones on uncountable sets that include all permutations. https://arxiv.org/abs/math/0401103
Cite the original work for its findings. Save a collection to share your selection of sources.