Related papers: Classification of finite group automorphisms with …

We study endomorphisms of a free group of finite rank by means of their action on specific sets of elements. In particular, we prove that every endomorphism of the free group of rank 2 which preserves an automorphic orbit (i.e., acts ``like…

We offer a criterion for showing that the automorphism group of an ultrahomogeneous structure is topologically 2-generated and even has a cyclically dense conjugacy class. We then show how finite topological rank of the automorphism group…

Let $G$ be a group. An element $g \in G$ is called a test element of $G$ if for every endomorphism $\varphi:G \to G$, $\varphi(g)=g$ implies that $\varphi$ is an automorphism. We prove that for a finitely generated profinite group $G$, $g…

We provide a simplified characterization of entanglement in physical systems which are symmetric under the action of subgroups of the symmetric group acting on the party labels. Sets of entanglements are inherently equal, lying in the same…

We consider a special category of Hopf algebras, depending on parameters $\Sigma$ which possess properties similar to the category of representations of simple Lie group with highest weight $\lambda$. We connect quantum groups to minimal…

The first-order theory of the automorphism group of an infinite resplendent model in a finite language is undecidable.

Totally symmetric sets are a recently introduced tool for studying homomorphisms between groups. In this paper, we give full classifications of totally symmetric sets in certain families of groups and bound their sizes in others. As a…

An automorphism of a graph $G=(V,E)$ is a bijective map $\phi$ from $V$ to itself such that $\phi(v_i)\phi(v_j)\in E$ $\Leftrightarrow$ $v_i v_j\in E$ for any two vertices $v_i$ and $v_j$. Denote by $\mathfrak{G}$ the group consisting of…

Given an arbitrary group $G$ we construct a semigroup of idempotents (band) $B_G$ with the property that the free idempotent generated semigroup over $B_G$ has a maximal subgroup isomorphic to $G$. If $G$ is finitely presented then $B_G$ is…

We give a classification of maximal elements of the set of finite groups that can be realized as the full automorphism groups of simple polarized abelian fourfolds over finite fields. As an application, we compute the Jordan constants of…

For any given finite group, Schulte and Williams (2015) establish the existence of a convex polytope whose combinatorial automorphisms form a group isomorphic to the given group. We provide here a shorter proof for a stronger result: the…

Let $G$ be a group. The orbits of the natural action of $\mbox{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 the finite nonsolvable groups $G$…

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…

In this article, we show super-rigidity of Gromov's random monster group. We prove that any morphism $\phi_\alpha$ from Gromov's random monster group $\Gamma_\alpha$ to the group $G$ has finite image for almost all $\alpha$, where $G$ is…

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

Let $\Gamma$ be a finite group, let $\theta$ be an involution of $\Gamma$, and let $\rho$ be an irreducible complex representation of $\Gamma$. We bound $\dim \rho^{\Gamma^{\theta}}$ in terms of the smallest dimension of a faithful…

Given a cyclic group $G$ of order $p^r$, where $p$ is a prime and $r\in\mathbb{N}$. It is well-known that the order of its greatest proper subgroup $\psi(G)$ and the number of its generators $\phi(G)$ satisfy $\psi(G)+\phi(G)=p^r$. In this…

We characterize finite $p$-groups $G$ of order up to $p^7$ for which the group of central automorphisms fixing the center element-wise is of minimum possibe order.

Given a finite group $G$ and a conjugacy class of involutions $X$ of $G$, we define the commuting involution graph $\mathcal{C}(G,X)$ to be the graph with vertex set $X$ and $x,y \in X$ adjacent if and only if $x \neq y$ and $xy =yx$. In…

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of non-abelian simple groups. The minimum number of nonsolvable factors, attained on all possible such series in $G$, is called…