• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Designs, Codes and Cryptography >H-designs with the properties of resolvability or (1, 2)-resolvability
【24h】

H-designs with the properties of resolvability or (1, 2)-resolvability

机译：具有可分辨性或（1、2）可分辨性的H设计

获取原文
获取原文并翻译 | 示例
       
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

An H-design is said to be (1, α)-resolvable, if its block set can be partitioned into α-parallel classes, each of which contains every point of the design exactly α times. When α = 1, a (1, α)-resolvable H-design of type g n is simply called a resolvable H-design and denoted by RH(g n ), for which the general existence problem has been determined leaving mainly the case of g ≡ 0 (mod 12) open. When α = 2, a (1, 2)-RH(1 n ) is usually called a (1, 2)-resolvable Steiner quadruple system of order n, for which the existence problem is far from complete. In this paper, we consider these two outstanding problems. First, we prove that an RH(12 n ) exists for all n ≥ 4 with a small number of possible exceptions. Next, we give a near complete solution to the existence problem of (1, 2)-resolvable H-designs with group size 2. As a consequence, we obtain a near complete solution to the above two open problems.
机译：如果H-design的块集可以划分为α-平行类，则每个H-design可以分解为（1，α），每个类都包含设计中的每个点正好α次。当α= 1时，类型为g n 的（1，α）可分解H-design简称为可分解H-design，用RH（g n ）表示，已经确定了普遍存在问题，主要是使g≡0（mod 12）的情况保持打开状态。当α= 2时，通常将（1，2）-RH（1 n ）称为n阶（1，2）可解析的Steiner四元系统，存在问题远非如此。完成。在本文中，我们考虑了这两个突出的问题。首先，我们证明对于所有n≥4都存在RH（12 n ），只有少数可能的例外。接下来，我们给出组大小为2的（1，2）可分解H-设计的存在问题的几乎完全解决方案。结果，我们获得了上述两个开放问题的几乎完全解决方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号