Premium
New type of block design
Author(s) -
Mendelsohn N. S.,
Liang M.
Publication year - 2002
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.10031
Subject(s) - mathematics , equivalence (formal languages) , block (permutation group theory) , type (biology) , combinatorics , class (philosophy) , difference set , discrete mathematics , arithmetic , computer science , artificial intelligence , abelian group , ecology , biology
We are already familiar with (υ, k, λ)‐difference sets and (υ, k, λ)‐designs. In this paper, we will introduce a new class of difference sets and designs: (υ, k, [λ 1 , λ 2 , … , λ m ])‐difference sets and (υ, k, [λ 1 ,λ 2 , … , λ m ])‐designs. We will mainly study designs with a relationship we call λ‐equivalence and use them to produce other designs. Some existence or nonexistence theorems will be given. © 2002 Wiley Periodicals, Inc. J Combin Designs 11: 1–23, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10031