Name
Abstract | ||
|---|---|---|
We solve the subgroup intersec(t)ion 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 <= G, decides whether H boolean AND K is finitely generated or not, and, in the affirmative case, it computes a set of generators for H boolean AND 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 groups. We note that most of RAAGs are not Howson, and many (e.g. F-2 xF(2)) even have unsolvable SIP. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1142/S0218196718500509 | INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION |
Keywords | Field | DocType |
Partially commutative group, right-angled Artin group, Droms group, intersection problem, finite generation, free product, direct product | Graph,Combinatorics,Free product,Finitely-generated abelian group,Finite set,Algebra,Mathematics,Recursion | Journal |
Volume | Issue | ISSN |
28 | 7 | 0218-1967 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jordi Delgado | 1 | 0 | 0.34 |
| Enric Ventura | 2 | 11 | 3.05 |
| Alexander Zakharov | 3 | 0 | 1.35 |