Related papers: On the twisted conjugacy problem for large-type Ar…

We describe computational results about undirected graphs having $10$ vertices and automorphism group isomorphic to $\mathbb{Z}/4\mathbb{Z}$.

We show that the membership problem in a finitely generated submonoid of a graph group (also called a right-angled Artin group or a free partially commutative group) is decidable if and only if the independence graph (commutation graph) is…

Using abelian coverings of Salvetti complexes, embeddings of outer automorphism groups of right-angled Artin groups (RAAGs) into outer automorphism groups of their particular characteristic subgroups are constructed. Virtual embeddings of…

We solve the simultaneous conjugacy problem in Artin's braid groups and, more generally, in Garside groups, by means of a complete, effectively computable, finite invariant. This invariant generalizes the one-dimensional notion of super…

We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particular, we show that for connected, $K_{h+1}$-minor-free,…

We prove twisted homological stability with polynomial coefficients for automorphism groups of free nilpotent groups of any given class. These groups interpolate between two extremes for which homological stability was known before, the…

We show that smooth well formed weighted complete intersections have finite automorphism groups, with several obvious exceptions.

The Tits Conjecture, proved by Crisp and Paris, states that squares of the standard generators of any Artin group generate an obvious right-angled Artin subgroup. We consider a larger set of elements consisting of all the centers of the…

We study several natural decision problems in braid groups and Artin groups. We classify the Artin groups with decidable submonoid membership problem in terms of the non-existence of certain forbidden induced subgraphs of the defining…

Let $\Gamma_d(q)$ denote the group whose Cayley graph with respect to a particular generating set is the Diestel-Leader graph $DL_d(q)$, as described by Bartholdi, Neuhauser and Woess. We compute both $Aut(\Gamma_d(q))$ and…

Generalized twisted Gabidulin codes are one of the few known families of maximum rank matrix codes over finite fields. As a subset of m by n matrices, when m=n, the automorphism group of any generalized twisted Gabidulin code has been…

We find finite presentations for the automorphism group of the Artin pure braid group and the automorphism group of the pure braid group associated to the full monomial group.

We define a family of groups that include the mapping class group of a genus g surface with one boundary component and the integral symplectic group Sp(2g,Z). We then prove that these groups are finitely generated. These groups, which we…

Recently, Ali et al. posed several open problems concerning extremal graphs with respect to the ABS index. These problems involve characterizing graphs that attain the maximum ABS index within specific graph classes, including: connected…

Given an Artin group $A$ and a parabolic subgroup $P$, we study if every two elements of $P$ that are conjugate in $A$, are also conjugate in $P$. We provide an algorithm to solve this decision problem if $A$ satisfies three properties that…

Let $G$ be a finite group and $N(G)$ be the set of its conjugacy class sizes excluding~$1$. Let us define a directed graph $\Gamma(G)$, the set of vertices of this graph is $N(G)$ and the vertices $x$ and $y$ are connected by a directed…

The n-string braid group of a graph X is defined as the fundamental group of the n-point configuration space of the space X. This configuration space is a finite dimensional aspherical space. A. Abrams and R. Ghrist have conjectured that…

In this article, we explore the problem of determining isomorphisms between the twisted complex group algebras of finite $p$-groups. This problem bears similarity to the classical group algebra isomorphism problem and has been recently…

We study the conjugacy problem in cyclic extensions of free groups. It is shown that the conjugacy problem is solvable in split extensions of finitely generated free groups by virtually inner automorphisms. An algorithm for construction of…

We prove that any large even Artin group is poly-free and that any even Artin group based on a triangle graph is also poly-free.