Intersection problem for Droms RAAGs
Visualitza/Obre
Cita com:
hdl:2117/121358
Tipus de documentArticle
Data publicació2018-01-01
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement 3.0 Espanya
ProjecteMETODOS GEOMETRICOS EN TEORIA DE GRUPOS (AEI-MTM2017-82740-P)
METODOS GEOMETRICOS EN TEORIA DE GRUPOS (MICINN-MTM2011-25955)
METODOS GEOMETRICOS EN TEORIA DE GRUPOS (MICINN-MTM2011-25955)
Abstract
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 HnK is finitely generated or not, and, in the affirmative case, it computes a set of generators for HnK. 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 groups. We note that most of RAAGs are not Howson, and many (e.g. F_2 x F_2) even have unsolvable SIP.
CitacióDelgado, J., Ventura, E., Zakharov, A. Intersection problem for Droms RAAGs. "International journal of algebra and computation", 1 Gener 2018, vol. 28, núm. 7, p. 1129-1162.
ISSN0218-1967
Versió de l'editorhttps://www.worldscientific.com/doi/abs/10.1142/S0218196718500509
Altres identificadorshttps://arxiv.org/abs/1709.01155
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Droms_SIP.pdf | 610,3Kb | Visualitza/Obre |