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

5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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 HD(2). In fact, the employed techniques allow us to prove a stronger result. We show that every near hexagon 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≅ HD(2) then S must also be a generalized hexagon, and consequently isomorphic to either HD(2) or the dual twisted triality hexagon T(2, 8).

Cite

CITATION STYLE

APA

Bishnoi, A., & De Bruyn, B. (2016). On Semi-Finite Hexagons of Order (2, t) Containing a Subhexagon. Annals of Combinatorics, 20(3), 433–452. https://doi.org/10.1007/s00026-016-0315-z

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free