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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Peter Sziklai / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Q676707 / rank
Normal rank
 
Property / author
 
Property / author: Peter Sziklai / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Theodore G. Ostrom / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiple nuclei and a conjecture of Lunelli and Sce / rank
 
Normal rank
Property / cites work
 
Property / cites work: On nuclei and affine blocking sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of exterior lines of certain sets of points in PG(2,q) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two remarks on blocking sets and nuclei in planes of prime order / rank
 
Normal rank

Latest revision as of 09:32, 28 May 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
    0 references

    Identifiers