The Intersection Problem for Kite-GDDs of Type 2^(u)  

作　　者：Yonghong AN Guizhi ZHANG 

机构地区：[1]College of Continuing Education,Hulunbuir University,Inner Mongolia 021008,P.R.China [2]Division of Science and Technology,Hulunbuir University,Inner Mongolia 021008,P.R.China

出　　处：《Journal of Mathematical Research with Applications》2021年第6期551-564,共14页数学研究及应用（英文版）

基　　金：Supported by the National Natural Science Foundation of China(Grant No.11601137);the Research Program of Science and Technology at Universities of Inner Mongolia Autonomous Region(Grant Nos.NJZY19231,NJZZ21052).

摘　　要：The intersection problem for kite-GDDs is the determination of all pairs(T,s)such that there exists a pair of kite-GDDs(X,H,B_(1))and(X,H,B_(2))of the same type T satisfying|B_(1)∩B_(2)|=s.In this paper the intersection problem for a pair of kite-GDDs of type 2^(u)is investigated.Let J(u)={s:■a pair of kite-GDDs of type 2^(u)intersecting in s blocks};I(u)={0,1,...,b_(u)-2,b_(u)},where b_(u)=u(u-1)/2 is the number of blocks of a kite-GDD of type 2^(u).We show that for any positive integer u≥4,J(u)=I(u)and J(3)={0,3}.

关 键 词：kite-GDD group divisible design intersection number 

分 类 号：O157.5[理学—数学]