Classifying Sets of Type (4,<i>n</i>) in PG(3,<i>q</i>)

Abstract

In the present work, we classify sets of type (4,n) in PG(3,q). We prove that PG(3,q), apart from the planes of PG(3,3), contains only sets of type (4,n) with standard parameters. Thus, somewhat surprisingly, we conclude that there are no sets of type (4,n) in PG(3,q), q ≠ 3, with non-standard parameters.

Keywords

• two-character sets
• two-intersection sets
• projective linear two-weight codes
• strongly regular graphs