Non-existence of sets of type \((0, 1, 2 , n_{d})_{d}\) in \(\mathrm{PG}({r,q})\) with \( 3 \leq d\leq r- 1 \) and \(r\geq 4\) (Q1754398): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00022-018-0419-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2789645770 / rank | |||
Normal rank | |||
Revision as of 23:10, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Non-existence of sets of type \((0, 1, 2 , n_{d})_{d}\) in \(\mathrm{PG}({r,q})\) with \( 3 \leq d\leq r- 1 \) and \(r\geq 4\) |
scientific article |
Statements
Non-existence of sets of type \((0, 1, 2 , n_{d})_{d}\) in \(\mathrm{PG}({r,q})\) with \( 3 \leq d\leq r- 1 \) and \(r\geq 4\) (English)
0 references
30 May 2018
0 references
A set of type \((0,1,2,n_d)_d\) in \(\mathrm{PG}(r,q)\) is a set \(S\) of points such that every \(d\)-dimensional subspace intersects \(S\) in either \(0\), \(1\), \(2\) or \(n_d\) points, and such that these \(4\) different intersection numbers occur. In this paper, the author shows that there are no \((0,1,2,n_d)_d\) sets where \(3\leq d\leq r-1\) and \(r\geq 4\). The theorem is proved by a combination of various clever counting techniques.
0 references
sets of type \((0, 1, 2, n_{d})_{d}\)
0 references
four-intersection sets
0 references
sets with few intersection numbers
0 references
