Go to the content (press return)

On algorithmic recognition of certain classes of groups

Delgado, J.; Cavallo, B.; Kahrobaei, D.; Ventura, E.
Type of activity
Presentation of work at congresses
Name of edition
Cryptography Student Seminar 2015
Date of publication
Presentation's date
Book of congress proceedings
GC Cryptography Student Seminar 2015
https://sites.google.com/site/gccryptostudents/ Open in new window
I will introduce the standard framework for recognition problems in group theory, then move to a more specific setting: namely group extensions by infinite cyclic groups. For this family, I will review some folklore facts and previous partial results which we use to provide an argument that implies the undecidability of the BNS invariant (a nice geometrical invariant on which I would also like to say a few words).
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications
GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics


  • Delgado Rodriguez, Jorge  (author and speaker )
  • Cavallo, Bren  (author and speaker )
  • Kahrobaei, Delaram  (author and speaker )
  • Ventura Capell, Enric  (author and speaker )