Sets of type \((q-1,n)\) in \(PG(3, q)\) (Q6601251)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sets of type \((q-1,n)\) in \(PG(3, q)\) |
scientific article; zbMATH DE number 7909932
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sets of type \((q-1,n)\) in \(PG(3, q)\) |
scientific article; zbMATH DE number 7909932 |
Statements
Sets of type \((q-1,n)\) in \(PG(3, q)\) (English)
0 references
10 September 2024
0 references
In this paper, the authors prove the following interesting and strong result. Consider \(\mathbf{P} = PG(3, q)\), the projective geometry of dimension \(3\) over \(\mathbb{F}_q\). A set \(K\) of points of \(\mathbf{P}\) is said to be type \((m, n)\) (with \(m < n\)) if \(K\) intersects every plane in \(\mathbf{P}\) in \(m\) or \(n\) points. \(K\) is then called an \((m, n)\)-set. Let \(K\) be an \((m, n)\)-set in \(\mathbf{P}\). In an earlier result of Tallini Scafati, it was shown that \(n - m\) must divide \(q^2\). Let \(q = p^h\). In an earlier paper, the authors proved that if \(p\) is the characteristic of \(\mathbb{F}_q\), then \(p \leq n - m \leq q\). Use of these two earlier results and a lot of computation (mainly involving careful two-way counting), the present paper proves the following strong result: If \(K\) is an \((m, n)\)-set in \(\mathbf{P}\), with \(m = q - 1\) then \(n = 2q - 1 = m + q\).
0 references
two character set
0 references
two intersection set
0 references
set of type \((m, n)\)
0 references