Compressed word problems in HNN-extensions and amalgamated products (Q639849): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971387267 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0811.3303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The word problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4408477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Theorems for Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: EMBEDDING THEOREMS FOR SEMIGROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic-case complexity, decision problems in group theory, and random walks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processing Compressed Texts: A Tractability Border / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word Problems and Membership Problems on Compressed Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation in Groups Via Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theories of HNN-Extensions and Amalgamated Products / rank
 
Normal rank
Property / cites work
 
Property / cites work: RATIONAL SUBSETS IN HNN-EXTENSIONS AND AMALGAMATED PRODUCTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPRESSED WORDS AND AUTOMORPHISMS IN FULLY RESIDUALLY FREE GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group-based cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algorithmic insolvability of the word problem in group theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time word problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5651924 / rank
 
Normal rank

Latest revision as of 13:08, 4 July 2024

scientific article
Language Label Description Also known as
English
Compressed word problems in HNN-extensions and amalgamated products
scientific article

    Statements

    Compressed word problems in HNN-extensions and amalgamated products (English)
    0 references
    0 references
    0 references
    11 October 2011
    0 references
    In the compressed word problem for a group \(G\), the input word over the generators is not given explicitly but succinctly via a so called straight line program. This is a context free grammar that generates exactly one word. For a (base) group \(H\) with two isomorphic subgroups \(A\) and \(B\) and an isomorphism \(\varphi:A\rightarrow B\), the HNN-extension (HNN for Higman, Neumann, and Neumann) is the group \[ G=\langle H,t\mid \forall a \in A : t^{-1}at=\varphi(a)\rangle. \] The subgroups \(A\) and \(B\) are called the associated subgroups. The amalgamated free product of two groups \(H_1\) and \(H_2\) with isomorphic subgroups \(A_1 \leq H_1,A_2 \leq H_2\) and an isomorphism \(\varphi:A_1\rightarrow A_2\), is the group \[ G=\langle H_1\ast H_2\mid \forall a \in A_1 : a=\varphi(a)\rangle. \] Two classical facts about these notions are: (1) a group has more than one end if and only if it is either an HNN-extension with finite associated subgroups or an amalgamated free product with finite identified subgroups [\textit{J. R. Stallings}, Group theory and three-dimensional manifolds.Yale Mathematical Monographs. 4. New Haven-London: Yale University Press (1971; Zbl 0241.57001)]; and (2) a group is virtually free (i.e., has a free subgroup of finite index) if and only if it can be built up from finite groups using amalgamated products with finite identified subgroups and HNN-extensions with finite associated subgroups [\textit{W. Dicks} and \textit{M. J. Dunwoody}, Groups acting on graphs. Cambridge Studies in Advanced Mathematics, 17. Cambridge etc.: Cambridge University Press (1989; Zbl 0665.20001)]. The word problem for an HNN-extension with finite associated groups can be reduced in polynomial time to the word problem of the base group. The main result of the paper is generalizing the above transfer theorem to the compressed word problem (instead of the usual word problem). The authors prove a bit more, in the sense that they consider multiple HNN-extensions: for a base group \(H\) and a natural number \(n\), and partial isomorphisms \(\varphi_i:A\rightarrow B\) for \(i=1,\dots,n\) and for fixed finite subgroups \(A,B \leq H\), the multiple HNN-extension is the group \[ G=\langle H,t_1,\dots,t_n\mid \forall a \in \text{dom}(\varphi_i) \forall i \leq n : t_i^{-1}at_i=\varphi_i(a)\rangle. \] It is also shown that the compressed word problem for an amalgamated free product \[ \langle H_1\ast H_2\mid \forall a \in A_1 : a=\varphi(a)\rangle \] with finite \(A_1\) can be reduced in polynomial time to the compressed word problems of \(H_1\) and \(H_2\).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithms for compressed strings
    0 references
    straight-line programs
    0 references
    word problems for groups
    0 references
    HNN-extensions
    0 references
    0 references
    0 references