Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
Algorithms for Finite Group Epimorphism Testing
Joshua A. Grochow, Pranjal Srivastava, Dhara Thakkar
The Group Epimorphism Problem (GpEpi) asks, given two finite groups and , whether there exists a surjective group homomorphism, or epimorphism, from to . When…
cs.DS2025
Complexity of Constructing Minimal Faithful Permutation Representations for Fitting-free Groups
Michael Levet, Pranjal Srivastava, Dhara Thakkar
In this paper, we investigate the complexity of computing minimal faithful permutation representations for groups without abelian normal subgroups (a.k.a. Fitting-free groups). Whe…
cs.DS2024
Approximate counting of permutation patterns
Omri Ben-Eliezer, Slobodan Mitrović, Pranjal Srivastava
We consider the problem of counting the copies of a length- pattern in a sequence , where a copy is a subset of indices $i_1 < \ldots < i_k \in…