Near polygon

In mathematics, a near polygon is a concept in incidence geometry introduced by Ernest E.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematics, a near polygon is a concept in incidence geometry introduced by Ernest E. Shult and Arthur Yanushka in 1980. Shult and Yanushka showed the connection between the so-called tetrahedrally closed line-systems in Euclidean spaces and a class of point-line geometries which they called near polygons.

These structures generalise the notion of generalized polygon as every generalized 2n-gon is a near 2n-gon of a particular kind. Near polygons were extensively studied and connection between them and dual polar spaces was shown in 1980s and early 1990s. Some sporadic simple groups, for example the Hall-Janko group and the Mathieu groups, act as automorphism groups of near polygons.

A near 0-gon (d = 0) is a single point while a near 2-gon (d = 1) is just a single line, i.e., a complete graph. A near quadrangle (d = 2) is same as a (possibly degenerate) generalized quadrangle. In fact, it can be shown that every generalized 2d-gon is a near 2d-gon that satisfies the following two additional conditions: Every point is incident with at least two lines.

For every two points x, y at distance i  2d -gon S is called regular if it has an order (s,t) and if there exist constants t_i, i \in \{1,\ldots,d\} , such that for every two points x and y at distance i , there are precisely t_i + 1 lines through y containing a (necessarily unique) point at distance i - 1 from x . It turns out that regular near 2d -gons are precisely those near 2d -gons whose point graph (also known as a collinearity graph) is a distance-regular graph. A generalized 2d -gon of order (s, t) is a regular near 2d -gon with parameters t_1 = 0, t_2 = 0, \ldots, t_d = t

Text derived from https://en.wikipedia.org/w/index.php?oldid=1323048143 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

4 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.