Near hexagons with four points on a line
A near polygon is a connected partial linear space satisfying the property that for every point \(x\) and every line \(L\), there is a unique point on \(L\) nearest to \(x\). (Distance is measured in the collinearity graph \(\Gamma\).) If \(d\) is the diameter of \(\Gamma\), then the near polygon is called a near \(2d\)-gon. A near polygon is said to have order \((s,t)\) provided each line is incident with \(1 + s\) points and each point is incident with \(1+t\) lines. In the paper under review there is a significant attempt to classify all near hexagons (i.e., \(d = 3\)) with the two properties: (i) each line is incident with 4 points \((s = 3)\); (ii) every two points at distance 2 have at least two common neighbors. The author begins by giving ten explicit examples which are either `classical' or `glued', i.e., given by previously known general techniques. He then proceeds to show that if a near hexagon satisfies his two properties (i) and (ii), then either it is one of the ten examples or it fits one of four very specific sets of restrictions, for each of which there is no known example. For example, the largest of the open cases would be a near hexagon with order \((3,34)\) on 20608 points, with the property that each pair of points at distance 2 is contained in a unique \(4\times 4\) grid.
- Near hexagons with two possible orders for the quads.
- On generalized hexagons and a near octagon whose lines have three points
- Dense near octagons with four points on each line. III
- Extended near hexagons and line systems
- A note on near hexagons with lines of size 3.
- Near hexagons and triality
- On Six Collinear Points in Bicentric Quadrilaterals
- Dense near polygons with two types of quads and three types of hexes
- Bounding the size of near hexagons with lines of size 3
- On linear representations of near hexagons
- On linear representations of near hexagons
- Near polygons from partial linear spaces
- A thin near hexagon with 50 points
- On the finiteness of near polygons with 3 points on every line
- A new geometrical construction for the near hexagon with parameters \((s,t,T_2)=(2,5,\{1,2\})\)
- On the adjacency algebras of near hexagons with an order
- On the number of nonisomorphic glued near hexagons
- On the uniqueness of near polygons with three points on every line
- On tetrahedrally closed line systems and a generalization of the Haemers-Roos inequality
- Dense near octagons with four points on each line. I.
- Some notes on tetrahedrally closed spherical sets in Euclidean spaces
- Dense near polygons with hexes of type \(H^D(5,q^{2}), Q(5,q)\times L_{q+1}\) or \(Q(5,q) \otimes Q(5,q)\)
- Distance-\(j\)-ovoids in regular near \(2 d\)-gons
- Slim near polygons.
- The completion of the classification of the finite dense near \(2d\)-gons, \(d \in \{3,4\}\), with four points on each line
- The use of valuations for classifying point-line geometries
- Near hexagons with two possible orders for the quads.
- A note on near hexagons with lines of size 3.
- A decomposition of the universal embedding space for the near polygon \({{\mathbb H}_n}\)
- Extended near hexagons and line systems
- On Q-polynomial regular near 2d-gons
- Dense near octagons with four points on each line, II
- Bounding the size of near hexagons with lines of size 3
- Glued near polygons
- Dense near octagons with four points on each line. III
- A general theory for dense near polygons with a nice chain of subpolygons
- The hyperplanes of the near hexagon on the 2-factors of the complete graph \(K_8\)
This page was built for publication: Near hexagons with four points on a line
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2736574)
