Annals of Combinatorics

, Volume 20, Issue 3, pp 433–452 | Cite as

On Semi-Finite Hexagons of Order (2, t) Containing a Subhexagon

  • Anurag Bishnoi
  • Bart De BruynEmail author


The research in this paper was motivated by one of the most important open problems in the theory of generalized polygons, namely the existence problem for semi–finite thick generalized polygons. We show here that no semi–finite generalized hexagon of order (2, t) can have a subhexagon H of order 2. Such a subhexagon is necessarily isomorphic to the split Cayley generalized hexagon H(2) or its point–line dual H D (2). In fact, the employed techniques allow us to prove a stronger result. We show that every near hexagon \({\mathcal{S}}\) of order (2, t) which contains a generalized hexagon H of order 2 as an isometrically embedded subgeometry must be finite. Moreover, if \({H \cong H^{D}}\)(2) then \({\mathcal{S}}\) must also be a generalized hexagon, and consequently isomorphic to either H D (2) or the dual twisted triality hexagon T(2, 8).


generalized hexagon near hexagon valuation 

Mathematics Subject Classification

51E12 05B25 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bishnoi, A., De Bruyn, B.: GAP–code for "On semi–finite hexagons of order (2, t) containing a subhexagon". Online available document,
  2. 2.
    Brouwer, A.E.: A nondegenerate generalized quadrangle with lines of size four is finite. In: Hirschfeld, J.W.P., Hughes, D.R., Thas, J.A. (eds.) Advances in Finite Geometries and Designs, pp. 47–49. Oxford Univ. Press, New York (1991)Google Scholar
  3. 3.
    Cameron P.J.: Orbits of permutation groups on unordered sets. II. J. London Math. Soc. (2) 23(2), 249–264 (1981)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Cherlin G.: Locally finite generalized quadrangles with at most five points per line. Discrete Math. 291(1–3), 73–79 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Cohen A.M., Tits J.: On generalized hexagons and a near octagon whose lines have three points. European J. Combin. 6(1), 13–27 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    De Bruyn, B.: The valuations of the near polygon \({\mathbb{G}_n}\). Electron. J. Combin. 16, #R137, (2009)Google Scholar
  7. 7.
    De Bruyn B.: Polygonal valuations. Discrete Math. 313(1), 84–93 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    De Bruyn B.: The uniqueness of a certain generalized octagon of order (2, 4). Discrete Math. 338, 2125–2142 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    De Bruyn B., Vandecasteele P.: Valuations of near polygons. Glasg. Math. J. 47(2), 347–361 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    De Bruyn B., Vandecasteele P.: The classification of the slim dense near octagons. European J. Combin. 28(1), 410–428 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Frohardt D., Johnson P.: Geometric hyperplanes in generalized hexagons of order (2, 2). Comm. Algebra 22(3), 773–797 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Shult E.E., Yanushka A.: Near n and line systems. Geom. Dedicata 9(1), 1–72 (1980)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    The GAP Group: GAP — Groups, Algorithms, and Programming, Version 4.4.12 (2008)–
  14. 14.
    Tits J.: Sur la trialitéet certains groupes qui s’en déduisent. Inst. Hautes Études Sci. Publ. Math. 2, 13–60 (1959)CrossRefzbMATHGoogle Scholar
  15. 15.
    Van Maldeghem H.: Generalized Polygons. Birkhäuser, Basel (1998)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing 2016

Authors and Affiliations

  1. 1.Department of MathematicsGhent UniversityGentBelgium

Personalised recommendations