当前位置: X-MOL 学术J. Comb. Des. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Exceptions and characterization results for type‐1 λ‐designs
Journal of Combinatorial Designs ( IF 0.7 ) Pub Date : 2020-05-18 , DOI: 10.1002/jcd.21723
Ajeet Kumar Yadav 1 , Rajendra M. Pawale 1 , Mohan S. Shrikhande 2
Affiliation  

Let X be a finite set with v elements, called points and β be a family of subsets of X , called blocks. A pair ( X , β ) is called λ ‐design whenever β = X and
  • 1. for all B i , B j β , i j , B i B j = λ ;
  • 2. for all B j β , B j = k j > λ , and not all k j are equal.
The only known examples of λ ‐designs are so‐called type‐1 designs, which are obtained from symmetric designs by a certain complementation procedure. Ryser and Woodall had independently conjectured that all λ ‐designs are type‐1. Let r , r * ( r > r * ) be replication numbers of a λ ‐design D = ( X , β ) and g = gcd ( r 1 , r * 1 ) , m = gcd ( ( r r * ) g , λ ) , and m = m , if m is odd and m = m 2 , otherwise. For distinct points x and y of D , let λ ( x , y ) denote the number of blocks of X containing x and y . We strengthen a lemma of S.S. Shrikhande and N.M. Singhi and use it to prove that if r ( r 1 ) ( v 1 ) k ( r r * ) m ( v 1 ) are not integers for k = 1 , 2 , , m 1 , then D is type‐1. As an application of these results, we show that for fixed positive integer θ there are finitely many nontype‐1 λ ‐designs with r = r * + θ . If r r * = 27 or r r * = 4 p and r * ( p 1 ) 2 , or v = 7 p + 1 such that p 1 , 13 ( mod 21 ) and p 4 , 9 , 19 , 24 ( mod 35 ) , where p is a positive prime, then D is type‐1. We further obtain several inequalities involving λ ( x , y ) , where equality holds if and only if D is type‐1.


中文翻译:

类型1λ设计的异常和特征化结果

X v 元素,称为点和 β 是...的子集的家庭 X ,称为方块。一双 X β 叫做 λ 随时设计 β = X
  • 1. 所有人 一世 Ĵ β 一世 Ĵ 一世 Ĵ = λ ;
  • 2. 所有人 Ĵ β Ĵ = ķ Ĵ > λ ,而不是全部 ķ Ĵ 相等。
唯一已知的例子 λ 设计是所谓的1类设计,它是通过某种补充程序从对称设计中获得的。Ryser和Woodall独立推测 λ 设计是类型1。让 [R [R * [R > [R * 是一个的复制号 λ -设计 d = X β G = 光盘 [R - 1个 [R * - 1个 = 光盘 [R - [R * G λ = 如果 是奇数 = 2 , 除此以外。对于不同点 X ÿ d ,让 λ X ÿ 表示的块数 X 包含 X ÿ 。我们加强了SS Shrikhande和NM Singhi的引理,并用它证明了 [R [R - 1个 v - 1个 - ķ [R - [R * v - 1个 不是整数 ķ = 1个 2 - 1个 , 然后 d 是类型1。作为这些结果的应用,我们表明对于固定正整数 θ 非类型1的数量有限 λ -设计 [R = [R * + θ 。如果 [R - [R * = 27 要么 [R - [R * = 4 p [R * p - 1个 2 , 要么 v = 7 p + 1个 这样 p 1个 13 21 p 4 9 19 24 35 ,在哪里 p 是一个正素数,那么 d 是类型1。我们进一步获得了涉及 λ X ÿ ,当且仅当D为type-1时,等式成立。
更新日期:2020-05-18
down
wechat
bug