AbstractWe investigate the existence of some large sets of size nine. We take advantage of the recursive and direct constructing method to show that in cases LS[9](2,4,v) the trivial necessary condition is also sufficient. In particular LS[9](2,4,29) is constructed. This fills a gap
Let N(t; v; k; ) be the maximum possible number of mutually disjoint cyclic t- (v; k; ) designs. In...
AbstractIn this paper, we establish the correctness of a conjecture by Hartman on the existence of l...
A new probabilistic technique for establishing the existence of certain regular combinatorial struct...
AbstractA large set of t-(v,k,λ) designs of size N, denoted by LS[N](t,k,v), is a partition of all k...
AbstractWe investigate the existence of some large sets of size nine. We take advantage of the recur...
AbstractThe method of partitionable sets for constructing large sets of t-designs have now been used...
Abstract: We construct several new large sets of t-designs that are invariant under Frobenius groups...
AbstractA large set of disjoint S(λ; t, k, v) designs, denoted by LS(λ; t, k, v), is a partition of ...
AbstractA large set of disjointS(λ; t, k, v) designs, denoted byLS(λ; t, k, v), is a partition ofk-s...
AbstractA large set of t-(v,k,λ) designs of size N, denoted by LS[N](t,k,v), is a partition of all k...
AbstractThe method of partitionable sets for constructing large sets of t-designs have now been used...
We introduce generalizations of earlier direct methods for constructing large sets of t\Gammadesigns...
In this paper, we show how the basis reduction algorithm of Kreher and Radziszowski [4] can be used ...
AbstractRecent results in the search for simple t-designs and large sets of t-designs are reported. ...
AbstractA large set of disjoint S(λ; t, k, v) designs, denoted by LS(λ; t, k, v), is a partition of ...
Let N(t; v; k; ) be the maximum possible number of mutually disjoint cyclic t- (v; k; ) designs. In...
AbstractIn this paper, we establish the correctness of a conjecture by Hartman on the existence of l...
A new probabilistic technique for establishing the existence of certain regular combinatorial struct...
AbstractA large set of t-(v,k,λ) designs of size N, denoted by LS[N](t,k,v), is a partition of all k...
AbstractWe investigate the existence of some large sets of size nine. We take advantage of the recur...
AbstractThe method of partitionable sets for constructing large sets of t-designs have now been used...
Abstract: We construct several new large sets of t-designs that are invariant under Frobenius groups...
AbstractA large set of disjoint S(λ; t, k, v) designs, denoted by LS(λ; t, k, v), is a partition of ...
AbstractA large set of disjointS(λ; t, k, v) designs, denoted byLS(λ; t, k, v), is a partition ofk-s...
AbstractA large set of t-(v,k,λ) designs of size N, denoted by LS[N](t,k,v), is a partition of all k...
AbstractThe method of partitionable sets for constructing large sets of t-designs have now been used...
We introduce generalizations of earlier direct methods for constructing large sets of t\Gammadesigns...
In this paper, we show how the basis reduction algorithm of Kreher and Radziszowski [4] can be used ...
AbstractRecent results in the search for simple t-designs and large sets of t-designs are reported. ...
AbstractA large set of disjoint S(λ; t, k, v) designs, denoted by LS(λ; t, k, v), is a partition of ...
Let N(t; v; k; ) be the maximum possible number of mutually disjoint cyclic t- (v; k; ) designs. In...
AbstractIn this paper, we establish the correctness of a conjecture by Hartman on the existence of l...
A new probabilistic technique for establishing the existence of certain regular combinatorial struct...
DOI
Add to ORKG