On a stronger reconstruction notion for monoids and clones

Abstract

Motivated by reconstruction results by Rubin, we introduce a new reconstruction notion for permutation groups, transformation monoids and clones, called automatic action compatibility, which entails automatic homeomorphicity. We further give a characterization of automatic homeomorphicity for transformation monoids on arbitrary carriers with a dense group of invertibles having automatic homeomorphicity. We then show how to lift automatic action compatibility from groups to monoids and from monoids to clones under fairly weak assumptions. We finally employ these theorems to get automatic action compatibility results for monoids and clones over several well-known countable structures, including the strictly ordered rationals, the directed and undirected version of the random graph, the random tournament and bipartite graph, the generic strictly ordered set, and the directed and undirected versions of the universal homogeneous Henson graphs.

32 pp; changes to v2: minor modifications, typos corrected, Cor. 5.5, Lem. 5.6, Fact 5.7, Lem. 5.8, Cor. 5.9 are new; Cor. 5.5/5.6 have become 5.10/5.11; some references added and updated

References in corpus (7)

• Projective clone homomorphisms
• Strictly semi-transitive operator algebras
• Reconstructing the topology on monoids and polymorphism clones of the rationals
• Locally Moving Groups and the Reconstruction Problem for Chains and Circles
• On automatic homeomorphicity for transformation monoids
• Reconstruction theorems for semigroups of functions which contain all transpositions of a set and for clones with the same property
• A uniform Birkhoff theorem