首页 | 本学科首页   官方微博 | 高级检索  
     检索      


On defining sets of full designs
Authors:James Lefevre  Mary Waterhouse
Institution:
  • Department of Mathematics, The University of Queensland, St Lucia Qld 4072, Australia
  • Abstract:A defining set of a t-(v,k,λ) design is a subcollection of its blocks which is contained in a unique t-design with the given parameters on a given v-set. A minimal defining set is a defining set, none of whose proper subcollections is a defining set. The spectrum of minimal defining sets of a design D is the set {|M|∣M is a minimal defining set of D}. The unique simple design with parameters View the MathML source is said to be the full design on v elements; it comprises all possible k-tuples on a v set. We provide two new minimal defining set constructions for full designs with block size k≥3. We then provide a generalisation of the second construction which gives defining sets for all k≥3, with minimality satisfied for k=3. This provides a significant improvement of the known spectrum for designs with block size three. We hypothesise that this generalisation produces minimal defining sets for all k≥3.
    Keywords:Defining sets  Full designs  Pairwise balance design
    本文献已被 ScienceDirect 等数据库收录!
    设为首页 | 免责声明 | 关于勤云 | 加入收藏

    Copyright©北京勤云科技发展有限公司  京ICP备09084417号