Corpus ID: 237562935

Higgledy-piggledy sets in projective spaces of small dimension

  title={Higgledy-piggledy sets in projective spaces of small dimension},
  author={Lins Denaux},
This work focuses on higgledy-piggledy sets of k-subspaces in PG(N, q), i.e. sets of projective subspaces that are ‘well-spread-out’. More precisely, the set of intersection points of these k-subspaces with any (N − k)-subspace κ of PG(N, q) spans κ itself. We highlight three methods to construct small higgledy-piggledy sets of k-subspaces and discuss, for k ∈ {1, N − 2}, ‘optimal’ sets that cover the smallest possible number of points. Furthermore, we investigate small non-trivial higgledy… 
1 Citations

Figures from this paper

Upper bounds on the length function for covering codes
New upper bounds on `q(tR + 1, R) are obtained in the following forms: q is an arbitrary prime power, c is independent of q, and q is large enough.


Higgledy-piggledy subspaces and uniform subspace designs
This article investigates collections of ‘well-spread-out’ projective (and linear) subspaces and shows the connection between uniform weak subspace designs and higgledy-piggledy sub Spaces proving that A is algebraically closed.
On Saturating Sets in Small Projective Geometries
An upper bound onk (?+ 1, pm, ?) is given, which proves that k(5, q, 2) ? 3 q+ 1 forq= 2, q? 4.
On linear sets on a projective line
This paper considers linear sets as quotient geometries and determines the exact conditions for two linear sets to be equivalent, and derives an upper bound, which is sharp for odd q, on the size of the intersection of two different linear sets of rank 3 in PG(1, qh).
Resolving sets for higher dimensional projective spaces
It is proved that if $q is large enough then R(n,q), a resolving set for the point-hyperplane incidence graph of $\mathrm{PG}( n,q)$ is largeenough and generalizes the result of Fancsali and Sziklai about higgledy-piggledy lines to the language of resolving sets.
A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
Abstract Let PG(k−1, q) be the projective geometry of dimension k−1 over the finite field GF(q) where q is a prime power. The flat spaces of PG(k−1, q) may be characterized by the following Theorem .
Short minimal codes and covering codes via strong blocking sets in projective spaces
This paper proves an upper bound on the minimal length of minimal codes of dimension k over the q-element Galois field which is linear in both q and k, hence improve the previous superlinear bounds.
Lines in Higgledy-Piggledy Arrangement
It is proved that a set of lines in $\mathsf{PG}(d,\mathbb{F})$ meeting each hyperplane in a generator set of points has to contain at least $\lfloor1.5d\rfloor$ lines, proving that the lower bound is tight over algebraically closed fields.
On cutting blocking sets and their codes
This work improves on the upper bound of the smallest size of certain saturating sets and on the minimum length of a minimal $q$-ary linear code having dimension $4$ and $6$.
Minimal linear codes arising from blocking sets
This paper generalizes some recent constructions of minimal linear codes which are not based on Ashikhmin–Barg’s condition and presents a family of codes arising from particular blocking sets, which are well-studied combinatorial objects.
Linear nonbinary covering codes and saturating sets in projective spaces
The key tool in the investigation is the design of new small saturating sets in projective spaces over finite fields, which are used as the starting point for the $q$m-concatenating constructions of covering codes.