AbstractLet b⊆Vk be a t −(υ, kλ)-design and M ⊆ v with t ⩽ m := |M|. Then we call for 0⩽j⩽mαj=|{B∈b|B∩M|=j}| the jth intersection number of M in b. In this paper is proved, that αj=λz.ccirf;υ − tk − t-1⋅∑r=jt(-1)rrjmrυ − rk − r ++(-1)t+kj+1⋅∑r=0m−1−tt+r−jrt+r−1jαt+r+1 holds for 0⩽j⩽m and arbitary M ⊆ V with t ⩽ m=|M|. from these equations one can derive several necessary conditions for the existence of t-designs and also non-existence theorems. Weproved here for instance the followin
AbstractA λ-design is a system of subsets S1, S2,…, Sn from an n-set S, n > 3, where |Si ∩ Sj| = λ f...
This thesis is an exposition of Sylvia Hobart\u27s article On a Characterization of t-designs in ter...
This thesis is an exposition of Sylvia Hobart\u27s article On a Characterization of t-designs in ter...
We discuss Ray-Chaudhari and Wilson inequality for a 0-design and give simple proof of the result...
We discuss Ray-Chaudhari and Wilson inequality for a 0-design and give simple proof of the result '\...
It is shown that for v sufficiently large and $k\geqq 2t + 1$, for any feasible quadruple $t - ( v ,...
We prove that if there exists a t - (v, k, λ) design satisfying the inequality (Formula Presented) f...
It is shown that for v sufficiently large and $k\geqq 2t + 1$, for any feasible quadruple $t - ( v ,...
AbstractWe give a method to obtain new i-designs from t-designs with j distinct intersection numbers...
AbstractWe give a method to obtain new i-designs from t-designs with j distinct intersection numbers...
AbstractThree extension theorems for t-designs are proved; two for t even, and one for t odd. Anothe...
Combinatorial configurations have significant applications in many areas, such as in the design of e...
We derive an inequality for 0-designs which holds with equality iff the design is a t-design. This i...
Combinatorial configurations have significant applications in many areas, such as in the design of e...
Combinatorial configurations have significant applications in many areas, such as in the design of e...
AbstractA λ-design is a system of subsets S1, S2,…, Sn from an n-set S, n > 3, where |Si ∩ Sj| = λ f...
This thesis is an exposition of Sylvia Hobart\u27s article On a Characterization of t-designs in ter...
This thesis is an exposition of Sylvia Hobart\u27s article On a Characterization of t-designs in ter...
We discuss Ray-Chaudhari and Wilson inequality for a 0-design and give simple proof of the result...
We discuss Ray-Chaudhari and Wilson inequality for a 0-design and give simple proof of the result '\...
It is shown that for v sufficiently large and $k\geqq 2t + 1$, for any feasible quadruple $t - ( v ,...
We prove that if there exists a t - (v, k, λ) design satisfying the inequality (Formula Presented) f...
It is shown that for v sufficiently large and $k\geqq 2t + 1$, for any feasible quadruple $t - ( v ,...
AbstractWe give a method to obtain new i-designs from t-designs with j distinct intersection numbers...
AbstractWe give a method to obtain new i-designs from t-designs with j distinct intersection numbers...
AbstractThree extension theorems for t-designs are proved; two for t even, and one for t odd. Anothe...
Combinatorial configurations have significant applications in many areas, such as in the design of e...
We derive an inequality for 0-designs which holds with equality iff the design is a t-design. This i...
Combinatorial configurations have significant applications in many areas, such as in the design of e...
Combinatorial configurations have significant applications in many areas, such as in the design of e...
AbstractA λ-design is a system of subsets S1, S2,…, Sn from an n-set S, n > 3, where |Si ∩ Sj| = λ f...
This thesis is an exposition of Sylvia Hobart\u27s article On a Characterization of t-designs in ter...
This thesis is an exposition of Sylvia Hobart\u27s article On a Characterization of t-designs in ter...