Abstract
Let V n (q) denote a vector space of dimension n over the field with q elements. A set \({\mathcal{P}}\) of subspaces of V n (q) is a partition of V n (q) if every nonzero vector in V n (q) is contained in exactly one subspace in \({\mathcal{P}}\). A uniformly resolvable design is a pairwise balanced design whose blocks can be resolved in such a way that all blocks in a given parallel class have the same size. A partition of V n (q) containing a i subspaces of dimension n i for 1 ≤ i ≤ k induces a uniformly resolvable design on q n points with a i parallel classes with block size \(q^{n_i}\), 1 ≤ i ≤ k, and also corresponds to a factorization of the complete graph \(K_{q^n}\) into \(a_i K_{q^{n_i}}\) -factors, 1 ≤ i ≤ k. We present some sufficient and some necessary conditions for the existence of certain vector space partitions. For the partitions that are shown to exist, we give the corresponding uniformly resolvable designs. We also show that there exist uniformly resolvable designs on q n points where corresponding partitions of V n (q) do not exist.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Beutelspacher A. (1978). Partitions of finite vector spaces: an application of the Frobenius number in geometry. Arch. Math. 31, 202–208
Bu T. (1980). Partitions of a vector space. Discrete Math. 31, 79–83
Clark W., Dunning L. (1992). Partial partitions of vector spaces arising from the construction of byte error control codes. Ars Combin. 33, 161–177
Danziger P., Rodney P. (1996). Uniformly resolvable designs. In: Colbourn C.J., Dinitz J.H. (eds) The CRC Handbook of Combinatorial Designs. CRC Press Series on Discrete Mathematics and its Applications. CRC Press, Boca Raton, pp. 490–492
El-Zanati S.I., Seelinger G.F., Sissokho P.A., Spence L.E., Vanden Eynden C.: On partitions of finite vector spaces of small dimension over GF(2). Discrete Math. (to appear).
El-Zanati S.I., Seelinger G.F., Sissokho P.A., Spence L.E., Vanden Eynden C.: Partitions of finite vector spaces into subspaces. J. Combin. Design (to appear).
Heden O. (1984). On partitions of finite vector spaces of small dimensions. Arch. Math. 43, 507–509
Heden O. (1986). Partitions of finite abelian groups. Eur. J. Combin. 7, 11–25
Rees R. (1987). Uniformly resolvable pairwise balanced designs with block sizes two and three. J. Comb. Theory Ser. A 45, 207–225
Shen H. (1996). Existence of resolvable group divisible designs with block size four and group size two or three. J. Shanghai Jiaotong Univ. (Engl. Ed.) 1, 68–70
Tannenbaum P. (1983). Partitions of \({\mathbb{Z}}_2^n\). SIAM J. Alg. Disc. 4, 22–29
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by L. Teirlinck.
A. D. Blinco—Part of this research was done while the author was visiting Illinois State University.
Rights and permissions
About this article
Cite this article
Blinco, A.D., El-Zanati, S.I., Seelinger, G.F. et al. On vector space partitions and uniformly resolvable designs. Des. Codes Cryptogr. 48, 69–77 (2008). https://doi.org/10.1007/s10623-008-9199-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-008-9199-1