Related papers: A graph-theoretic proof for Whitehead's second fre…

The fundamental group of a finite graph of groups with trivial edge groups is a free product. We are interested in those outer automorphisms of such a free product that permute the conjugacy classes of the vertex groups. We show that in…

A travel groupoid is an algebraic system related with graphs. In this paper, we give an algorithm to construct smooth travel groupoids for any finite graph. This algorithm gives an answer of L.~Nebesk$\acute{\mbox{y}}$'s question, "Does…

A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…

We show that diagram groups can be viewed as fundamental groups of spaces of positive paths on directed 2-complexes (these spaces of paths turn out to be classifying spaces). Thus diagram groups are analogs of second homotopy groups,…

There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…

A graph $G$ admiting a $2$-factor is \textit{pseudo $2$-factor isomorphic} if the parity of the number of cycles in all its $2$-factors is the same. In [M. Abreu, A.A. Diwan, B. Jackson, D. Labbate and J. Sheehan. Pseudo $2$-factor…

Let G be a right-angled Artin group. We use geometric methods to compute a presentation of the subgroup H of Aut(G) consisting of the automorphisms that send each generator to a conjugate of itself. This generalizes a result of McCool on…

For a finite connected graph $\mathcal{E}$ with set of edges $E$, a finite $E$-generated group $G$ is constructed such that the set of relations $p=1$ satisfied by $G$ (with $p$ a word over $E\cup E^{-1}$) is closed under deletion of…

We expand the dictionary between the action of a torus homeomorphism on the fine curve graph and its rotation set. More precisely, we show that the fixed points at infinity of a loxodromic element determine the rotation set up to scale. A…

We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are…

Let $X$ be a proper algebraic scheme over an algebraically closed field. We assume that a torus $T$ acts on $X$ such that the action has isolated fixed points. The $T$-graph of $X$ can be defined using the fixed points and the one…

Autostackability for finitely generated groups is defined via a topological property of the associated Cayley graph which can be encoded in a finite state automaton. Autostackable groups have solvable word problem and an effective inductive…

Let F_n denote the free group generated by n letters. The purpose of this article is to show that Hol(F_2), the holomorph of the free group on two generators, is linear. Consequently, any split group extension of F_2 by a linear group H is…

In this paper, we briefly review some of the known results concerning the cohomological structures of the mapping class group of surfaces, the outer automorphism group of free groups, the diffeomorphism group of surfaces as well as various…

The Whitehead Model of free groups can be used to measure the complexity, or degree, of automorphisms of free groups. The bound for the degree of the $f \circ g$ for deg$(f) =$ deg($g) = 0$ had previously been discovered. We extend this…

This paper continues our investigation into the question of when a homotopy $\omega = \{\omega_t\}_{t \in [0,1]}$ of 2-cocycles on a locally compact Hausdorff groupoid $\mathcal{G}$ gives rise to an isomorphism of the $K$-theory groups of…

We automatically verify the crucial steps in the original proof of correctness of an algorithm which, given a geometric graph satisfying certain additional properties removes edges in a systematic way for producing a connected graph in…

Takahasi and Higman independently proved that any ascending chain of subgroups of constant rank in a free group must stabilize. Kapovich and Myasnikov gave a proof of this fact in the language of graphs and Stallings folds. Using profinite…

A combinatorial summation identity over the lattice of labelled hypertrees is established that allows one to gain concrete information on the Euler characteristics of various automorphism groups of free products of groups.

$2$-stratifolds are a generalization of $2$-manifolds that occur as objects in applications such as in TDA. These spaces can be described by an associated bicoloured labelled graph. In previous papers we obtained a classification of…