Related papers: On joins and intersections of subgroups in free gr…
We construct an efficient model for graphs of finitely generated subgroups of free groups. Using this we give a very short proof of Dicks's reformulation of the strengthened Hanna Neumann Conjecture as the Amalgamated Graph Conjecture. In…
A conjecture of Imrich and M\"uller on rank of the intersection of subgroups of free groups is disproved.
A new bound for the rank of the intersection of finitely generated subgroups of a free group is given, formulated in topological terms, and very much in the spirit of Stallings. The bound is a contribution to (although unfortunately not a…
The Hanna Neumann conjecture gives a bound on the intersection of finitely generated subgroups of free groups. We explore a natural extension of this result, which turns out to be true only in the finite index case, and provide…
We show that the number of conjugacy classes of intersections $A\cap B^g$, for fixed finitely generated subgroups $A, B<F$ of a free group, is bounded above in terms of the ranks of $A$ and $B$; this confirms an intuition of Walter Neumann.…
We prove an estimate for the rank of the intersection of free subgroups in virtually free groups, which is analogous to the Hanna Neumann inequality for subgroups in a free group and to the S.V. Ivanov estimate for subgroups in free…
We partly generalize the estimate for the rank of intersection of subgroups in free products of groups, proved earlier by S.V.Ivanov and W.Dicks, to the case of free amalgamated products of groups with normal finite amalgamated subgroup. We…
In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…
We introduce the concept of a pants decomposition for a finitely generated free group and construct the corresponding pants graph. A pants decomposition of a free group leads to the formation of a simplicial graph, referred to as the pants…
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…
A conjecture of Dicks and the author on rank of the intersection of factor-free subgroups in free products of groups is proved for the case of left ordered groups.
Understanding the structure of a graph along with the structure of its subgraphs is important for several problems in graph theory. Two examples are the Reconstruction Conjecture and isomorph-free generation. This paper raises the question…
Free groups have many applications in Algebraic Topology. In this paper I specifically study the finitely generated free groups by using the covering spaces and fundamental groups. By the Van Kampen's theorem, we have a famous fact that the…
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…
A group $G$ is said to satisfy the finitely generated intersection property (f.g.i.p.) if the intersection of any two finitely generated subgroups of $G$ is again finitely generated. The aim of this article is to understand when the…
We extend the classical Stallings theory (describing subgroups of free groups as automata) to direct products of free and abelian groups: after introducing enriched automata (i.e., automata with extra abelian labels), we obtain an explicit…
We study inert and compressed subgroups of free groups and provide a generalization of echelon subgroups.
We extend the characterization of context-free groups of Muller and Schupp in two ways. We first show that for a quasi-transitive inverse graph $\Gamma$, being quasi-isometric to a tree, or context-free (finitely many end-cones types), or…
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…
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.…