Showing math.GRShow all
3 papers · 1 filter
math.GR2026
Obstruction theory and the complexity of counting group homomorphisms
Eric Samperton, Armin WeiÃ
Fix a finite group . We study the computational complexity of counting problems of the following flavor: given a group , count the number of homomorphisms . Our fir…
math.GR2025
Finite groups with geodetic Cayley graphs
Murray Elder, Adam Piggott, Florian Stober +2
A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups…
math.GR2025
On the complexity of epimorphism testing with virtually abelian targets
Murray Elder, Jerry Shen, Armin WeiÃ
Friedl and Löh (2021, Confl. Math.) prove that testing whether or not there is an epimorphism from a finitely presented group to a virtually cyclic group, or to the direct product…