kbmag

The kbmag package is a GAP interface to some `C’ programs for running the Knuth-Bendix completion program on finite semigroup, monoid or group presentations, and for attempting to compute automatic structures of finitely presented groups.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 21 articles )

Showing results 1 to 20 of 21.
Sorted by year (citations)

1 2 next

  1. Chalk, Christopher P.: Fibonacci groups (F(2,n)) are hyperbolic for (n) odd and (n\geq11) (2021)
  2. Chinyere, Ihechukwu; Williams, Gerald: Hyperbolic groups of Fibonacci type and T(5) cyclically presented groups (2021)
  3. Holt, Derek F.; Rees, Sarah: Biautomatic structures in systolic Artin groups (2021)
  4. Holt, Derek; Linton, Stephen; Neunhöffer, Max; Parker, Richard; Pfeiffer, Markus; Roney-Dougal, Colva M.: Polynomial-time proofs that groups are hyperbolic (2021)
  5. Aguirre-Guerrero, D.; Ducoffe, G.; Fàbrega, L.; Vilà, P.; Coudert, D.: Low time complexity algorithms for path computation in Cayley graphs (2019)
  6. Kharlampovich, Olga; Miasnikov, Alexei; Weil, Pascal: Stallings graphs for quasi-convex subgroups (2017)
  7. Edjvet, Martin; Swan, Jerry: On irreducible cyclic presentations of the trivial group. (2014)
  8. Marco-Buzunariz, Miguel Angel: A framework for free, finitely presented and braid groups in Sage (2014)
  9. Edjvet, Martin; Spanu, Bruno: On a certain class of cyclically presented groups. (2011)
  10. Swan, Jerry: Efficiency issues in the KBMAG procedure (2011)
  11. Bartholdi, Laurent; Siegenthaler, Olivier: The twisted twin of the Grigorchuk group. (2010)
  12. Cremona, J. E.; Edjvet, M.: Cyclically presented groups and resultants. (2010)
  13. Edjvet, M.; Juhász, A.: The groups (G^m,n,p). (2008)
  14. Hermiller, Susan; Holt, Derek F.; Rees, Sarah: Groups whose geodesics are locally testable. (2008)
  15. Karabáš, Ján; Maličký, Peter; Nedela, Roman: Three-manifolds with Heegaard genus at most two represented by crystallisations with at most 42 vertices (2007)
  16. Payne, Oliver; Rees, Sarah: Computing subgroup presentations, using the coherence arguments of McCammond and Wise. (2006)
  17. Ollivier, Yann: A January 2005 invitation to random groups. (2005)
  18. Epstein, David B. A.; Holt, Derek F.: Efficient computation in word-hyperbolic groups (2000)
  19. Epstein, D. B. A.; Sanders, P. J.: Knuth-Bendix for groups with infinitely many rules (2000)
  20. Holt, Derek F.; Hurt, Darren F.: Computing automatic coset systems and subgroup presentations (1999)

1 2 next