We answer a question due to A. Myasnikov by proving that all expected ranks occur as the ranks of intersections of finitely generated subgroups of free groups.
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 ascending HNN extensions of free groups. We also give a sufficient condition for the failure of the FGIP in the context of relative hyperbolicity, we apply this to free-by-cyclic groups of exponential growth.
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 bijection between subgroups and a certain type of such enriched automata, which - as it happens in the free group - is computable in the finitely generated case. This approach provides a neat geometric description of (even non finitely generated) intersections of finitely generated subgroups within this non-Howson family. In particular, we give a geometric s…
The finitely generated intersection property in fundamental groups of graphs of groups
Universitat Politècnica de Catalunya - BarcelonaTech (UPC)(加泰罗尼亚理工大学);Instituto de Ciencias Matemáticas (ICMAT)(数学科学研究所);University of the Basque Country - EHU(巴斯克大学);Harish-Chandra Research Institute, A CI of HBNI(哈里什-钱德拉研究所);CNRS, ReLaX, IRL 2000, Siruseri, India(法国国家科学研究中心,ReLaX);CNRS, Univ. Sorbonne Paris Nord, LIPN, UMR 7030, F-93430 Villetaneuse, France(法国国家科学研究中心,索邦巴黎北大学,LIPN)
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. This result was previously known only in the case where $A$ or $B$ is cyclic by the $w$-cycles theorem of Helfer and Wise and, independently, Louder and Wilton. In order to prove our main theorem, we introduce new results regarding the structure of fibre products of finite graphs. We work with a generalised definition of graph immersions so that our results…
An algebra has the Howson property if the intersection of any two finitely generated subalgebras is finitely generated. A simple necessary and sufficient condition is given for the Howson property to hold on an inverse semigroup with finitely many idempotents. In addition, it is shown that any monogenic inverse semigroup has the Howson property.
We study graphs of (generalized) joins and intersections of finitely generated subgroups of a free group. We show how to disprove a lemma of Imrich and Müller on these graphs and how to repair this lemma.
We show that for every finitely generated closed subgroup $K$ of a non-solvable Demushkin group $G$, there exists an open subgroup $U$ of $G$ containing $K$, and a continuous homomorphism $τ\colon U \to K$ satisfying $τ(k) = k$ for every $k \in K$. We prove that the intersection of a pair of finitely generated closed subgroups of a Demushkin group is finitely generated (giving an explicit bound on the number of generators). Furthermore, we show that these properties of Demushkin groups are preserved under free pro-$p$ products, and deduce that Howson's theorem holds for the Sylow subgroups of …
We solve the subgroup intersection problem (SIP) for any RAAG G of Droms type (i.e., with defining graph not containing induced squares or paths of length 3): there is an algorithm which, given finite sets of generators for two subgroups H,K of G, decides whether $H \cap K$ is finitely generated or not, and, in the affirmative case, it computes a set of generators for $H \cap K$. Taking advantage of the recursive characterization of Droms groups, the proof consists in separately showing that the solvability of SIP passes through free products, and through direct products with free-abelian grou…
We show that a finite collection of stable subgroups of a finitely generated group has finite height, finite width and bounded packing. We then use knowledge about intersections of conjugates to characterize finite families of quasimorphisms on hyperbolically embedded subgroups that can be to simultaneously extended to the ambient group.
We study the intersection of finitely generated factor-free subgroups of free products of groups by utilizing the method of linear programming. For example, we prove that if $H_1$ is a finitely generated factor-free noncyclic subgroup of the free product $G_1 * G_2$ of two finite groups $G_1$, $G_2$, then the WN-coefficient $σ(H_1)$ of $H_1$ is rational and can be computed in exponential time in the size of $H_1$. This coefficient $σ(H_1)$ is the minimal positive real number such that, for every finitely generated factor-free subgroup $H_2$ of $G_1 * G_2$, it is true that $\bar {\rm r} (H_1, H…
We study the intersection of finitely generated subgroups of free groups by utilizing the method of linear programming. We prove that if $H_1$ is a finitely generated subgroup of a free group $F$, then the WN-coefficient $σ(H_1)$ of $H_1$ is rational and can be computed in deterministic exponential time in the size of $H_1$. This coefficient $σ(H_1)$ is the minimal nonnegative real number such that, for every finitely generated subgroup $H_2$ of $F$, it is true that $\bar {\rm r}(H_1, H_2) \le σ(H_1) \bar {\rm r}(H_1) \bar {\rm r}(H_2)$, where $\bar{ {\rm r}} (H) := \max ( {\rm r} (H)-1,0)$ is…
We study the Furstenberg-entropy realization problem for stationary actions. It is shown that for finitely supported probability measures on free groups, any a-priori possible entropy value can be realized as the entropy of an ergodic stationary action. This generalizes results of Bowen. The stationary actions we construct arise via invariant random subgroups (IRSs), based on ideas of Bowen and Kaimanovich. We provide a general framework for constructing a continuum of ergodic IRSs for a discrete group under some algebraic conditions, which gives a continuum of entropy values. Our tools apply …
The residual closure of a subgroup $H$ of a group $G$ is the intersection of all virtually normal subgroups of $G$ containing $H$. We show that if $G$ is generated by finitely many cosets of $H$ and if $H$ is commensurated, then the residual closure of $H$ in $G$ is virtually normal. This implies that separable commensurated subgroups of finitely generated groups are virtually normal. A stream of applications to separable subgroups, polycyclic groups, residually finite groups, groups acting on trees, lattices in products of trees and just-infinite groups then flows from this main result.
Pullbacks and intersections in categories of graphs of groups
Universitat Politècnica de Catalunya - BarcelonaTech (UPC)(加泰罗尼亚理工大学);Instituto de Ciencias Matemáticas (ICMAT)(数学科学研究所);University of the Basque Country - EHU(巴斯克大学);Harish-Chandra Research Institute, A CI of HBNI(哈里什-钱德拉研究所);CNRS, ReLaX, IRL 2000(法国国家科学研究中心);CNRS, Univ. Sorbonne Paris Nord, LIPN, UMR 7030(法国国家科学研究中心)
We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of finitely generated groups with decidable word problem.
We give upper bounds, linear in rank, to the topological dimensions of the Gromov boundaries of the intersection graph, the free factor graph and the cyclic splitting graph of a finitely generated free group.