The uniqueness of the near hexagon on 729 points

Abstract

We prove that any regular near hexagon with 729 vertices and lines of size 3 is derived from the ternary Golay code, thus settling the last case in doubt among the regular near hexagons with lines of size 3.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    P. J. Cameron andJ. H. Van Lint,Graph Theory, Coding Theory and Block Designs, LMS Lecture Notes 19, Cambridge Univ. Press, Cambridge, 1975.

    MATH  Google Scholar 

  2. [2]

    Ph. Delsarte andJ. M. Goethals, Unrestricted codes with the Golay parameters are unique,Discr. Math. 12 (1975) 211–224.

    MATH  Article  MathSciNet  Google Scholar 

  3. [3]

    V. Pless, On the uniqueness of the Golay codes,J. Comb. Theory 5 (1968) 215–228.

    MATH  MathSciNet  Google Scholar 

  4. [4]

    E. E. Shult andA. Yanushka, Nearn-gons and line systems,Geometriae Dedicata 9 (1980) 1–72.

    MATH  Article  MathSciNet  Google Scholar 

Download references

Author information

Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Brouwer, A.E. The uniqueness of the near hexagon on 729 points. Combinatorica 2, 333–340 (1982). https://doi.org/10.1007/BF02579429

Download citation

AMS subject classification (1980)

  • 05 B 30
  • 51 E 10
  • 94 B 25