DOIAbstract
AbstractIn this paper it is shown that if v ⩾ k + 1 then v ⩾ t − 1 + (k − t + 1)(k − t + 2)λ, where v, k, λ and t are the characteristic parameters of a t − (v, k, λ) design. We compare this bound with the known lower bounds on v
AbstractIn this paper it is shown that if v ⩾ k + 1 then v ⩾ t − 1 + (k − t + 1)(k − t + 2)λ, where v, k, λ and t are the characteristic parameters of a t − (v, k, λ) design. We compare this bound with the known lower bounds on v
AbstractWe discuss 2-(υ, k, λ) designs with two intersecion numbers the larger of which is λ. We sho...
We derive the subdegrees for a t-design in projective spaces X=FPd−1(F=ℝ,ℂ,ℍ,O). The design may carr...
AbstractA λ-design is a system of subsets S1, S2,…, Sn from an n-set S, n > 3, where |Si ∩ Sj| = λ f...
In this paper it is shown that if v k + 1 then v t - 1 + (k - t + 1)(k - t + 2)/¿, where v, k, ¿ and...
In this paper it is shown that if v k + 1 then v t - 1 + (k - t + 1)(k - t + 2)/¿, where v, k, ¿ and...
In this paper it is shown that if v k + 1 then v t - 1 + (k - t + 1)(k - t + 2)/¿, where v, k, ¿ and...
In this paper it is shown that if v k + 1 then v t - 1 + (k - t + 1)(k - t + 2)/¿, where v, k, ¿ and...
AbstractIn this paper it is shown that if v ⩾ k + 1 then v ⩾ t − 1 + (k − t + 1)(k − t + 2)λ, where ...
We prove that if there exists a t - (v, k, λ) design satisfying the inequality (Formula Presented) f...
The aim of this paper is to give a new combinatorial proof of Fisher’s inequality and to prove that ...
AbstractThe aim of this paper is to give a new combinatorial proof of Fisher’s inequality and to pro...
Abstractt−(2k, k, λ) designs having a property similar to that of Hadamard 3-designs are studied. We...
Let B be a family of k-subsets of a v-set V , with 1 less-than-or-equal-to k less-than-or-equal-to v...
Unitary t-designs provide a method to simplify integrating polynomials of degree less than t over U(...
AbstractA triple system of order v+w and index λ embeds a P3-design on v points if there is a subset...
AbstractWe discuss 2-(υ, k, λ) designs with two intersecion numbers the larger of which is λ. We sho...
We derive the subdegrees for a t-design in projective spaces X=FPd−1(F=ℝ,ℂ,ℍ,O). The design may carr...
AbstractA λ-design is a system of subsets S1, S2,…, Sn from an n-set S, n > 3, where |Si ∩ Sj| = λ f...
In this paper it is shown that if v k + 1 then v t - 1 + (k - t + 1)(k - t + 2)/¿, where v, k, ¿ and...
In this paper it is shown that if v k + 1 then v t - 1 + (k - t + 1)(k - t + 2)/¿, where v, k, ¿ and...
In this paper it is shown that if v k + 1 then v t - 1 + (k - t + 1)(k - t + 2)/¿, where v, k, ¿ and...
In this paper it is shown that if v k + 1 then v t - 1 + (k - t + 1)(k - t + 2)/¿, where v, k, ¿ and...
AbstractIn this paper it is shown that if v ⩾ k + 1 then v ⩾ t − 1 + (k − t + 1)(k − t + 2)λ, where ...
We prove that if there exists a t - (v, k, λ) design satisfying the inequality (Formula Presented) f...
The aim of this paper is to give a new combinatorial proof of Fisher’s inequality and to prove that ...
AbstractThe aim of this paper is to give a new combinatorial proof of Fisher’s inequality and to pro...
Abstractt−(2k, k, λ) designs having a property similar to that of Hadamard 3-designs are studied. We...
Let B be a family of k-subsets of a v-set V , with 1 less-than-or-equal-to k less-than-or-equal-to v...
Unitary t-designs provide a method to simplify integrating polynomials of degree less than t over U(...
AbstractA triple system of order v+w and index λ embeds a P3-design on v points if there is a subset...
AbstractWe discuss 2-(υ, k, λ) designs with two intersecion numbers the larger of which is λ. We sho...
We derive the subdegrees for a t-design in projective spaces X=FPd−1(F=ℝ,ℂ,ℍ,O). The design may carr...
AbstractA λ-design is a system of subsets S1, S2,…, Sn from an n-set S, n > 3, where |Si ∩ Sj| = λ f...
Add to ORKG