Related papers: On a stronger reconstruction notion for monoids an…
We show how to reconstruct the topology on the monoid of endomorphisms of the rational numbers under the strict or reflexive order relation, and the polymorphism clone of the rational numbers under the reflexive relation. In addition we…
Every clone of functions comes naturally equipped with a topology---the topology of pointwise convergence. A clone $\mathfrak{C}$ is said to have automatic homeomorphicity with respect to a class $\mathcal{C}$ of clones, if every…
Every transformation monoid comes equipped with a canonical topology-the topology of pointwise convergence. For some structures, the topology of the endomorphism monoid can be reconstructed from its underlying abstract monoid. This…
We study locally closed transformation monoids which contain the automorphism group of the random graph. We show that such a transformation monoid is locally generated by the permutations in the monoid, or contains a constant operation, or…
We extend the work of M. Rubin on locally moving groups to clones, showing that a locally moving polymorphism clone has automatic homeomorphicity with respect to the class of all polymorphism clones. We show that if…
Transformation monoids carry a canonical topology --- the topology of point-wise convergence. A closed transformation monoid $\mathfrak{M}$ is said to have automatic homeomorphicity with respect to a class $\mathcal{K}$ of structures, if…
This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective. The properties of admitting a finite complete rewriting system, having finite derivation…
Let M be a compact manifold, possibly with boundary. We show that the group of homeomorphisms of M has the automatic continuity property: any homomorphism from Homeo(M) to any separable group is necessarily continuous. This answers a…
Clones are specializations of operads forming powerful instruments to describe varieties of algebras wherein repeating variables are allowed in their equations. They allow us in this way to realize and study a large range of algebraic…
We study congruences on the partial automorphism monoid of a finite rank free group action. We give a decomposition of a congruence on this monoid into a Rees congruence, a congruence on a Brandt semigroup and an idempotent separating…
As an appropriate generalisation of the features of the classical (Schein) theory of representations of inverse semigroups in $\mathscr{I}_{X}$, a theory of representations of inverse semigroups by homomorphisms into complete atomistic…
The concept of an adapted homology basis for a prime order conformal automorphism of a compact Riemann surface extends to arbitrary finite groups of conformal automorphisms. Here we compute some examples of adapted homology bases for some…
Let $G$ be a countable monoid and let $A$ be an Artinian group (resp. an Artinian module). Let $\Sigma \subset A^G$ be a closed subshift which is also a subgroup (resp. a submodule) of $A^G$. Suppose that $\Gamma$ is a finitely generated…
We describe the automorphism groups of reductive monoids and of root monoids with active groups of invertible elements.
Various spaces of symmetries of a structure are naturally endowed with both an algebraic and a topological structure. For example, the automorphism group of a structure is, on top of being a group, a topological group when equipped with the…
We prove that if S is a set of functions from a set A to itself, S is closed under composition, and S contains all transpositions of A, then the action of S on Acan be recovered from the semigroup consisting of S together with its…
A general overview of the phenomenon of automatic continuity of homomorphisms between Polish groups is given. In particular, we study variants and improvements of the closed graph theorem, applying these to the problem of continuity of…
We extend results from an earlier paper giving reconstruction results for the endomorphism monoid of the rational numbers under the strict and reflexive relations to the first order reducts of the rationals and the corresponding…
A combinatorial property of prositive group presentations, called completeness, is introduced, with an effective criterion for recognizing complete presentations, and an iterative method for completing an incomplete presentation. We show…
In this article we construct asynchronous and sometimes synchronous automatic structures for amalgamated products and HNN extensions of groups that are strongly asynchronously (or synchronously) coset automatic with respect to the…