Office: Weber 106
Phone: (970) 491-4288
Website: http://www.math.colostate.edu/~hulpke/
Google Scholar: https://scholar.google.com/citations?user=7LBTkb8AAAAJ&hl=en&oi=ao
Education
- Dr. rer. nat, RWTH Aachen, Germany, 1996
- Diploma in Mathematics, RWTH Aachen, Germany, 1993
About

Publications
- Proving infinite index for a subgroup of matrices AMS.
- The perfect groups of order up to two million Math. Comp..
- Universal covers of finite groups Journal of Algebra, 2021.
- Experimenting with Symplectic Hypergeometric Monodromy Groups Experimental Mathematics.
- The strong approximation theorem and computing with linear groups Journal of Algebra, 2019.
- Algorithms for Experimenting with Zariski Dense Subgroups Experimental Mathematics, 2018.
- Calculating Subgroups with GAPGroup Theory and Computation Springer Singapore, 2018.
- Constructing Groups of ‘Small’ Order: Recent Results and Open ProblemsAlgorithmic and Experimental Methods in Algebra, Geometry, and Number Theory Springer International Publishing, 2018.
- Constructive Membership Tests in Some Infinite Matrix GroupsProceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation - ISSAC '18 ACM Press, 2018.
- Finding intermediate subgroups Portugaliae Mathematica, 3, 2018.
- Imprimitive permutations in primitive groups Journal of Algebra, 2017.
- Zariski density and computing in arithmetic groups Mathematics of Computation, 310, 2017.
- Connected quandles and transitive groups J. Pure Appl. Algebra, 2, 2016.
- GAP, 4.8.5 The GAP Group.
- Translating MAGMA code to GAP Computeralgebra Rundbrief, 2016.
- Algorithms for arithmetic groups with the congruence subgroupproperty J. Algebra, 2015.
- Aristotle’s problem Beitr. Algebra Geom., 2, 2015.
- Constructing All Composition Series of a Finite GroupProceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation ACM, 2015.
- Software for groups: theory and practiceMathematical software—ICMS 2014 Springer, Heidelberg, 2014.
- Calculation of the subgroups of a trivial-fitting groupISSAC 2013—Proceedings of the 38th InternationalSymposium on Symbolic and Algebraic Computation ACM, New York, 2013.
- Computing conjugacy classes of elements in matrix groups J. Algebra, 2013.
- Computing generators of groups preserving a bilinear form over residue class rings J. Symbolic Comput., 2013.
- All finite generalized tetrahedron groups IIComputational and combinatorial group theory and cryptography Amer. Math. Soc., Providence, RI, 2012.
- Computing Hall subgroups of finite groups LMS J. Comput. Math., 2012.
- The number of Latin squares of order 11 Math. Comp., 274, 2011.
- The Tits alternative for short generalized tetrahedron groups Sci. Ser. A Math. Sci. (N.S.), 2011.
- An Introduction to Computational Group Theory Oberwolfach Reports, 2010.
- Polytopes derived from sporadic simple groups Contrib. Discrete Math., 2, 2010.
- All finite generalized tetrahedron groups Algebra Colloq., 4, 2008.
- Normalizer calculation using automorphismsComputational group theory and the theory of groups Amer. Math. Soc., Providence, RI, 2008.
- The Tits alternative for spherical generalized tetrahedron groups Algebra Colloq., 4, 2008.
- Finite Geometries, Groups, and Computation Walter de Gruyter, 2006.
- Constructing transitive permutation groups J. Symbolic Comput., 1, 2005.
- On orbifold coverings by genus 2 surfaces Sci. Ser. A Math. Sci. (N.S.), 2005.
- Efficient simple groups Comm. Algebra, 10, 2003.
- GAPComputer algebra handbook. Foundations, applications, systems. Springer, 2003.
- Total ordering on subgroups and cosetsProceedings of the 2003 International Symposium on Symbolic and Algebraic Computation ACM, New York, 2003.
- Efficient simple groups Comm. Algebra, 2, 2002.
- Efficient simple groups Comm. Algebra, 9, 2002.
- Computing the maximal subgroups of a permutation group. IGroups and computation, III (Columbus, OH, 1999) de Gruyter, Berlin, 2001.
- Short presentations for three-dimensional unitary groups J. Algebra, 2, 2001.
- Representing Subgroups of Finitely Presented Groups by Quotient Subgroups Experimental Mathematics, 3, 2001.
- Conjugacy classes in finite permutation groups via homomorphic images Math. Comp., 232, 2000.
- Computing subgroups invariant under a set of automorphisms J. Symbolic Comput., 4, 1999.
- Construction of $Co_3$. An example of the use of an integrated system for computational group theory!!!Groups St. Andrews 1997 in Bath, II Cambridge Univ. Press, Cambridge, 1999.
- Galois groups through invariant relationsGroups St. Andrews 1997 in Bath, II Cambridge Univ. Press, Cambridge, 1999.
- Techniques for the computation of Galois groupsAlgorithmic algebra and number theory (Heidelberg, 1997) Springer, Berlin, 1999.
- Computing normal subgroupsProceedings of the 1998 International Symposium on Symbolic and Algebraic Computation (Rostock) ACM, New York, 1998.
- On transitive permutation groups LMS J. Comput. Math., 1998.
- Block Systems of a Galois Group Experimental Mathematics, 1, 1995.