Hostname: page-component-74656f9884-skzmx Total loading time: 0 Render date: 2026-11-06T06:52:22.730Z Has data issue: false hasContentIssue false

Intersection configurations in free and free times free-abelian groups

Published online by Cambridge University Press:  11 September 2023

J. Delgado
Affiliation:
Departament de Matemàtiques, Universitat Politècnica de Catalunya, and Institut de Matemàtiques de la UPC-BarcelonaTech, Catalonia, Spain (jorge.delgado@upc.edu)
M. Roy
Affiliation:
Departamento de Matemáticas, Universidad del País Vasco (UPV/EHU), Bilbao, Spain (mallikaroy75@gmail.com)
E. Ventura
Affiliation:
Departament de Matemàtiques, Universitat Politècnica de Catalunya, and Institut de Matemàtiques de la UPC-BarcelonaTech, Catalonia, Spain (enric.ventura@upc.edu)
Rights & Permissions [Opens in a new window]

Abstract

In this paper, we study intersection configurations – which describe the behaviour of multiple (finite) intersections of subgroups with respect to finite generability – in the realm of free and free times free-abelian (FTFA) groups. We say that a configuration is realizable in a group $G$ if there exist subgroups $H_1,\ldots, H_k \leqslant G$ realizing it. It is well known that free groups ${\mathbb {F}_{n}}$ satisfy the Howson property: the intersection of any two finitely generated subgroups is again finitely generated. We show that the Howson property is indeed the only obstruction for multiple intersection configurations to be realizable within nonabelian free groups. On the contrary, FTFA groups ${\mathbb {F}_{n}} \times \mathbb {Z}^m$ are well known to be non-Howson. We also study multiple intersections within FTFA groups, providing an algorithm to decide, given $k\geq 2$ finitely generated subgroups, whether their intersection is again finitely generated and, in the affirmative case, compute a ‘basis’ for it. We finally prove that any intersection configuration is realizable in an FTFA group ${\mathbb {F}_{n}} \times \mathbb {Z}^m$, for $n\geq 2$ and large enough $m$. As a consequence, we exhibit finitely presented groups where every intersection configuration is realizable.

Information

Type
Research Article
Copyright
Copyright © The Author(s), 2023. Published by Cambridge University Press on behalf of The Royal Society of Edinburgh
Figure 0

Figure 1. Intersection diagram for $H_1 \cap H_2$.

Figure 1

Figure 2. Intersection diagram for $\bigcap _{j=1}^{k} H_j$.

Figure 2

Figure 3. Intersection diagram for $\bigcap _{j=1}^{k} ( H'_j \circledast H''_j )$.

Figure 3

Figure 4. Lattice of subsets of $[3] = \{1,2,3\}$.

Figure 4

Figure 5. From left to right, a random $3$-configuration, the $\mathsf {0}$ $3$-configuration, and two almost-$\mathsf {0}$ $3$-configurations.

Figure 5

Figure 6. Schematic representation for ${\chi }_{\scriptstyle {\{\{1\},\{1,2\}\}}} \vee {\chi }_{\scriptstyle {\{1,2\}}} ={\chi }_{\scriptstyle {\{\{1\},\{1,2\}\}}}$.

Figure 6

Figure 7. Schematic representation for ${\chi }_{\scriptstyle {\{\{1\},\{1,2\}\}}} \boxplus _1 {\chi }_{\scriptstyle {\{\{1,2\}\}}} = {\chi }_{\scriptstyle {\{\{1\},\{3\},\{1,2\},\{1,2,3\}\}}}$.

Figure 7

Figure 8. Configuration is Howson if and only if it does not contain this pattern (where the snaked arrows denote directed paths, and the black vertex is where both paths first meet).