Average-case complexity of the Whitehead problem for free groups
From MaRDI portal
Publication:5879445
DOI10.1080/00927872.2022.2113791OpenAlexW4293249019MaRDI QIDQ5879445
Publication date: 1 March 2023
Published in: Communications in Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.01366
Complexity of computation (including implicit computational complexity) (03D15) Automorphism groups of groups (20F28) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On two-generator subgroups in \(\mathrm{SL}_2(\mathbb{Z})\), \(\mathrm{SL}_2(\mathbb{Q})\), and \(\mathrm{SL}_2(\mathbb{R})\)
- Average-case complexity and decision problems in group theory.
- Sublinear time algorithms in the theory of groups and semigroups.
- Generic properties of Whitehead's algorithm and isomorphism rigidity of random one-relator groups.
- The class of groups all of whose subgroups with lesser number of generators are free is generic
- Generic-case complexity, decision problems in group theory, and random walks.
- Automorphic orbits in free groups.
- A remark on Whitehead's cut-vertex lemma
- Densities in free groups and \(\mathbb{Z}^k\), visible points and test elements.
- Counting words of minimum length in an automorphic orbit.
- On equivalent sets of elements in a free group
- Growth of primitive elements in free groups
- Growth and ergodicity of context-free languages
- Fast Pattern Matching in Strings
This page was built for publication: Average-case complexity of the Whitehead problem for free groups
