Computing equations for residually free groups.
From MaRDI portal
algorithmsfinitely generated subgroupsfinitely presented groupsfinite products of limit groupsresidually free quotient groups
Residual properties and generalizations; residually finite groups (20E26) Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Hyperbolic groups and nonpositively curved groups (20F67) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Abstract: We show that there is no algorithm deciding whether the maximal residually free quotient of a given finitely presented group is finitely presentable or not. Given a finitely generated subgroup G of a finite product of limit groups, we discuss the possibility of finding an explicit set of defining equations (i.e. of expressing G as the maximal residually free quotient of an explicit finitely presented group).
Recommendations
Cites work
- scientific article; zbMATH DE number 2221701 (Why is no real title available?)
- Algebraic geometry over groups. I: Algebraic sets and ideal theory
- Combinatorial group theory.
- Diophantine geometry over groups. I: Makanin-Razborov diagrams
- EXPONENTIAL GROUPS 2: EXTENSIONS OF CENTRALIZERS AND TENSOR COMPLETION OF CSA-GROUPS
- Enumerating limit groups.
- Hall's theorem for limit groups.
- Irreducible affine varieties over a free group. II: Systems in triangular quasi-quadratic form and description of residually free groups
- On Some Groups which cannot be Finitely Presented
- Structure and finiteness properties of subdirect products of groups
- Subgroups of direct products of limit groups.
Cited in
(3)
This page was built for publication: Computing equations for residually free groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q716393)