Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

DCC

2008

IEEE

2008

IEEE

Let Vn(q) denote a vector space of dimension n over the field with q elements. A set P of subspaces of Vn(q) is a partition of Vn(q) if every nonzero vector in Vn(q) is contained in exactly one subspace in 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 Vn(q) containing ai subspaces of dimension ni for 1 i k induces a uniformly resolvable design on qn points with ai parallel classes with block size qni , 1 i k, and also corresponds to a factorization of the complete graph Kqn into ai Kqni 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 qn points where corresponding partitions of Vn(q) do not exist. Part of th...

Related Content

Added |
25 Dec 2009 |

Updated |
25 Dec 2009 |

Type |
Conference |

Year |
2008 |

Where |
DCC |

Authors |
Andrew Blinco, Saad El-Zanati, G. F. Seelinger, P. A. Sissokho, L. E. Spence, Charles Vanden Eynden |

Comments (0)