Intersection-sets in \(PG(n,2)\) (Q1365489): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0378-3758(96)00161-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979521169 / rank
 
Normal rank

Latest revision as of 10:58, 30 July 2024

scientific article
Language Label Description Also known as
English
Intersection-sets in \(PG(n,2)\)
scientific article

    Statements

    Intersection-sets in \(PG(n,2)\) (English)
    0 references
    0 references
    0 references
    0 references
    22 September 1997
    0 references
    A subset \(X\) of \(PG(n,2)\) is called independent if it is line-free, and a set \(C\) is said to be an \(r\)-intersection-set of \(PG(n,2)\) if \(| C\cap K|\geq r\), for all hyperplanes \(K\). In the paper under review line-free intersection-sets of \(PG(n,2)\) are examined, and their incidence equations are described. The authors construct a line-free subset \(X_n\) of \(PG(n,2)\), for every \(n\geq 3\), which meets every hyperplane in at least \(2^{n-3}\) points. For \(n=3,4,5\), the set \(X_n\) is the unique (up to isomorphism) set having these two properties. Further results on \(r\)-intersection-sets in \(PG(n,2)\), \(n=5,6\) are also given.
    0 references
    caps
    0 references
    codes
    0 references
    2-blocks
    0 references
    projective space
    0 references
    blocking sets
    0 references
    line-free intersection-sets
    0 references

    Identifiers