Intersection problem for Droms RAAGs

DOI10.1142/S0218196718500509MaRDI QIDQ4554881zbMATH OpenWikidataFDO

Authors

Publication date 12 November 2018

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1709.01155

zbMATH Keywords

direct productDroms groupfinite generationfree productintersection problempartially commutative groupright-angled Artin group

Mathematics Subject Classification ID

Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Braid groups; Artin groups (20F36)

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 $HcapK$ is finitely generated or not, and, in the affirmative case, it computes a set of generators for $HcapK$. 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.

Recommendations

• Subgroups of direct products of limit groups over droms RAAGs
• On the Bieri-Neumann-Strebel-Renz invariants and limit groups over Droms RAAGs
• scientific article; zbMATH DE number 2144681
• Intersections of finitely generated free groups
• Intersection of finitely generated surface groups

Cites work

• Algorithmic problems for free-Abelian times free groups.
• Algorithms and geometry for graph products of groups
• An introduction to right-angled Artin groups.
• Characterizations of the decidability of some problems for regular trace languages
• Efficient solution of some problems in free partially commutative monoids
• Fixed points of endomorphisms of graph groups.
• FOLDINGS, GRAPHS OF GROUPS AND THE MEMBERSHIP PROBLEM
• Graph groups are biautomatic
• Graph groups, coherence, and three-manifolds
• scientific article; zbMATH DE number 3138253 (Why is no real title available?)
• scientific article; zbMATH DE number 4136215 (Why is no real title available?)
• scientific article; zbMATH DE number 2221703 (Why is no real title available?)
• INTERSECTING FREE SUBGROUPS IN FREE PRODUCTS OF GROUPS
• Intersections of Finitely Generated Subgroups in Free Products
• Isomorphisms of Graph Groups
• On the Intersection of Finitely Generated Free Groups
• ON THE INTERSECTION OF FINITELY GENERATED SUBGROUPS IN FREE PRODUCTS OF GROUPS
• On the Kurosh rank of the intersection of subgroups in free products of groups.
• Quasi-threshold graphs
• Stallings foldings and subgroups of free groups
• Subgroups of graph groups
• The Comparability Graph of a Tree
• THE OCCURRENCE PROBLEM FOR FREE PRODUCTS OF GROUPS
• The submonoid and rational subset membership problems for graph groups.
• The word problem for free partially commutative groups
• Topology of finite graphs

Cited in

(2)

• Free idempotent generated semigroups: the word problem and structure via gain graphs
• Stallings automata for free-times-abelian groups: intersections and index

This page was built for publication: Intersection problem for Droms RAAGs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4554881)