A combinatorial characterization of extremal generalized hexagons
The electronic journal of combinatorics, Tome 29 (2022) no. 4
A finite generalized $2d$-gon of order $(s,t)$ with $d \in \{ 2,3,4 \}$ and $s \not= 1$ is called extremal if $t$ attains its maximal possible value $s^{e_d}$, where $e_2=e_4=2$ and $e_3=3$. The problem of finding combinatorial conditions that are both necessary and sufficient for a finite generalized $2d$-gon of order $(s,t)$ to be extremal has so far only be solved for the generalized quadrangles. In this paper, we obtain a solution for the generalized hexagons. We also obtain a related combinatorial characterization for extremal regular near hexagons.
DOI :
10.37236/9245
Classification :
51E12
Mots-clés : finite generalized polygons, near hexagons, generalized hexagons
Mots-clés : finite generalized polygons, near hexagons, generalized hexagons
Affiliations des auteurs :
Bart De Bruyn  1
@article{10_37236_9245,
author = {Bart De Bruyn},
title = {A combinatorial characterization of extremal generalized hexagons},
journal = {The electronic journal of combinatorics},
year = {2022},
volume = {29},
number = {4},
doi = {10.37236/9245},
zbl = {1509.51001},
url = {http://geodesic.mathdoc.fr/articles/10.37236/9245/}
}
Bart De Bruyn. A combinatorial characterization of extremal generalized hexagons. The electronic journal of combinatorics, Tome 29 (2022) no. 4. doi: 10.37236/9245
Cité par Sources :