ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM
From MaRDI portal
Publication:3502844
DOI10.1142/S0218196707004244zbMath1149.20024arXivmath/0608779MaRDI QIDQ3502844
Abdó Roig, Enric Ventura Capell, Pascal Weil
Publication date: 20 May 2008
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0608779
algorithmsfinitely generated subgroupsautomorphismsfree groupsautomorphic orbitsWhitehead minimization problem
Automorphism groups of groups (20F28) Free nonabelian groups (20E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items (20)
On the Generalized Membership Problem in Relatively Hyperbolic Groups ⋮ Stallings automata for free-times-abelian groups: intersections and index ⋮ Hyperbolic surface subgroups of one-ended doubles of free groups ⋮ Vertex links and the Grushko decomposition ⋮ Relative order and spectrum in free and related groups ⋮ Generic properties of subgroups of free groups and finite presentations ⋮ The primitivity index function for a free group, and untangling closed curves on hyperbolic surfaces.With the appendix by Khalid Bou–Rabee ⋮ Primitive words, free factors and measure preservation. ⋮ READING OFF KUROSH DECOMPOSITIONS ⋮ Statistical properties of subgroups of free groups ⋮ AUTOMORPHIC ORBITS IN FREE GROUPS: WORDS VERSUS SUBGROUPS ⋮ A list of applications of Stallings automata ⋮ Subgroups of free groups and primitive elements ⋮ Detecting Fully Irreducible Automorphisms: A Polynomial Time Algorithm ⋮ The monomorphism problem in free groups. ⋮ Computing fixed closures in free groups. ⋮ Volume equivalence of subgroups of free groups. ⋮ TRANSVERSALS AS GENERATING SETS IN FINITELY GENERATED GROUPS ⋮ Immersed cycles and the JSJ decomposition ⋮ Statistics of subgroups of the modular group
Cites Work
- Unnamed Item
- Generic properties of Whitehead's algorithm and isomorphism rigidity of random one-relator groups.
- Topology of finite graphs
- On submodular function minimization
- An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem
- Automorphism group of a free group: Centralizers and stabilizers
- Automorphic orbits in free groups.
- Stallings foldings and subgroups of free groups
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- On equivalent sets of elements in a free group
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- Maximal Flow Through a Network
- On Whitehead’s algorithm
- Heuristics for the Whitehead Minimization Problem
- A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS
This page was built for publication: ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM
