Triangle decompositions of PG(n,2)

We define a triangle design as a partition of the set of $2$-dimensional subspaces of an n-dimensional vector space into triangles, where a triangle consists of three subspaces with the trivial, $0$-dimensional, intersection and $1$-dimensional mutual intersections. A triangle design is balanced if all nonzero vectors are involved in the same number of triangles. Over the binary field GF$(2)$, we construct balanced triangle designs for all admissible n (congruent to $1$ modulo $6$) and an infinite class of balanced block-divisible triangle designs. We also prove that the existence of a triangle design over GF$(2)$ invariant under the action of the Singer cycle group is equivalent to the existence of a partition of Z2ⁿ-1\0\ into special $18$-subsets and find such designs for $n=7$, $13$, $19$.