Related papers: Fixed Sets of Automorphisms of Countable, Arithmet…

If an automorphism f of a structure M is such that fix(f^k) = fix(f) for all positive k, then M|fix(f) is a substructure of M. The possible isomorphism types of such M|fix(f) are characterized when M is countable and arithmetically…

We will review the main results concerning the automorphism groups of saturated structures which were obtained during the two last decades. The main themes are: the small index property in the countable and uncountable cases; the…

We investigate the size of fixed point sets of automorphisms of bounded domains in $\mathbb{C}^n$. In one complex variable, a nontrivial automorphism has at most two fixed points, but in higher dimensions fixed point sets need not be…

For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…

We study the synchronous and asynchronous automatic structures on the fundamental group of a graph of groups in which each edge group is finite. Up to a natural equivalence relation, the set of biautomatic structures on such a graph product…

We show that smooth well formed weighted complete intersections have finite automorphism groups, with several obvious exceptions.

We explicitly determine the automorphism groups of all self-similar trees (a.k.a. trees with finitely many cone types). We show that any such automorphism group is a direct limit of certain finite products of finite symmetric groups, which…

We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…

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 derive a formula connecting the orders of the automorphism groups of a finite group and of its covering groups.

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.

In this paper we look at the automorphisms of the multiplicative group of finite nearfields. We find partial results for the actual automorphism groups. We find counting techniques for the size of all finite nearfields. We then show that…

For every countable structure $M$ we construct an $\aleph_0$-stable countable structure $N$ such that $Aut(M)$ and $Aut(N)$ are topologically isomorphic. This shows that it is impossible to detect any form of stability of a countable…

We classify all group topologies coarser than the topology of stabilizers of finite sets in the case of automorphism groups of countable free-homogeneous structures, Urysohn space and Urysohn sphere, among other related results.

The aim of this note is to provide a conceptually simple demonstration of the fact that repetitive model sets are characterized as the repetitive Meyer sets with an almost automorphic associated dynamical system.

In this paper we determine automorphism groups of cyclic algebraic curves defined over finite fields of any characteristic.

We bound the number of fixed points of an automorphism of a real curve in terms of the genus and the number of connected components of the real part of the curve. Using this bound, we derive some consequences concerning the maximum order of…

We describe an underlying right angled building structure of any graph product of buildings. We describe the automorphism group of the graph product of buildings. We show that the notion of generalized graph product of a collection of…

Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…

It is well-known that there exist infinite sequences that are the fixed point of non-uniform morphisms, but not $k$-automatic for any $k$. In this note we show that every $k$-automatic sequence is the image of a fixed point of a {\it…