2 papers
math.GR2025
The average-case complexity of the Word Problem for groups of matrices over is linear
Frédérique Bassino, Cyril Nicaud, Pascal Weil
We show that the Word Problem in finitely generated subgroups of can be solved in linear average-case complexity. This is done under the bit-complexity…
math.GR2023
Random generation of subgroups of the modular group with a fixed isomorphism type
Frédérique Bassino, Cyril Nicaud, Pascal Weil
We show how to efficiently count and generate uniformly at random finitely generated subgroups of the modular group of a given isomorphism type. The me…