en>Yobot: WP:CHECKWIKI error fixes using AWB (10093)

2014-05-05T12:47:29Z

WP:CHECKWIKI error fixes using AWB (10093)

en>David Eppstein: neighborly polytope

2013-11-03T19:54:53Z

New page

{{DISPLAYTITLE:Near polygon}}

In [[mathematics]], a '''near polygon''' is an [[incidence structure]] introduced by E.Shult and A. Yanushka in 1980.<ref>Shult, Ernest; Yanushka, Arthur. "Near n-gons and line systems".</ref> Shult and Yanushka showed the connection between the so called tetrahedrally closed line-systems in Euclidean spaces and a class of [[incidence geometry|point-line geometries]] which they called near polygons. These structures generalise the notion of [[generalized polygon]] as every generalized 2''n''-gon is a near 2''n''-gon of a particular kind. These structures were extensively studied and connection between them and dual polar space <ref>Cameron, Peter J. "Dual polar spaces".</ref> was shown in 1980s and early 1990s. Some sporadic [[simple groups]], for example the [[Hall-Janko group]], act as automorphism groups of some near polygons.

== Definition ==

A near 2''d''-gon is an [[incidence structure]] (<math>P,L,I</math>), where <math>P</math> is the set of points, <math>L</math> is the set of lines and <math>I\subseteq P\times L</math> is the [[incidence relation]], such that:
* The maximum distance between two points (the so called diameter) is ''d''.
* For every point <math>x</math> and every line <math>L</math> there exists a unique point on <math>L</math> which is nearest to <math>x</math>.

A near quadrangle is same as a [[generalized quadrangle]] and it can be shown that every generalized 2''d''-gon is a near 2''d''-gon with the following two additional conditions:
* Every point is incident with at least two lines.
* For every two points ''x'', ''y'' at distance ''i'' < ''d'', there exists a unique neighbour of ''y'' at distance ''i'' − 1 from ''x''.

A near polygon is called dense if every line is incident with at least three points and if every two points at distance two have at least two common neighbours. It is said to have order (''s'', ''t'') if every line is incident with precisely ''s'' + 1 points and every point is incident with precisely ''t'' + 1 lines.

== Examples ==

* All [[generalized polygon|generalized polygons]].
* All dual polar spaces.
* The Hall–Janko near octagon<ref>http://cage.ugent.be/~hvm/artikels/187.pdf</ref> associated with the [[Hall–Janko group]].

== Regular near polygons ==

A finite near <math>2d</math>-gon S is called regular if it has an order <math>(s,t)</math> and if there exist constants <math>t_i, i \in \{0,1,\ldots,d\}</math>, such that for every two points <math>x</math> and <math>y</math> at distance <math>i</math>, there are precisely <math>t_i + 1</math> lines through <math>y</math> containing a (necessarily unique) point at distance <math>i - 1</math> from <math>x</math>. It turns out that regular near <math>2d</math>-gons are precisely those near <math>2d</math>-gons whose point graph is a [[distance-regular graph]]. A generalized <math>2d</math>-gon is a regular near <math>2d</math>-gon of order <math>(s, t; 0, 0, \ldots, 0)</math>.

== See also ==

* [[Finite geometry]]
* [[Polar space]]
* [[Partial linear space]]
* [[Association scheme]]
* [[Hall–Janko graph]]

== Notes ==

{{Reflist}}

== References ==


*{{Citation
| last1 = Shult | first1 = Ernest
| last2 = Yanushka | first2 = Arthur
| doi = 10.1007/BF00156473
| journal = Geom. Dedicata
| mr = 566437
| pages = 1––72
| title = Near n-gons and line systems
| volume = 9
| year = 1980}}.

*{{Citation
| last1 = Cameron | first1 = Peter J.
| journal = Geom. Dedicata
| mr = 645040
| pages = 75–85
| title = Dual polar spaces
| volume = 12
| year = 1982}}.

*{{citation
| last = De Bruyn | first1 = Bart
| doi = 10.1007/978-3-7643-7553-9
| publisher = Birkhäuser Verlag
| mr = 2227553
| title = Near Polygons
| isbn = 3-7643-7552-3
| year = 2006
| series = Frontiers in Mathematics}}.

*{{citation
| last1 = Brouwer | first1 = A.E. | authorlink=Andries Brouwer
| last2 = Cohen | first2 = A.M.
| publisher = Berlin, New York: Springer-Verlag.
| mr = 1002568
| title = Distance Regular Graphs
| isbn = 3-540-50619-5
| year = 1989}}.

*{{Citation | last1=Cameron | first1=Peter J. | authorlink=Peter Cameron (mathematician) | title=Projective and polar spaces | url=http://www.maths.qmul.ac.uk/~pjc/pps/ | publisher=Queen Mary and Westfield College School of Mathematical Sciences | location=London | series=QMW Maths Notes | mr=1153019 | year=1991 | volume=13}}

[[Category:Incidence geometry]]
[[Category:Graph theory]]
[[Category:Finite geometry]]

Upper bound theorem - Revision history

en>Yobot: WP:CHECKWIKI error fixes using AWB (10093)

en>David Eppstein: neighborly polytope