A presentation as well as a structural description of the automorphism group of a family of 3-generator finite $p$-groups is given, $p$ being an odd prime.
In this paper we prove that every $2$-generator finite $p$-group $G$ has a non-inner automorphism of order $p$ leaving $G^pγ_4(G)$ elementwise fixed ($p\ge 5$). Moreover, we prove a $2$-generator finite $3$-group satisfying $|Ω_1(Z_2(G))|=p^2$ has a non-inner automorphism of order $p$ leaving $G^pγ_3(G)$ elementwise fixed. As a consequence we prove the non-inner automorphism conjecture for every finite $p$-group of coclass $4$ ($p\ge 3$), and coclass $5$ ($p\ge 5$).
For a positive integer $n$, with $n \geq 4$, let $R_{n}$ be a free (nilpotent of class 2)-by-abelian and abelian-by-(nilpotent of class 2) Lie algebra of rank $n$. We show that the subgroup of Aut$(R_{n})$ generated by the tame automorphisms and a countably infinite set of explicitly given automorphisms of $R_{n}$ is dense in Aut$(R_{n})$ with respect to the formal power series topology.
We describe a set of generators and defining relations for the group of birational automorphisms of a general 15-nodal quartic surface in the complex projective 3-dimensional space.
We prove that $d(G) \log |G| = O(n^2 \log q)$ for irreducible subgroups $G$ of GL$(n,q)$, and estimate the associated constants. The result is motivated by attempts to bound the complexity of computing the automorphism groups of various classes of finite groups.
Let $G$ be a finite solvable group, given through a refined consistent polycyclic presentation, and $α$ an automorphism of $G$, given through its images of the generators of $G$. In this paper, we discuss algorithms for computing the order of $α$ as well as the cycle length of a given element of $G$ under $α$. We give correctness proofs and discuss the theoretical complexity of these algorithms. Along the way, we carry out detailed complexity analyses of several classical algorithms on finite polycyclic groups.
Let $G=\mathbf{Z}_{p} \oplus \mathbf{Z}_{p^2}$, where $p$ is a prime number. Suppose that $d$ is a divisor of the order of $G$. In this paper we find the number of automorphisms of $G$ fixing $d$ elements of $G$, and denote it by $θ(G,d)$. As a consequence, we prove a conjecture of Checco-Darling-Longfield-Wisdom. We also find the exact number of fixed-point-free automorphisms of the group $\mathbf{Z}_{p^{a}} \oplus \mathbf{Z}_{p^{b}}$, where $a$ and $b$ are positive integers with $a<b$. Finally, we compute $θ(D_{2q},d)$, where $D_{2q}$ is the dihedral group of order $2q$, $q$ is an odd prime …
It is well known that the automorphism group of a regular dessin is a two-generator finite group, and the isomorphism classes of regular dessins with automorphism groups isomorphic to a given finite group $G$ are in one-to-one correspondence with the orbits of the action of $\Aut(G)$ on the ordered generating pairs of $G$. If there is only one orbit, then up to isomorphism the regular dessin is uniquely determined by the group $G$ and it is called uniquely regular. In the paper we investigate the classification of uniquely regular dessins with a nilpotent automorphism group. The problem is red…
We consider translation surfaces with poles on surfaces. We shall prove that any finite group appears as the automorphism group of some translation surface with poles. As a direct consequence we obtain the existence of structures achieving the maximal possible number of automorphisms allowed by their genus and we finally extend the same results to branched projective structures.
We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It permits to compute all chiral polytopes of groups that were previously unreachable by other known algorithms.
We consider left-invariant distances $d$ on a Lie group $G$ with the property that there exists a multiplicative one-parameter group of Lie automorphisms $(0, \infty)\rightarrow\mathtt{Aut}(G)$, $λ\mapstoδ_λ$, so that $ d(δ_λx,δ_λy) = λd(x,y)$, for all $x,y\in G$ and all $λ>0$. First, we show that all such distances are admissible, that is, they induce the manifold topology. Second, we characterize multiplicative one-parameter groups of Lie automorphisms that are dilations for some left-invariant distance in terms of algebraic properties of their infinitesimal generator. Third, we show that an…
Let $W$ be a quasiprojective variety over an algebraically closed field of characteristic zero. Assume that $W$ is birational to a product of a smooth projective variety $A$ and the projective line. We prove that if $A$ contains no rational curves then the automorphism group $G:=Aut(W)$ of $W$ is Jordan. That means that there is a positive integer $J=J(W)$ such that every finite subgroup $\mathcal{B}$ of ${G}$ contains a commutative subgroup $\mathcal{A}$ such that $\mathcal{A}$ is normal in $\mathcal{B}$ and the index $[\mathcal{B}:\mathcal{A}] \le J$ .
In this paper, we generalize the tools that were introduced in [Dar19b] in order to study the Andreadakis problem for subgroups of IAn. In particular, we study the behaviour of the Andreadakis problem when we add inner automorphisms to a subgroup of IAn. We notably use this to show that the Andreadakis equality holds for the pure braid group on n strands modulo its center acting on the free group on n-1 generators , that is, for the (pure, based) mapping class group of the n-punctured sphere acting on its fundamental group.
This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product of certain elementary automorphisms (inner automorphisms, partial conjugations, automorphisms associated to symmetries of the underlying graph). This allows us to completely compute the automorphism group of certain graph products, for instance in the case where the underlying graph is finite, connected, leafless and of girth at least $5$. If in addition the…
We study the automorphism group of an idempotent evolution algebra, show that any finite group can be the automorphism group of an evolution algebra, and describe certain evolution algebras with given automorphism groups. In particular, we classify $n$-dimensional idempotent evolution algebras whose automorphism group is isomorphic to the symmetric group $S_n$, and classify idempotent evolution algebras with maximal diagonal automorphism subgroups.
Polytopes are ubiquitous in different areas of mathematics. Gleason and Hubard established a factorisation theorem, stating that every abstract polytope has a unique factorisation into prime polytopes. We compute the automorphism group of a certain family of inductively constructed polytopes using the unique factorisation.
We study the outer automorphism group of a right-angled Artin group $A_Γ$ with finite defining graph $Γ$. We construct a subnormal series for $Out(A_Γ)$ such that each consecutive quotient is either finite, free-abelian, $GL(n,\mathbb{Z})$, or a Fouxe-Rabinovitch group. The last two types act respectively on a symmetric space or a deformation space of trees, so that there is a geometric way of studying each piece. As a consequence we prove that the group $Out(A_Γ)$ is type VF (it has a finite index subgroup with a finite classifying space). The main technical work is a study of relative outer …