Recommendations
- Higgledy-piggledy subspaces and uniform subspace designs
- Blocking \(s\)-dimensional subspaces by lines in \(PG(2s,q)\)
- Minimal and maximal arrangements of hyperplanes in \(\mathbb P^{n}(\mathbb {F}_{q})\)
- Higgledy-piggledy sets in projective spaces of small dimension
- How many \(s\)-subspaces must miss a point set in \(\mathrm{PG}(d, q)\)
Cites work
Cited in
(14)- Resolving sets for higher dimensional projective spaces
- On resolving sets in the point-line incidence graph of \(\mathrm{PG}(n,q)\)
- Lines pinning lines
- Strong blocking sets and minimal codes from expander graphs
- Higgledy-piggledy subspaces and uniform subspace designs
- On cutting blocking sets and their codes
- Search problems in vector spaces
- Constructing saturating sets in projective spaces using subgeometries
- Three combinatorial perspectives on minimal codes
- Higgledy-piggledy sets in projective spaces of small dimension
- Linear cutting blocking sets and minimal codes in the rank metric
- A higgledy-piggledy set of planes based on the ABB-representation of linear sets
- Outer strong blocking sets
- Small Strong Blocking Sets by Concatenation
This page was built for publication: Lines in higgledy-piggledy arrangement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405273)
