A t-(υ, k, λ) design is a set of υ points together with a collection of its k-subsets called blocks so that all subsets of t points are contained in exactly λ blocks. The d-dimensional projective geometry over GF(q), PG(d, q) is a 2 - (q~d + q~(d-1) + … + q + 1, q + 1, 1) design when we take its points as the points of the design and its lines as the blocks of the design. A 2-(υ, k, 1) design is said to be resolvable if the blocks can be partitioned as R = {R_1, R_2, …, R_s}, where s = (υ - 1)/(k - 1) and each R_i consists of υ/k disjoint blocks. If a resolvable design has an automorphism σ which acts as a cycle of length υ on the points and R~σ = R, then the design is said to be point-cyclically resolvable. The design associated with PG(5, 2) is known to be resolvable and in this paper, it is shown to be point-cyclically resolvable by enumerating all inequivalent resolutions which are invariant under a cyclic automorphism group G = <σ> where σ is a cycle of length 63. These resolutions are the only resolutions which admit a point-transitive automorphism group. Furthermore, some necessary conditions for the point-cyclic resolvability of 2-(υ, k, 1) designs are also given.
展开▼
