{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:15:37Z","timestamp":1773346537251,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>In this article, we examine sets of lines in $\\mathsf{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}|\\ge2d-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 Guruswami and Kopparty\u00a0have better (smaller) parameter $A$ than one would think at first sight.<\/jats:p>","DOI":"10.37236\/4149","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T01:03:37Z","timestamp":1578704617000},"source":"Crossref","is-referenced-by-count":12,"title":["Lines in Higgledy-Piggledy Arrangement"],"prefix":"10.37236","volume":"21","author":[{"given":"Szabolcs L.","family":"Fancsali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P\u00e9ter","family":"Sziklai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2014,6,27]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v21i2p56\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v21i2p56\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T10:55:29Z","timestamp":1579258529000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v21i2p56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,27]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2014,3,31]]}},"URL":"https:\/\/doi.org\/10.37236\/4149","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,27]]},"article-number":"P2.56"}}