Embeddability and Universal Theory of Partially Commutative Groups

DOI10.1093/IMRN/RNV122MaRDI QIDQ3466443zbMATH OpenOpenAlexFDO

Authors Montserrat Casals Ruiz

Publication date 1 February 2016

Published in IMRN. International Mathematics Research Notices (Search for Journal in Brave)

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

zbMATH Keywords

embeddabilityextension graphextension graph embedding problempartially commutative groups

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Subgroup theorems; subgroup growth (20E07) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Braid groups; Artin groups (20F36)

Abstract: The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $Gamma$, the authors introduce an infinite, locally infinite graph $Gamm{a}^e$, called the extension graph of $Gamma$. They show that each finite induced subgraph $Delta$ of $Gamm{a}^e$ gives rise to an embedding between the partially commutative groups $G(Delta)$ and $G(Gamma)$. Furthermore, it is proven that in many instances the converse also holds. Our first result is the decidability of the Extension Graph Embedding Problem: there is an algorithm that given two finite simplicial graphs {Delta} and {Gamma} decides whether or not $Delta$ is an induced subgraph of $Gamm{a}^e$. As a corollary we obtain the decidability of the Embedding Problem for 2-dimensional partially commutative groups. In the second part of the paper, we relate the Embedding Problem between partially commutative groups to the model-theoretic question of classification up to universal equivalence. We use our characterisation to transfer algebraic and algorithmic results on embeddability to model-theoretic ones and obtain some rigidity results on the elementary theory of atomic pc groups as well as to deduce the existence of an algorithm to decide if an arbitrary pc group is universally equivalent to a 2-dimensional one.

Recommendations

• Embeddability and quasi-isometric classification of partially commutative groups
• Embeddings between partially commutative groups: two counterexamples.
• Universal theories for partially commutative metabelian groups.
• Corrigendum to: ``Embeddability and universal theory of partially commutative groups
• Partial groupoid embeddings in semigroups
• On embedding of partially commutative metabelian groups to matrix groups
• scientific article; zbMATH DE number 468791
• Universality of group embeddability
• scientific article; zbMATH DE number 4109027
• Universal equivalence of partially commutative metabelian groups.

Cited in

(16)

• Algorithmic problems in right-angled Artin groups: complexity and applications
• Determining the finite subgraphs of curve graphs
• Morphisms between right-angled Coxeter groups and the embedding problem in dimension two
• Subgroups of right-angled Coxeter groups via stallings-like techniques
• Embeddings between partially commutative groups: two counterexamples.
• Embeddability and quasi-isometric classification of partially commutative groups
• scientific article; zbMATH DE number 4175235 (Why is no real title available?)
• Algorithmic decidability of the universal equivalence problem for partially commutative nilpotent groups
• Embeddability of right-angled Artin groups on complements of trees
• Embeddability of right-angled Artin groups on the complements of linear forests
• On embedding of partially commutative metabelian groups to matrix groups
• Right-angled Artin groups and full subgraphs of graphs
• On the elementary theory of graph products of groups
• On embeddings in the class of partially commutative nilpotent groups
• Universal theories for partially commutative metabelian groups.
• Knuth-Bendix completion of theories of commuting group endomorphisms

This page was built for publication: Embeddability and Universal Theory of Partially Commutative Groups

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