G. Eric Moorhouse:

Publications/Errata

Comments/corrections on these publications are welcome by email ().

Ovoids and Lattices
  1. The non-existence of ovoids in O9(q), with Athula Gunawardena, Europ. J. Combinatorics 18 (1997), 171-173.
  2. Ovoids from the E8 root lattice, Geometriae Dedicata 46 (1993), 287-297.
  3. Root lattice constructions of ovoids, in Finite Geometry and Combinatorics, ed. F. De Clerck et. al., pp.269-275, Camb. Univ. Press, Cambridge (1993).
  4. Ovoids and translation planes from lattices, in Mostly Finite Geometries, ed. N. L. Johnson; Marcel Dekker Inc., 1997, pp.123-134.
  5. Fingerprints of r-ary ovoids in O+(8,p) and of their O+(6,p)-slices, technical report, 1999.

p-Ranks of Varieties
  1. Some p-ranks related to orthogonal spaces, with Aart Blokhuis, J. Algebraic Combinatorics 4 (1995), 295-316.
  2. Some p-ranks related to finite geometric structures, in Mostly Finite Geometries, ed. N. L. Johnson; Marcel Dekker Inc., 1997, pp.353-364.
  3. Some p-ranks related to Hermitian varieties, J. Stat. Plan. Inf. 56 (1996), 229-241.
  4. The p-rank of the Sp(4,p) Generalized Quadrangle, with Dom de Caen, preprint. This has subsequently been generalised by P. Sin to Sp(2m,p).
  5. Approaching Some Problems in Finite Geometry through Algebraic Geometry, in preparation. To be submitted to Algorithmic Algebraic Combinatorics and Grobner Bases, ed. G. Jones, A. Jurišić, M. Muzychuk and I. Ponomarenko.

Chromatic Number of Graphs
  1. On the Chromatic Numbers of Planes, preprint.

Two-Graphs
  1. Two-graphs and skew two-graphs in finite geometries, Linear Algebra and its Applications 226-228 (1995), 529-551.

Nets and Quasigroups
  1. Bruck nets, codes, and characters of loops, Designs, Codes and Cryptography 1 (1991), 7-29.
  2. Codes of Nets with Translations, in Advances in Finite Geometries and Designs, ed. J. Hirschfeld et. al.; Oxford Univ. Press, 1991, pp.327-336.
  3. On codes of Bruck nets and projective planes, in Coding Theory, Design Theory, Group Theory (Proceedings of the Marshall Hall Conference), ed. D. Jungnickel and S. A. Vanstone; J. Wiley & Sons, 1993, pp.237-242.
  4. Nets and Latin squares of small order, technical report, April 2001. (Under Construction)
  5. Bol loops of small order, technical report, June 2002. (Under Construction)
  6. Ranks of Nets and of Webs, very preliminary draft, 2005. (Under Construction. Pages of the most unfinished portion have been deleted from this pdf file)
  7. Ranks of Nets, Quasigroups and Related Systems 14 (2006), 61-72.

Distance Regular Graphs
  1. A family of antipodal distance-regular graphs related to the classical Preparata codes, with D. de Caen and R. Mathon, J. Algebraic Combinatorics 4 (1995), 317-317.

Generalized Hadamard Matrices
  1. The 2-Transitive Complex Hadamard Matrices, preprint, 32 pages.

Projective Planes
  1. PSL(2,q) as a collineation group of projective planes of small order, Geometriae Dedicata 31 (1989), 63-88.
  2. PSL(3,q) and PSU(3,q) on planes of order q4, unpublished manuscript, 42 pages.
  3. Projective planes of small order, technical report, September 2000. (Under Construction)
  4. Projective planes of order 25, technical report, September 2000. (Under Construction)
  5. Projective planes of order 27, technical report, September 2000. (Under Construction)
  6. On projective planes of order less than 32, in Finite Geometries, Groups, and Computation, ed. A. Hulpke et. al.; de Gruyter, Berlin, 2006, pp.149-162.
  7. Embedding finite partial linear spaces in finite translation nets, with Jason Williford, 2007. Submitted to Journal of Geometry.

Other Generalised Polygons

  1. Generalised polygons of small order, technical report, August 2003. (Under Construction)

Semibiplanes
  1. Reconstructing projective planes from semibiplanes, in Coding Theory and Design Theory, Part II: Design Theory, ed. D. Ray-Chaudhuri, Springer-Verlag, 1990, pp.280-285.
  2. On the construction of finite projective planes from homology semibiplanes, Europ. J. Combinatorics 11 (1990), 589-600.
  3. Planes, semibiplanes and related complexes, preprint, 6 pages.

Other

  1. A sufficient condition for an entire function to be a polynomial of degree one, with F. Jafari and J.-Cl. Evard, Nieuw Archief voor Wiskunde 12 (1994), 9-13.
  2. Partitioning the n-cube into sets with mutual distance 1, with A. Blokhuis, K. Metsch, R. Ahlswede, and S.L. Bezrukhov, Applied Math. Letters 6 (1993), 17-19.
Under Construction
/ revised January, 2006