Lines in higgledy-piggledy arrangement (Q405273)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lines in higgledy-piggledy arrangement |
scientific article |
Statements
Lines in higgledy-piggledy arrangement (English)
0 references
4 September 2014
0 references
Summary: In this article, we examine sets of lines in \(\mathbf{ {PG}}(d,\mathbb{F})\) meeting each hyperplane in a generator set of points. We prove that such a set has to contain at least \(\lfloor1.5d\rfloor\) lines if the field \(\mathbb{F}\) has at least \(\lfloor1.5d\rfloor\) elements, and at least \(2d-1\) lines if the field \(\mathbb{F}\) is algebraically closed. We show that suitable \(2d-1\) lines constitute such a set (if \(|\mathbb{F}|\geq2d-1\)), proving that the lower bound is tight over algebraically closed fields. At last, we will see that the strong \((s,A)\) subspace designs constructed by \textit{V. Guruswami} and \textit{S. Kopparty} [``Explicit subspace designs'', in: Proceedings of the 2013 IEEE 54th annual symposium on foundations of computer science, FOCS 2013. Berkeley, CA, USA: IEEE Computer Society. 608--617 (2013)] have better (smaller) parameter \(A\) than one would think at first sight.
0 references
well-spread-out (`higgledy-piggledy') lines
0 references
subspace designs
0 references
Grassmann variety
0 references
Plücker co-ordinates
0 references