组合设计的大集  

On Large Sets of Combinatorial Designs

作　　者：康庆德[1] 

机构地区：[1]河北师范大学数学研究所,石家庄河北中国050016

出　　处：《数学进展》2003年第3期269-284,共16页Advances in Mathematics（China）

基　　金：国家自然科学基金(19831050);河北省自然科学基金(103146)

摘　　要：组合设计中的大集问题有着悠久的历史和广泛的应用。由于它的难度,长期进展很慢。近二十多年来,在一些新的方法和手段的推动下,大集研究呈现了很好的态势。本文力图对几类主要组合设计大集的概念和研究进展给予概要介绍,以期引起更多的关注。The large set problem in the combinatorial design theory has a long history and a variety of applications. The related research work had been quite slow in making progress for a long period of time due to its sophistication. Being benefited and motivated by some new methodology the research in the large set problem has taken on a promising posture in recent twenty years. Hoping that more attention will be attracted to the problem, in the present paper we try to give a comprehensive summary of the concepts and development in the large set problem.

关 键 词：组合设计 大集 三元系 T-设计 Mendelsohn设计 Directed设计 元集 图设计 拉丁方 正交表 直交表 有序设计 

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