Related papers: Graphs, free groups and the Hanna Neumann conjectu…
We show that finitely generated mapping tori of free groups have a canonical collection of maximal sub-mapping tori of finitely generated free groups with respect to which they are relatively hyperbolic and locally relatively quasi-convex.…
Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. In the present paper we employ the…
In this paper, using the notions graphs, core graphs, immersions and covering maps of graphs, introduced by Stallings in 1983, we prove the Burnside condition for the intersection of subgroups of free groups with Burnside condition.
Building on the previous extensive study of Yang, Gould and the present author, we provide a more precise insight into the group-theoretical ramifications of the word problem for free idempotent generated semigroups over finite biordered…
Let $F$ be a finitely generated free group. By using Bestvina-Handel theory, as well as some further improvements, the eigengroups of a given automorphism of $F$ (and its fixed subgroup among them) are globally analyzed and described. In…
The theory of covering spaces is often used to prove the Nielsen-Schreier theorem, which states that every subgroup of a free group is free. We apply the more general theory of semicovering spaces to obtain analogous subgroup theorems for…
We show that counterexamples of Iyengar and Walker to the algebraic version of Gunnar Carlsson's conjecture on the rank of the homology of a free complex can be extended to examples over any finite group with many choices of the complex.
In this paper we prove that the Morse boundary of a free product depends only on the Morse boundary of its factors. In fact, we also prove the analogous result for graphs of groups with finite edge groups and infinitely many ends. This is a…
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…
We show that the free group of rank 2 is a limit of 2-markings of Thompson's group F in the space of all 2-marked groups. More specifically, we find a sequence of generating pairs for F so that as one goes out the sequence, the length of…
The explicit description of the topology of the free product of topological groups being Hausdorff is given. In particular, it is shown that it coincides with the so-called $X_0$-topology for the corresponding colimit $X$ in the category of…
For several natural filtrations of a free group S we express the n-th term of the filtration as the intersection of all kernels of homomorphisms from S to certain groups of upper-triangular unipotent matrices. This generalizes a classical…
Free fermions on Hamming graphs $H(d,q)$ are considered and the entanglement entropy for two types of subsystems is computed. For subsets of vertices that form Hamming subgraphs, an analytical expression is obtained. For subsets…
This is a new and short proof of the main theorem of classical structure tree theory. Namely, we show the existence of certain automorphism-invariant tree-decompositions of graphs based on the principle of removing finitely many edges. This…
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…
By studying the commuting graphs of conjugacy classes of the sequence of Heisenberg groups $H_{2n+1}(p)$ and their limit $H_\infty(p)$ we find pseudo-random behavior (and the random graph in the limiting case). This makes a nice case study…
We define a free product of connected simple graphs that is equivalent to several existing definitions when the graphs are vertex-transitive but differs otherwise. The new definition is designed for the automorphism group of the free…
We study the limit theory of large threshold graphs and apply this to a variety of models for random threshold graphs. The results give a nice set of examples for the emerging theory of graph limits.
The main result in this paper is the failure of the finitely generated intersection property (FGIP) of ascending HNN extensions of non-cyclic finite rank free groups. This class of group consists of free-by-cyclic groups and properly…
The \emph{difference subgroup graph} $D(G)$ of a finite group $G$ is defined as the graph whose vertices are the non-trivial proper subgroups of $G$, with two distinct vertices $H$ and $K$ adjacent if and only if $\langle H, K \rangle = G$…