On the sunflower bound for k-spaces, pairwise intersecting in a point

Abstract: A

t

-intersecting constant dimension subspace code

C

is a set of

k

-dimensional subspaces in a projective space PG(n,q), where distinct subspaces intersect in a

t

-dimensional subspace. A classical example of such a code is the sunflower, where all subspaces pass through the same

t

-space. The sunflower bound states that such a code is a sunflower if

| C | > l e f t (f r a c q^{k + 1} - q^{t + 1} q - 1 i g h t)^{2} + l e f t (f r a c q^{k + 1} - q^{t + 1} q - 1 i g h t) + 1

. In this article we will look at the case

t = 0

and we will improve this bound for

q g e q 9

: a set

m a t h c a l S

of

k

-spaces in PG(n,q),

q g e q 9

, pairwise intersecting in a point is a sunflower if

| m a t h c a l S | > l e f t (f r a c 2 s q r t [6] q + f r a c 4 s q r t [3] q - f r a c 5 s q r t q i g h t) l e f t (f r a c q^{k + 1} - 1 q - 1 i g h t)^{2}

.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: On the sunflower bound for \(k\)-spaces, pairwise intersecting in a point