Skip to main content

Regular near polygons

  • Chapter
Near Polygons

Part of the book series: Frontiers in Mathematics ((FM))

  • 431 Accesses

Abstract

In this chapter \( \mathcal{S} = (\mathcal{P},\mathcal{L},I) \) denotes a finite regular near 2d-gon, d≥2, with parameters s, t, t i (i∈{0, ..., d}, i.e. \( \mathcal{S} \) has order (s, t) and for every two points x and y at distance i there are t i +1 lines through y containing a (necessarily unique) point of Γi+1(x). Notice that t0=−1, t1=0 and t d =t. The number |Γ i (x)|, i∈ {0, ..., d}, is independent from the chosen point x and equal to

$$ k_i = \frac{{s^i \prod _{j = 0}^{i - 1} (t - t_j )}} {{\prod _{j = 0}^{i - 1} (t - t_j )}}. $$

The total number of points is equal to

$$ v = k_0 + k_1 + \cdots + k_d . $$

If x, y and z are points such that d(x, y)=i, d(y, z)=1 and d(x, z)=i+1, then Γ1(x)∩Γi−1(y)⊆Γ1(x)∩Γ1(z). As a consequence, t i t i +1 for every i ∈ {0, ..., d−1}. Since Γ d (x)≠0 for at least one (and hence all) point(s) of \( \mathcal{S} \), we must have that t d −1 ≠ t.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Birkhäuser Verlag

About this chapter

Cite this chapter

(2006). Regular near polygons. In: Near Polygons. Frontiers in Mathematics. Birkhäuser Basel. https://doi.org/10.1007/978-3-7643-7553-9_3

Download citation

Publish with us

Policies and ethics