The central tree property and algorithmic problems on subgroups of free groups
From MaRDI portal
Publication:6611934
DOI10.1515/JGTH-2023-0050zbMATH Open1548.2005MaRDI QIDQ6611934
Enric Ventura Capell, P. Weil, Mallika Roy
Publication date: 27 September 2024
Published in: Journal of Group Theory (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) 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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Topology of finite graphs
- An almost optimal algorithm for unbounded searching
- The class of groups all of whose subgroups with lesser number of generators are free is generic
- Über unendliche diskontinuierliche Gruppen.
- Stallings foldings and subgroups of free groups
- Counting primitive elements in free groups
- Generic properties of subgroups of free groups and finite presentations
- A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS
- ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM
- CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA
- A list of applications of Stallings automata
- On Certain Sets of Elements in a Free Group
- Average-case complexity of the Whitehead problem for free groups
- On equivalent sets of elements in a free group.
- Die Isomorphismen der allgemeinen, unendlichen Gruppe mit zwei Erzeugenden.
This page was built for publication: The central tree property and algorithmic problems on subgroups of free groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611934)
