Nuclei of pointsets in \(PG(n,q)\) (Q1377782): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claims
Property / author
 
Property / author: Peter Sziklai / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Q676707 / rank
Normal rank
 

Revision as of 08:26, 21 February 2024

scientific article
Language Label Description Also known as
English
Nuclei of pointsets in \(PG(n,q)\)
scientific article

    Statements

    Nuclei of pointsets in \(PG(n,q)\) (English)
    0 references
    26 January 1998
    0 references
    Let \(S\) be a set of points in \(PG(n,q)\) such that \(S\) does not contain a hyperplane and is not contained in the union of any \(t\) hyperplanes. A point \(P\notin S\) is a \(t\)-fold nucleus of \(S\) if each line through \(P\) contains at most (or at least) \(t\) points of \(S\) (depending on the size of \(S)\). This idea turns out to be related to the notion of blocking sets. The main result is an upper bound for the number of \(t\)-fold nuclei.
    0 references
    pointsets in \(PG(n,q)\)
    0 references
    \(t\)-fold nucleus
    0 references
    blocking sets
    0 references
    upper bound
    0 references

    Identifiers