Related papers: Realizing Finite Groups as Automizers

Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…

In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group $G$ lying in a variety ${\mathcal M}$ can be embedded in a $4$-generated group $H \in…

Let $G$ be a finite $p$-group and let Aut$(G)$ denote the full automorphism group of $G$. In the recent past, there has been interest in finding necessary and sufficient conditions on $G$ such that certain subgroups of Aut$(G)$ are equal.…

A group is $\textit{finitely axiomatizable}$ (FA) in a class $\mathcal{C}$ if it can be determined up to isomorphism within $\mathcal{C}$ by a sentence in the first-order language of group theory. We show that profinite groups of various…

We show that every finite abelian group $G$ occurs as the group of rational points of an ordinary abelian variety over $\mathbb{F}_2$, $\mathbb{F}_3$ and $\mathbb{F}_5$. We produce partial results for abelian varieties over a general finite…

We prove that every finite group $G$ can be realized as the automorphism group of a poset with $4|G|$ points. We also provide bounds for the minimum number of points of a poset with cyclic automorphism group of a given prime power order.

For each prime $p$ we construct a family $\{G_i\}$ of finite $p$-groups such that $|\Aut (G_i)|/|G_i|$ goes to $0$, as $i$ goes to infinity. This disproves a well-known conjecture that $|G|$ divides $|\Aut(G)|$ for every non-abelian finite…

Finitely generated (non-abelian) free metabelian pro-p groups, and wreath products of f.g. free abelian pro-p groups, are all finitely axiomatizable in the class of all profinite groups.

Given a finite abelian group $G$ and elements $x, y \in G$, we prove that there exists $\phi \in \text{Aut}(G)$ such that $\phi(x) = y$ if and only if $G/\langle x \rangle \cong G/\langle y \rangle$. This result leads to our development of…

We give an introduction to the realisation theory for infinite-dimensional systems. That is, we show that for any function $G$, analytic and bounded in the right half of the complex plane, there exists operators $A,B,C$ such that…

This paper gives a new explicit construction of the $\mathbb{Q}$-algebraic hull for virtually solvable groups $\Gamma$ of finite abelian ranks, taking into account the spectrum $S$ of the group $\Gamma$. As an application, we make a…

We give a classification of maximal elements of the set of finite groups that can be realized as the full automorphism groups of polarized abelian surfaces over finite fields.

We prove that if a finite group $G$ acts smoothly on a manifold $M$ so that all the isotropy subgroups are abelian groups with rank $\leq k$, then $G$ acts freely and smoothly on $M \times \bbS^{n_1} \times...\times \bbS^{n_k}$ for some…

This paper investigates the finite generation of cluster automorphism groups. By applying the pseudo $\mathbb{N}$-grading introduced in our previous work, we establish a sufficient condition for a cluster automorphism group to be finitely…

In this note we prove that every finite collection of connected algebraic subgroups of the group of triangular automorphisms of the affine space generates a connected solvable algebraic subgroup.

In this paper, we discuss about finite groups in which, CGH = NGH, for every abelian subgroup H of non prime power order. Also, we classify all such nilpotent and minimal non nilpotent groups.

In a recent paper of Bhowmick, Skalski and So{\l}tan the notion of a quantum group of automorphisms of a finite quantum group was introduced and, for a given finite quantum group G, existence of the universal quantum group acting on G by…

Generalizing the idea of self-similar groups defined by Mealy automata, we itroduce the notion of a self-similar automaton and a self-similar group over a changing alphabet. We show that every finitely generated residually-finite group is…

We consider finite deterministic automata such that their alphabets consist of exactly one letter of defect 1 and a set of permutations of the state set. We study under which conditions such an automaton is completely reachable. We focus…

We prove that every finitely generated soluble group which is not virtually abelian has a subgroup of one of a small number of types.