|
|
|
|
ON THE NUMBER OF MUTUALLY DISJOINT CYCLIC DESIGNS
|
|
|
|
|
|
|
|
نویسنده
|
امامی مژگان ,ناصریان عذرا
|
|
منبع
|
transactions on combinatorics - 2014 - دوره : 3 - شماره : 1 - صفحه:7 -13
|
|
چکیده
|
We denote by ls[n](t; k; v) a large set of t-(v; k; ) designs of size n, which is a partitionof all k-subsets of a v-set into n disjoint t-(v; k; ) designs and n = ??v??tk??t=. we use the notationn(t; v; k; ) as the maximum possible number of mutually disjoint cyclic t-(v; k; )designs. in this paperwe give some new bounds for n(2; 29; 4; 3) and n(2; 31; 4; 2). consequently we present new large setsls[9](2; 4; 29); ls[13](2; 4; 29) and ls[7](2; 4; 31), where their existences were already known.
|
|
کلیدواژه
|
Large Se ,t-Design ,Kramer-Mesner Matrix
|
|
آدرس
|
zanjan university, Department of Mathematics, University of Zanjan, P O Box 45371-38791, Zanjan, Iran, ایران, zanjan university, Department of Mathematics, University of Zanjan, P O Box 45371-38791, Zanjan, Iran, ایران
|
|
پست الکترونیکی
|
o.naserian@znu.ac.ir
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|