Algorithms for Experimenting with Zariski Dense Subgroups | 0 | 0.34 | 2020 |
The strong approximation theorem and computing with linear groups | 0 | 0.34 | 2019 |
Zariski density and computing in arithmetic groups. | 3 | 0.54 | 2018 |
Constructive Membership Tests In Some Infinite Matrix Groups | 0 | 0.34 | 2018 |
Constructing All Composition Series of a Finite Group | 0 | 0.34 | 2015 |
Software for Groups: Theory and Practice. | 0 | 0.34 | 2014 |
Computing generators of groups preserving a bilinear form over residue class rings | 1 | 0.49 | 2013 |
The number of Latin squares of order 11 | 15 | 1.09 | 2011 |
Polytopes derived from sporadic simple groups. | 4 | 0.57 | 2010 |
Constructing transitive permutation groups | 17 | 1.53 | 2005 |
Total ordering on subgroups and cosets | 2 | 0.46 | 2003 |
Representing subgroups of finitely presented groups by quotient subgroups | 0 | 0.34 | 2001 |
Conjugacy classes in finite permutation groups via homomorphic images | 2 | 0.37 | 2000 |
Computing subgroups invariant under a set of automorphisms | 4 | 0.71 | 1999 |
Computing normal subgroups | 6 | 0.82 | 1998 |
Techniques For The Computation Of Galois Groups | 6 | 0.73 | 1997 |
Block Systems of a Galois Group | 4 | 0.55 | 1995 |