Computing equations for residually free groups.
zbMath1214.20034arXiv0902.2119MaRDI QIDQ716393
Gilbert Levitt, Vincent Guirardel
Publication date: 28 April 2011
Published in: Illinois Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0902.2119
algorithmsfinitely generated subgroupsfinitely presented groupsfinite products of limit groupsresidually free quotient groups
Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Hyperbolic groups and nonpositively curved groups (20F67) Residual properties and generalizations; residually finite groups (20E26)
Cites Work
- Enumerating limit groups.
- Subgroups of direct products of limit groups.
- Algebraic geometry over groups. I: Algebraic sets and ideal theory
- Irreducible affine varieties over a free group. II: Systems in triangular quasi-quadratic form and description of residually free groups
- Combinatorial group theory.
- Diophantine geometry over groups. I: Makanin-Razborov diagrams
- Hall's theorem for limit groups.
- Structure and finiteness properties of subdirect products of groups
- On Some Groups which cannot be Finitely Presented
- EXPONENTIAL GROUPS 2: EXTENSIONS OF CENTRALIZERS AND TENSOR COMPLETION OF CSA-GROUPS
- Unnamed Item
This page was built for publication: Computing equations for residually free groups.