Related papers: Automorphisms of graphs of groups with cyclic edge…

A graphs of rank n (homotopy equivalent to a wedge of n circles) without ``separating edges'' has a canonical n-dimensional compact C^1 manifold thickening. This implies that the canonical homomorphism f:Out(F_n)-> GL(n,Z) is trivial in…

Subsurface projection has become indispensable in studying the geometry of the mapping class group and the curve complex of a surface. When the subsurface is an annulus, this projection is sometimes called relative twisting. We give two…

A nut graph is a simple graph for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry. If the isolated vertex is excluded as trivial, nut graphs have seven or more vertices;…

We show that certain graphs of groups with cyclic edge groups are aTmenable. In particular, this holds when each vertex group is either virtually special or acts properly and semisimply on $\mathbb{H}^n$.

Frucht showed that, for any finite group $G$, there exists a cubic graph such that its automorphism group is isomorphic to $G$. For groups generated by two elements we simplify his construction to a graph with fewer nodes. In the general…

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…

The problem of finding upper bounds for minimal vertex number of graphs with a given automorphism group is addressed in this article for the case of cyclic $2$-groups. We show that for any natural $n\ge 2$ there is an undirected graph…

In this paper, we discuss a group-theoretical generalization of the well-known Gauss formula involving the functionthat counts the number of automorphisms of a finite group. This gives several characterizations of finite cyclic groups.

Let $\Gamma$ be a simple undirected graph on a finite vertex set and let $A$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A$ is singular. The problem of characterising singular graphs is easy to state but very difficult to…

For a complex surface of general type with a relatively minimal genus 2 fibration, the bounds of the orders of the automorphism group of the fibration, of its abelian subgroups and of its cyclic subgroups are determined as linear functions…

Let $\mathcal{L}$ be a centric linking system associated to a saturated fusion system on a finite $p$-group $S$. An automorphism of $\mathcal{L}$ is said to be rigid if it restricts to the identity on the fusion system. An inner rigid…

A rigid automorphism of a linking system is an automorphism which restricts to the identity on the Sylow subgroup. A rigid inner automorphism is conjugation by an element in the center of the Sylow subgroup. At odd primes, it is known that…

The theory of voltage graphs has become a standard tool in the study graphs admitting a semiregular group of automorphisms. We introduce the notion of a cyclic generalised voltage graph to extend the scope of this theory to graphs admitting…

For a classical group $G$ of type $\mathsf D_n$ over a field $k$ of characteristic different from $2$, we show the existence of a finitely generated regular extension $R$ of $k$ such that $G$ admits outer automorphisms over $R$. Using this…

An automorphism of a graph $G$ with $n$ vertices is a bijective map $\phi$ from $V(G)$ to itself such that $\phi(v_i)\phi(v_j)\in E(G)$ $\Leftrightarrow$ $v_i v_j\in E(G)$ for any two vertices $v_i$ and $v_j$ of $G$. Denote by…

We introduce the notion of graphical discreteness to group theory. A finitely generated group is graphically discrete if whenever it acts geometrically on a locally finite graph, the automorphism group of the graph is compact-by-discrete.…

Gauge theories are important descriptions for many physical phenomena and systems in quantum computation. Automorphism of gauge group naturally gives global symmetries of gauge theories. In this work we study such symmetries in gauge…

We generalize the enhanced power graph by replacing elements with classes under automorphisms. We show that the connectivity and diameter of this graph is similar to that of the enhanced power graph. We consider the universal vertices of…

Let a finitely generated group $G$ split as a graph of groups. If edge groups are undistorted and do not contribute to the Morse boundary $\partial_MG$, we show that every connected component of $\partial_MG$ with at least two points…

By a theorem of Thurston, in the subgroup of the mapping class group generated by Dehn twists around two curves that fill, every element not conjugate to a power of one of the twist is pseudo-Anosov. We prove an analogue of this theorem for…