Maximal clones on uncountable sets that include all permutations

Simple item page
dc.creatorPinsker, Michael
dc.date2004-01-10
dc.date2005-05-14
dc.date.accessioned2026-07-07T05:04:28Z
dc.date.available2026-07-07T05:04:28Z
dc.descriptionWe 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.
dc.description19 pages; latest version has shorter proofs and no mistakes
dc.identifierhttps://arxiv.org/abs/math/0401103
dc.identifierhttp://arxiv.org/abs/math/0401103
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/69817
dc.subjectRings and Algebras
dc.subjectLogic
dc.subject08A40; 08A05
dc.titleMaximal clones on uncountable sets that include all permutations
dc.typetext

Files

Collections

arXiv