Related papers: Realizing Finite Groups as Automizers

A finitary automaton group is a group generated by an invertible, deterministic finite-state letter-to-letter transducer whose only cycles are self-loops at an identity state. We show that, for this presentation of finite groups, the…

Let $G$ be a group. The orbits of the natural action of $Aut(G)$ on $G$ are called "automorphism orbits" of $G$, and the number of automorphism orbits of $G$ is denoted by $\omega(G)$. In this paper we prove that if $G$ is an FC-group with…

Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…

We study the automorphisms of a graph product of finitely-generated abelian groups W. More precisely, we study a natural subgroup Aut* W of Aut W, with Aut* W = Aut W whenever vertex groups are finite and in a number of other cases. We…

In this paper, we prove that if $G$ is a finite group in which elements of the same order outside the center are conjugate, then $G$ is abelian or is isomorphic to $S_3$, the symmetry group of degree 3.

We obtain some general restrictions on the continuous endomorphisms of a profinite group G under the assumption that G has only finitely many open subgroups of each index (an assumption which automatically holds, for instance, if G is…

We explore connected affine algebraic groups $G$, which enjoy the following finiteness property $\rm (F)$: for every algebraic action of $G$, the closure of every $G$-orbit contains only finitely many $G$-orbits. We obtain two main results.…

In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…

We study the near action of the group PC of piecewise continuous self-transformations of the circle. Elements of this group are only defined modulo indeterminacy on a finite subset, which raises the question of realizability: a subgroup of…

We show that the set $SA(G)$ of equivalence classes of synchronously automatic structures on a geometrically finite hyperbolic group $G$ is dense in the product of the sets $SA(P)$ over all maximal parabolic subgroups $P$. The set $BSA(G)$…

We construct the groups $<A,B,C \;| \, A^2,B^2,C^2,(ABC)^2>$ and $<A,B \;| \, A^2,B^4,(AB)^4>$, using 3-state automata over the alphabets $\{1,2,3\}$ and $\{1,2,3,4\}$. In addition, we show, how to define direct powers of $G$ by automaton…

We consider the class $\mathcal{A}_0$ of Abelian block-rigid $CRQ$-groups of ring type. A subgroup $A$ of an Abelian group $G$ is called an \textsf{absolute ideal} of the group $G$ if $A$ is an ideal in any ring on $G$. We describe…

Let $G$ be an $\ell$-group (which is short for ``lattice-ordered abelian group''). Baker and Beynon proved that $G$ is finitely presented iff it is finitely generated and projective. In the category $\mathcal U$ of {\it unital}…

Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…

A celebrated result of J. Thompson says that if a finite group $G$ has a fixed-point-free automorphism of prime order, then $G$ is nilpotent. The main purpose of this note is to extend this result to finite inverse semigroups. An earlier…

A generalization of G-sets, called partial G-sets, are the sets that admit an action of partial maps on their subsets. Partial actions are a powerful tool to generalize many results of group actions. These generalizations are obtained by…

We introduce and investigate a class of profinite groups defined via extensions of centralizers analogous to the extensively studied class of finitely generated fully residually free groups, that is, limit groups (in the sense of Z. Sela).…

The article presents several methods for the arithmetic of finite abelian groups. We introduce a tool - already used by Delsarte in [1] as I found out later - analogous to Dirichlet's convolution to obtain combinatorial results on these…

We relate the construction of groups which realize saturated fusion systems and signaliser functors with homology decompositions of p-local finite groups. We prove that the cohomology ring of Robinson's construction is in some precise sense…

In this paper, we classify all finite groups $G$ which have the following property: for all subsets $A \subseteq G$, we have $|AA^{-1}| = |A^{-1}A|$. This question is motivated by the problem in additive combinatorics of More Sums Than…