On the linearity of higher-dimensional blocking sets

Details On the linearity of higher-dimensional blocking sets On the linearity of higher-dimensional blocking sets

2012-01-16

arxiv.org/abs/1201.3300v1

Electron. J. Combin. 17 (2010), no. 1, Research Paper 174

Mathematics

Combinatorics

Scientific paper

A small minimal k-blocking set B in PG(n, q), q = pt, p prime, is a set of less than 3(qk + 1)/2 points in PG(n, q), such that every (n - k)-dimensional space contains at least one point of B and such that no proper subset of B satisfies this property. The linearity conjecture states that all small minimal k-blocking sets in PG(n, q) are linear over a subfield Fpe of Fq. Apart from a few cases, this conjecture is still open. In this paper, we show that to prove the linearity conjecture for k- blocking sets in PG(n, pt), with exponent e and pe \geq 7, it is sufficient to prove it for one value of n that is at least 2k. Furthermore, we show that the linearity of small minimal blocking sets in PG(2, q) implies the linearity of small minimal k-blocking sets in PG(n, pt), with exponent e, with pe \geq t/e + 11.

Affiliated with

Also associated with

No associations

Rating

On the linearity of higher-dimensional blocking sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the linearity of higher-dimensional blocking sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the linearity of higher-dimensional blocking sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-410423