Related papers: Automorphism Orbits of the Group of Unitriangular …

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…

We study automorphism groups of formal matrix algebras. We also consider automorphisms of ordinary matrix algebras (in particular, triangular matrix algebras).

Let F be the field of two elements and G a finite abelian 2-group with an involutory automorphism. The extension of this automorphism to the group algebra FG is called an involutory involution. This determines the groups of unitary and…

If $G$ is a finite group then there is an integer $M_G$ such that$,$ for $u\ge M_G$ and $u\equiv 1$ or $3$ (mod 6), there is a Steiner triple system $U$ on $u$ points for which ${\rm Aut} U \cong G. \ $ If $V$ is a Steiner triple system…

A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…

We prove that the automorphism group of every infinitely-ended finitely generated group is acylindrically hyperbolic. In particular $\mathrm{Aut}(\mathbb{F}_n)$ is acylindrically hyperbolic for every $n\ge 2$. More generally, if $G$ is a…

For $N\geq 4$, we show that there exist automorphisms of the free group $F_N$ which have a parabolic orbit in $\partial F_N$. In fact, we exhibit a technology for producing infinitely many such examples.

Let $G$ be a finite group, and assume that $G$ has an automorphism of order at least $\rho|G|$, with $\rho\in\left(0,1\right)$. Generalizing recent analogous results of the author on finite groups with a large automorphism cycle length, we…

Automorphic loops are loops in which all inner mappings are automorphisms. A large class of automorphic loops is obtained as follows: Let $m$ be a positive even integer, $G$ an abelian group, and $\alpha$ an automorphism of $G$ that…

The automorphism group of a finitely generated free group is the normal closure of a single element of order 2. If $m$ is less than $n$ then a homomorphism $Aut(F_n)\to Aut(F_m)$ can have cardinality at most 2. More generally, this is true…

Let S be any orientable surface of infinite genus with a finite number of boundary components. In this work we consider the curve complex C(S), the nonseparating curve complex N(S) and the Schmutz graph G(S) of S. When all the topological…

We show that an automaton group or semigroup is infinite if and only if it admits an $\omega$-word (i. e. a right-infinite word) with an infinite orbit, which solves an open problem communicated to us by Ievgen V. Bondarenko. In fact, we…

An automorphism $\alpha$ of a group $G$ is called a commuting automorphism if each element $x$ in $G$ commutes with its image $\alpha(x)$ under $\alpha$. Let $A(G)$ denote the set of all commuting automorphisms of $G$. Rai [Proc. Japan…

We introduce a notion of quasimorphism between two arbitrary groups, generalizing the classical notion of Ulam. We then define and study the category of homogeneous quasigroups, whose objects are groups and whose morphisms are equivalence…

We study natural linear representations of self-similar groups over finite fields. In particular, we show that if the group is generated by a finite automaton, then obtained matrices are automatic. This shows a new relation between two…

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…

We construct the first known examples of infinite subgroups of the outer automorphism group of Out(A_Gamma), for certain right-angled Artin groups A_Gamma. This is achieved by introducing a new class of graphs, called focused graphs, whose…

For each element $u$ in a finite group $G$ define a map $\theta_u\colon G\to G$ by $\theta_u(g)=[g^{-u},g]$ and set $\Theta_G(u)=\{g\in G\mid \theta_u^n(g)=g \hbox{ for some } n>0\}$. Then $\theta_u$ induces a permutation of $\Theta_G(u)$;…

An infinite linearly ordered set (S,<=) is called doubly homogeneous if its automorphism group A(S) acts 2-transitively on it. We show that any group G arises as outer automorphism group G cong Out(A(S)) of the automorphism group A(S), for…

We study the automorphism group of graphons (graph limits). We prove that after an appropriate "standardization" of the graphon, the automorphism group is compact. Furthermore, we characterize the orbits of the automorphism group on…