Moufang trees and generalized hexagons (Q1900909): Difference between revisions

Let \(V(\Gamma)\) denote the vertex set of an undirected graph \(\Gamma\), and let \(G\) be a subgroup of \(\text{aut}(\Gamma)\). For \(x\in V(\Gamma)\), let \(\Gamma_x\) denote the set of vertices adjacent to \(x\). The graph \(\Gamma\) is called thick if \(|\Gamma_u|\geq 3\) for all \(u\in V(\Gamma)\). Let \(G^{[i]}_x\) denote the pointwise stabilizer in \(G_x\) of the set of vertices at distance at most \(i\) from \(x\). Set \[ G^{[i]}_{x, y,\dots, z}= G^{[i]}_x\cap G^{[i]}_y\cap\cdots \cap G^{[i]}_z. \] Integers are used to represent vertices in the following theorem (Theorem 1 in the author [The nonexistence of certain Moufang polygons, Inventiones Math. 51, 261-266 (1979; Zbl 0409.05033)]) which generalizes a result of \textit{J. Tits} [Moufang octagons and the Ree groups of type \(^2 F_4\), Am. J. Math. 105, 539-594 (1983; Zbl 0521.20016)]. Theorem 1.1. Let \(\Gamma\) be a thick, connected graph and let \(n\geq 3\). Suppose for each \(n\)-path \((0, 1,\dots, n)\) of \(\Gamma\), (i) \(G^{[1]}_{1, 2,\dots, n- 1}\) acts transitively on \(\Gamma_n\backslash \{n- 1\}\), and (ii) \(G^{[1]}_{0, 1}\cap G_0= 1\). Then \(n= 3, 4, 6\), or 8. A graph is \((G, n)\)-Moufang if it is thick, connected and \(\Gamma\), \(G\), and \(n\) fulfill conditions (i) and (ii) of Theorem 1.1. The author proves that \((G,6)\)-Moufang trees give rise to generalized hexagons. See \textit{A. Delgado} and \textit{B. Stellmacher} [``Weak \((B, N)\)-pairs of rank 2'' in Groups and Graphs: New Results and Methods, Birkhäuser Verlag, Basel (1985)].