Related papers: On the twisted conjugacy problem for large-type Ar…
A group is called decomposable if it can be expressed as a direct product of two proper subgroups, and indecomposable otherwise. This paper explores the decomposability of virtual Artin groups, which were introduced by Bellingeri, Paris,…
A left orderable completely metrizable topological group is exhibited containing Artin's braid group on infinitely many strands. The group is the mapping class group (rel boundary) of the closed unit disk with a sequence of interior…
We show that the extended based mapping class group of an infinite-type surface is naturally isomorphic to the automorphism group of the loop graph of that surface. Additionally, we show that the extended mapping class group stabilizing a…
A group is self-simulable if all its computable actions admit SFT covers, which means roughly that they can be implemented with finitely many tiling constraints. We prove that a graph product of infinite finitely-generated groups is…
We study twisted conjugacy classes of the unit element in different groups. Fel'shtyn and Troitsky showed that the twisted conjugacy class of the unit element of an abelian group is a subgroup for every automorphism. The structure is…
The braid group $B_{n}$, endowed with Artin's presentation, admits two distinguished involutions. One is the anti-automorphism ${\rm{rev}}: B_{n} \to B_{n}$, $v \mapsto \bar{v}$, defined by reading braids in the reverse order (from right to…
We construct connected $2$-arc-transitive covers of complete graphs with non-abelian characteristically simple transformation groups. This solves the existence problem for non-solvable $2$-arc-transitive covers of complete graphs.
A graph is said to be nearly complete bipartite if it can be obtained by deleting a set of independent edges from a complete bipartite graph. The nonorientable genus of such graphs is known except in a few cases where the sizes of the…
In this article, we construct (graded) automorphisms fixing all vertices of Leavitt path algebras of arbitrary graphs in terms of general linear groups over corners of these algebras. As an application, we study Zhang twist of Leavitt path…
We show that every finitely generated group G with an element of order at least $(5rank(G))^{12}$ admits a locally finite directed Cayley graph with automorphism group equal to G. If moreover G is not generalized dihedral, then the above…
We provide an algorithm to solve the word problem in all fundamental groups of closed 3-manifolds; in particular, we show that these groups are autostackable. This provides a common framework for a solution to the word problem in any closed…
Even Artin groups generalize right-angled Artin groups by allowing the labels in the defining graph to be even. In this paper a complete characterization of quasi-projective even Artin groups is given in terms of their defining graphs.…
The present paper constructs unbounded quasimorphisms that are invariant under all automorphisms on free products of more than two factors and on graph products of finitely generated abelian groups. This includes many classes of right…
We develop a new framework for analysing finite connected, oriented graphs of valency 4, which admit a vertex-transitive and edge-transitive group of automorphisms preserving the edge orientation. We identify a sub-family of "basic" graphs…
We give a necessary and sufficient condition for the fundamental group of a finite graph of groups with infinite cyclic edge groups to be acylindrically hyperbolic, from which it follows that a finitely generated group splitting over Z…
In this paper, we solve the conjugacy problem for Topological Full Groups of Irreducible Edge Shifts, introduced by Matui in 2015 and later recontextualized as groups of almost automorphisms of trees by Lederle in 2020. The techniques we…
For a right-angled Artin group $A_\Gamma$, the untwisted outer automorphism group $U(A_\Gamma)$ is the subgroup of $Out(A_\Gamma)$ generated by all of the Laurence-Servatius generators except twists (where a {\em twist} is an automorphisms…
In various occasions the conjugacy problem in finitely generated amalgamated products and HNN extensions can be decided efficiently for elements which cannot be conjugated into the base groups. This observation asks for a bound on how many…
We consider the outer automorphism group Out(A_Gamma) of the right-angled Artin group A_Gamma of a random graph Gamma on n vertices in the Erdos--Renyi model. We show that the functions (log(n)+log(log(n)))/n and 1-(log(n)+log(log(n)))/n…
We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.