[Paper Review] On Systems of Equations over Free Partially Commutative Groups

Montserrat Casals‐Ruiz, Ilya Kazachkov|ArXiv.org|Oct 27, 2008

Geometric and Algebraic Topology42 references4 citations

TL;DR

This paper presents an effective parametrization of the solution set of systems of equations over partially commutative groups (right-angled Artin groups) using an analogue of Makanin-Razborov diagrams. By reducing equations to constrained generalized equations over free groups and constructing a finite solution tree, the authors provide a complete, algorithmic description of Hom(G, G) for finitely generated groups G, extending the Makanin-Razborov method to the setting of free partially commutative groups.

ABSTRACT

Version 2: Corrected Section 3.3: instead of lexicographical normal forms we now use a normal form due to V. Diekert and A. Muscholl. Consequent changes made and some misprints corrected. Using an analogue of Makanin-Razborov diagrams, we give an effective description of the solution set of systems of equations over a partially commutative group (right-angled Artin group) $G$. Equivalently, we give a parametrisation of $Hom(H, G)$, where $H$ is a finitely generated group.

Motivation & Objective

• To develop an effective algorithmic description of the solution set of systems of equations over partially commutative groups.
• To generalize the Makanin-Razborov method from free groups to right-angled Artin groups (free partially commutative groups).
• To provide a parametrization of the set of homomorphisms from a finitely generated group G to a partially commutative group G.
• To establish a finite tree structure (the solution tree) that captures all minimal solutions and their extensions.
• To prove that the solution set is fully residually G-discriminated and decidable in this setting.

Proposed method

• Reduction of systems of equations over a partially commutative group G to constrained generalized equations over a free group via DM-normal forms and monoid decompositions.
• Construction of a tree T(Ω) of generalized equations using elementary and derived transformations to track solution structures.
• Identification of minimal solutions through a finite subtree T₀(Ω) that captures all essential solution types.
• Decomposition of the solution space using a solution tree T_sol(Ω) built from coordinate groups and extension/decimation trees T_dec and T_ext.
• Use of graph products and homomorphisms from auxiliary graphs Π_v to the commutation graph of G to classify solution types.
• Application of group-theoretic techniques such as centralizers, commutativity relations, and residual properties to ensure finiteness and correctness of the parametrization.

Experimental results

Research questions

• RQ1 Can the solution set of systems of equations over a partially commutative group be effectively parametrized?
• RQ2 Is there a finite tree structure analogous to Makanin-Razborov diagrams that captures all solutions over right-angled Artin groups?
• RQ3 How can the set of homomorphisms from a finitely generated group G to a partially commutative group G be described in terms of parameters?
• RQ4 What is the role of minimal solutions and periodic structures in the solution space of such equations?
• RQ5 Can the solution tree be constructed algorithmically and used to determine decidability of the existence of solutions?

Key findings

• The solution set of any system of equations over a partially commutative group G is parametrized by a finite tree T_sol(Ω), which provides a complete and effective description of Hom(G, G) for finitely generated G.
• The solution tree T_sol(Ω) is constructed from a finite subtree T₀(Ω) of minimal solutions and extended via the decomposition and extension trees T_dec and T_ext.
• The coordinate groups G_R(Ω*) associated with the system are fully residually G-discriminated, meaning they embed into a limit group over G.
• For a specific example with commutation graph a path of length 3, the paper constructs a coordinate group G_w6 whose commutation graph is a path of length 4, showing the method's consistency and structure-preservation.
• The method correctly distinguishes between systems with empty solution sets (e.g., Ω_v) and those with non-empty solutions (e.g., Ω_v*), even when the underlying generalized equation has no solution.
• The parametrization is algorithmic and finite, proving that the existential theory of partially commutative groups is decidable in this context.