Embeddings of small generalized polygons (Q998650): Difference between revisions

A canonical recipe for constructing a generalized polygon is to view it as a subgeometry of a finite projective space over a suitable field. Such a generalized polygon \textbf{G} embeds in a projective space \textbf{P} such that the both \textbf{G} and \textbf{P} have the same underlying field \(F = GF(q)\). Such an embedding is called a full embedding. Any embedding other than this is called a \textit{lax} embedding. This amounts to constructing the polygon over a field \(F\) and embedding it in a projective space over a field \(K\) where \(K \neq F\). In particular, a lax embedding is called a grumbling if \(F\) and \(K\) have different characteristics. This is a very well written paper that addresses the question of embeddings of small generalized polygons and generalized quadrangles in particular. The paper also obtains a large number of classification results of embeddings of small generalized polygons.