Math 2.0

Geometry Definition

Generalized polygon

Builds on Incidence structureBipartite graphGirthGraph

Definition

Let 𝒮=(P,L,I)\mathcal{S} = (P, L, I) be an incidence structure with point set PP, line set LL and incidence relation I⊆P×LI \subseteq P \times L. Its incidence graph is the bipartite graph with vertex set P∪LP \cup L, with an edge between p∈Pp \in P and ℓ∈L\ell \in L when (p,ℓ)∈I(p, \ell) \in I. Let n≥2n \ge 2 be an integer. The structure 𝒮\mathcal{S} is a generalized nn-gon if its incidence graph is connected, has diameter nn, and has girth 2n2n. Here the diameter is the largest distance between two vertices of the graph. A generalized nn-gon is thick if every point lies on at least three lines and every line has at least three points.

Remarks

Example: the Fano plane is a generalized 33-gon. Two points lie on a common line, and two lines meet in a point, so in both cases the distance is 22. A point and a line not through it are at distance 33, so the diameter is 33. A cycle of length 44 would give two points on two common lines, which is impossible. A triangle of the plane gives a cycle of length 66, so the girth is 66. It is thick, since each line has 33 points and each point is on 33 lines.

Non-example: the affine plane of order 22, with 44 points and the 66 lines of 22 points each. Its girth is 66, but two parallel lines have no common point, so they are at distance 44; the diameter is 4≠34 \ne 3.

For n≥3n \ge 3, any two points lie on at most one line, so a generalized nn-gon is a partial linear space. The generalized 33-gons with at least three points on each line and three lines on each point are exactly the projective planes, and the generalized 44-gons are the generalized quadrangles. A finite thick generalized nn-gon has an order (s,t)(s, t): every line has s+1s + 1 points and every point is on t+1t + 1 lines.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Bipartite graph concept
  2. Girth concept
  3. Graph concept
  4. Incidence structure concept
  5. Generalized polygon definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Generalized_polygon
About this page
TagDKT8Z2M9CB
URIm2://DKT8Z2M9CB
Kinddefinition
WritingW0 stub
MSC51E12, 51E24
DefinesGeneralized polygon
UsesIncidence structure, Bipartite graph, Girth, Graph

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.