Large incidence-free sets in geometries

Abstract

Let Π = (P,L,I) denote a rank two geometry. In this paper, we are interested in the largest value of |X||Y| where X ⊂ P and Y ⊂ L are sets such that (X×Y)∩I = ∅. Let α(Π) denote this value. We concentrate on the case where P is the point set of PG(n,q) and L is the set of k-spaces in PG(n,q). In the case that Π is the projective plane PG(2,q), Haemers proved that maximal arcs in projective planes together with the set of lines not intersecting the maximal arc determine α(PG(2,q)) when q is an even power of 2. Therefore, in those cases, We give both a short combinatorial proof and a linear algebraic proof of this result, and consider the analogous problem in generalized polygons. More generally, if P is the point set of PG(n,q) and L is the set of k-spaces in PG(n,q), where 1 ≤ k ≤ n-1, and Πq= (P,L,I), then we show as q → ∞ that The upper bounds are proved by combinatorial and spectral techniques. This leaves the open question as to the smallest possible value of α(Π) for each value of k. We prove that if for each N ∈ N, ΠN is a partial linear space with N points and N lines, then, as N → ∞.