Related papers: Automorphism Groups of Countable Stable Structures

We consider the isometry group of the infinite dimensional separable hyperbolic space with its Polish topology. This topology is given by the pointwise convergence. For non-locally compact Polish groups, some striking phenomena like…

We establish links between countable algebraically closed graphs and the endomorphisms of the countable universal graph $R$. As a consequence we show that, for any countable graph $\Gamma$, there are uncountably many maximal subgroups of…

In this paper we present general techniques for characterising minimal and maximal semigroup topologies on the endomorphism monoid $\operatorname{End}(\mathbb{A})$ of a countable relational structure $\mathbb{A}$. As applications, we show…

Let $\mathrm{G}$ be a subgroup of the symmetric group $\mathfrak S(U)$ of all permutations of a countable set $U$. Let $\overline{\mathrm{G}}$ be the topological closure of $\mathrm{G}$ in the function topology on $U^U$. We initiate the…

In \cite{MbPe}, Mbombo and Pestov prove that the group of isometries of the generalized Urysohn space of density $\kappa$, for uncountable $\kappa$ such that $\kappa^{<\kappa}=\kappa$, is not a universal topological group of weight…

We study locally compact group topologies on semisimple Lie groups. We show that the Lie group topology on such a group $S$ is very rigid: every 'abstract' isomorphism between $S$ and a locally compact and $\sigma$-compact group $\Gamma$ is…

Let G be a group and let O_G denote the set of left orderings on G. Then O_G can be topologized in a natural way, and we shall study this topology to answer three conjectures. In particular we shall show that O_G can never be countably…

Our first motivation was the question: can a countable structure have an automorphism group, which a free uncountable group? This is answered negatively in [Sh:744]. Lecturing in a conference in Rutgers, February 2001, I was asked whether I…

We study automorphism groups of randomizations of separable structures, with focus on the $\aleph_0$-categorical case. We give a description of the automorphism group of the Borel randomization in terms of the group of the original…

A group is said to be stable if it is isomorphic to its automorphism group. We investigate how we can extend centerless groups to construct finite stable groups with nontrivial centers. To this end, we classify all finite stable groups…

We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…

For a centerless group G, we can define its automorphism tower. We define G^{alpha} : G^0=G, G^{alpha +1}=Aut(G^alpha) and for limit ordinals G^delta=bigcup_{alpha < delta}G^alpha . Let tau_G be the ordinal when the sequence stabilizes.…

Assuming G\"{o}del's axiom of constructibility $\bold V=\bold L,$ we present a characterization of those groups $L$ for which there exist arbitrarily large groups $H$ such that $aut(H) \cong L$. In particular, we show that it suffices to…

A topological group $G$ is called an $M_\omega$-group if it admits a countable cover $\K$ by closed metrizable subspaces of $G$ such that a subset $U$ of $G$ is open in $G$ if and only if $U\cap K$ is open in $K$ for every $K\in\K$. It is…

If M,N are countable, arithmetically saturated models of Peano Arithmetic and Aut(M) is isomorphic to Aut(N), then the Turing-jumps of Th(M) and Th(N) are recursively equivalent.

The automorphism tower of a group is obtained by computing its automorphism group, the automorphism group of THAT group and so on, iterating transfinitely. Each group maps into the next using inner automorphisms and one takes a direct limit…

We prove that in a continuous $\aleph_0$-stable theory every type-definable group is definable. The two main ingredients in the proof are: \begin{enumerate} \item Results concerning Morley ranks (i.e., Cantor-Bendixson ranks) from…

We study the automorphisms of binary stabilizer codes and states. We prove that they almost always form a solvable group, and thereby shed new light on the fact that there is no universal set of transversal gates. We also determine the…

The group of isometries W of a regular rooted tree, and many of its subgroups with branching structure, have groups of automorphisms induced by conjugation in W. This fact has stimulated the computation of the group of automorphisms of such…

For a homeomorphism $T \colon X \to X$ of a compact metric space $X$, the stabilized automorphism group $\text{Aut}^{(\infty)}(T)$ consists of all self-homeomorphisms of $X$ which commute with some power of $T$. Motivated by the study of…