Ross Hall, Room 202
1000 E. University Ave.
Laramie, WY 82071
Research interests: p-ranks, Oviods and Spreads, Projective Planes and Generalized Polygons, Double Covers of Graphs, Loops, Quantum Information and Computation, Nets and Webs, Algebraic Graph Theory
Department of Mathematics
University of Wyoming
Ross Hall 216
Ph.D., University of Toronto, 1987
M.Sc., University of Toronto, 1984
B.Sc., University of Toronto, 1980
Eric Moorhouse majored in physics, statistics and mathematics at the University of Toronto, and completed his PhD in mathematics there in 1987, specializing in finite geometry. Since then his mathematical interests have included projective geometry, codes and designs, non-associative structures, algebraic combinatorics, and information theory. He tries to use a variety of tools, both experimental (practical programming with computers) and theoretical (methods from group theory, algebraic geometry, number theory and mathematical logic). He loves teaching at all levels of the mathematics curriculum, both graduate and undergraduate.
Moorhouse, G. Eric and Penttila, Tim, ‘Groups of projective planes with differing numbers of point and line orbits’, to appear in Journal of Algebra.
Moorhouse, G. Eric, ‘Codes of nets and projective planes’, pp.207–216 in: Error-Correcting Codes, Finite Geometries and Cryptography, ed. A. Bruen and D. Wehlau, Contemporary Mathematics 523, American Mathematical Society, Providence RI, 2010.
Moorhouse, G. Eric, ‘Approaching some problems in finite geometry through algebraic geometry’, pp. 285–296 in Algorithmic Algebraic Combinatorics and Gröbner Bases, ed. G. Jones, A. Jurišić, M. Muzychuk and I. Ponomarenko, Springer-Verlag, Berlin, 2009.
Moorhouse, G. Eric, ‘On projective planes of order less than 32’, pp.149–162 in Finite Geometries, Groups, and Computation, ed. A. Hulpke et. al.; de Gruyter, Berlin, 2006.
Moorhouse, G. Eric, ‘Ovoids and translation planes from lattices’, pp.123–134 in Mostly Finite Geometries, ed. N.L. Johnson, Marcel Dekker, 1997.