On the finiteness of near polygons with 3 points on every line (Q1408684): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3361478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near polygons and Fischer spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of near polygons with quads / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear representations of near hexagons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orbits of Permutation Groups on Unordered Sets, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near \(n\)-gons and line systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur la trialité et certains groupes qui s'en déduisent / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1023/a:1025165325390 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W12903319 / rank
 
Normal rank

Latest revision as of 10:51, 30 July 2024

scientific article
Language Label Description Also known as
English
On the finiteness of near polygons with 3 points on every line
scientific article

    Statements

    On the finiteness of near polygons with 3 points on every line (English)
    0 references
    0 references
    25 September 2003
    0 references
    The author deals with near \(2d\)-gons. A {near \(2d\)-gon} is a partial linear space \(\Gamma = ({\mathcal P}, {\mathcal L}, I)\) satisfying the following two conditions: (1) For every point \(p \in {\mathcal P}\) and every line \(l \in {\mathcal L}\) there exists a unique point on \(l\) with minimal distance to \(p\), where the distance is measured in the collinearity graph of \(\Gamma\). (2) The diameter of \(\Gamma\) equals \(d\). A near \(2d\)-gon is called of order \((s, t)\), if each point is incident with exactly \(t+1\) lines and if each line is incident with exactly \(s+1\) points. \(s\) and \(t\) are not necessarily finite. Note that a near quadrangle is already a generalized quadrangle. The main result of de Bruyn is as follows: Theorem. Let \(\Gamma\) be a near \(2d\)-gon of order \((2, t)\) such that any two points at distance 2 have at least two common neighbours. Then \(\Gamma\) is finite.
    0 references
    generalized quadrangles
    0 references
    generalized polygons
    0 references
    finiteness
    0 references
    near \(2d\)-gons
    0 references

    Identifiers