GROUP EXTENSIONS OVER INFINITE WORDS

DOI10.1142/S0129054112400424zbMATH Open1262.68088arXiv1011.2024OpenAlexW2963595733MaRDI QIDQ4902890FDOQ4902890

Authors: Volker Diekert, Alexei Myasnikov 

Publication date: 18 January 2013

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Abstract: We construct an extension $E(A,G)$ of a given group $G$ by infinite non-Archimedean words over an discretely ordered abelian group like $Z^n$. This yields an effective and uniform method to study various groups that "behave like $G$". We show that the Word Problem for f.g. subgroups in the extension is decidable if and only if and only if the Cyclic Membership Problem in $G$ is decidable. The present paper embeds the partial monoid of infinite words as defined by Myasnikov, Remeslennikov, and Serbin (Contemp. Math., Amer. Math. Soc., 378:37-77, 2005) into $E(A,G)$. Moreover, we define the extension group $E(A,G)$ for arbitrary groups $G$ and not only for free groups as done in previous work. We show some structural results about the group (existence and type of torsion elements, generation by elements of order 2) and we show that some interesting HNN extensions of $G$ embed naturally in the larger group $E(A,G)$.

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

Recommendations

• Solving word problems in group extensions over infinite words
• scientific article; zbMATH DE number 4140052
• Symmetry groups of infinite words
• Strictly verbal extensions of groups
• Sequences of symmetry groups of infinite words
• scientific article; zbMATH DE number 556508
• scientific article; zbMATH DE number 4177356
• On infinite groups
• Classes of universal words for the infinite symmetric groups
• Some combinatorial properties of infinite words and applications to semigroup theory

zbMATH Keywords

discrete groupsinfinite wordsconfluent rewriting systemsnon-Archimedean words

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Combinatorics on words (68R15)

Cites Work

• Elementary theory of free non-abelian groups.
• Subgroups of small Cancellation Groups
• The origins of combinatorics on words
• Logic and rational languages of words indexed by linear orderings
• Solving word problems in group extensions over infinite words
• ON SOME ALGORITHMIC PROPERTIES OF HYPERBOLIC GROUPS

Cited In (5)

• Title not available (Why is that?)
• Infinite words and universal free actions.
• Strictly verbal extensions of groups
• INFINITE WORDS AND CONFLUENT REWRITING SYSTEMS: ENDOMORPHISM EXTENSIONS
• Solving word problems in group extensions over infinite words

This page was built for publication: GROUP EXTENSIONS OVER INFINITE WORDS

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