The Complexity of Epimorphism Problem with Virtually Abelian and Finite Dihedral Targets

Refreshments will be served at 4:00 PM.

ABSTRACT

Friedl and Loh showed that the epimorphism problem for certain subclasses of virtually abelian targets is decidable. Separately, Kuperberg and Samperton showed that the epimorphism problem from certain 3-manifold groups to finite non-abelian simple groups is NP-hard. In this talk, I will show that the epimorphism problem from finitely presented groups to virtually abelian to the same subclasses of virtually abelian groups is in NP, and to finite non-nilpotent dihedral groups is also NP-hard.

BIOGRAPHY

Jerry Shen is a graduate student at the University of Technology Sydney.

A campus map is available at https://tour.stevens.edu.
Additional information is available at https://web.stevens.edu/algebraic/.

Zoom Link:

https://stevens.zoom.us/j/93228680142 (Password: ACC)