Computation with finitely L-presented groups.
algorithmsfinite \(L\)-presentationsfinite index subgroupsfinitely presented groupsinfinite presentationsKnuth-Bendix procedurerecursive presentationsReidemeister-Schreier theoremTodd-Coxeter algorithmword problem
Software, source code, etc. for problems pertaining to group theory (20-04) Subgroup theorems; subgroup growth (20E07) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Derived series, central series, and generalizations for groups (20F14) Symbolic computation and algebraic computation (68W30)
- Coset enumeration for certain infinitely presented groups.
- Algorithms for finitely L-presented groups and their applications to some self-similar groups.
- A Reidemeister-Schreier theorem for finitely L-presented groups.
- Computing subgroup presentations, using the coherence arguments of McCammond and Wise.
- On the difficulty of presenting finitely presentable groups.
- Computing subgroup presentations, using the coherence arguments of McCammond and Wise.
- Some groups with computable Chermak-Delgado lattices.
- A Reidemeister-Schreier theorem for finitely L-presented groups.
- Coset enumeration for certain infinitely presented groups.
- VERIFYING THAT A GROUP IS VIRTUALLY FREE
- Algorithms for finitely L-presented groups and their applications to some self-similar groups.
- On the difficulty of presenting finitely presentable groups.
This page was built for publication: Computation with finitely \(L\)-presented groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5170849)
