相关论文: Generating self-map monoids of infinite sets

Bergman has given the following abstract characterisation of the inner automorphisms of a group $G$: they are exactly those automorphisms of $G$ which can be extended functorially along any homomorphism $G \rightarrow H$ to an automorphism…

Ellis's "functional approach" allows one to obtain proper compactifications of a topological group $G$ if $G$ can be represented as a subgroup of the homeomorphism group of a space $X$ in the topology of pointwise convergence and $G$-space…

We explore the topological full group [[G]] of an essentially principal etale groupoid G on a Cantor set. When G is minimal, we show that [[G]] (and its certain normal subgroup) is a complete invariant for the isomorphism class of the etale…

To every directed graph $E$ one can associate a \emph{graph inverse semigroup} $G(E)$, where elements roughly correspond to possible paths in $E$. These semigroups generalize polycylic monoids, and they arise in the study of Leavitt path…

Let $\mathbb{U}$ be a Banach Lie group and $S\subseteq \mathbb{U}$ an ad-bounded subset thereof, in the sense that there is a uniform bound on the adjoint operators induced by elements of $S$ on the Lie algebra of $\mathbb{U}$. We prove…

A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…

Let S=Sym(\Omega) be the group of all permutations of an infinite set \Omega. Extending an argument of Macpherson and Neumann, it is shown that if U is a generating set for S as a group, respectively as a monoid, then there exists a…

This is the first of a sequence of papers devoted to studying the link between the complexity of the Word Problem for a finitely generated recursively presented group $G$ and the isoperimetric functions of the finitely presented groups in…

We adapt a construction of Gabrielov and Vorobjov for use in the symmetric case. Gabrielov and Vorobjov had developed a means by which one may replace an arbitrary set $S$ definable in some o-minimal expansion of $\mathbb{R}$ with a compact…

This paper presents a fanctor $S$ from the category of groupoids to the category of semigroups. Indeed, a monoid $S_G$ with a right zero element is related to a topological groupoid $G$. The monoid $S_G$ is a subset of $C(G,G)$, the set of…

We study the maximal subgroups (also known as group $\mathcal{H}$-classes) of finitely presented special inverse monoids. We show that the maximal subgroups which can arise in such monoids are exactly the recursively presented groups, and…

Early this century K. H. Hofmann and S. A. Morris introduced the class of pro-Lie groups which consists of projective limits of finite-dimensional Lie groups and proved that it contains all compact groups, all locally compact abelian…

Let G and F be finitely generated groups with infinitely many ends and let A and B be graph of groups decompositions of F and G such that all edge groups are finite and all vertex groups have at most one end. We show that G and F are…

Let $S$ be a set of transpositions that generates the symmetric group $S_n$, where $n \ge 3$. The transposition graph $T(S)$ is defined to be the graph with vertex set $\{1,\ldots,n\}$ and with vertices $i$ and $j$ being adjacent in $T(S)$…

If $M$ is a submonoid of a finitely generated nilpotent group $G$, and $MG'$ is a finite index subgroup of $G$, then $M$ itself is a finite index subgroup of $G$. If $MG'=G$, then $M=G$. This generalizes a well-known theorem for subgroups…

Let $S$ be an orientable, connected surface with infinitely-generated fundamental group. The main theorem states that if the genus of $S$ is finite and at least 4, then the isomorphism type of the pure mapping class group associated to $S$,…

We introduce a general framework, based on \'etale topological categories, for studying discrete restriction semigroups and their algebras. Generalizing Paterson's universal groupoid of an inverse semigroup, we define the universal category…

For a semigroup $S$, the covering number of $S$ with respect to semigroups, $\sigma_s(S)$, is the minimum number of proper subsemigroups of $S$ whose union is $S$. This article investigates covering numbers of semigroups and analogously…

A partial automorphism of a semigroup $S$ is any isomorphism between its subsemigroups, and the set all partial automorphisms of $S$ with respect to composition is the inverse monoid called the partial automorphism monoid of $S$. Two…

The $G$-graph $\Gamma(G,S)$ is a graph from the group $G$ generated by $S\subseteq G$, where the vertices are the right cosets of the cyclic subgroups $\langle s \rangle, s\in S$ with $k$-edges between two distinct cosets if there is an…