AbstractA cyclic 5-(13, 6, 4) design is constructed and is extended to a simple 6-(14, 7, 4) design via a theorem of Alltop. This design is the smallest possible nontrivial simple 6-design that can exist. Both have full automorphism group cyclic of order 13
AbstractA t-(ν, k, λ) design is a pair (X, B), where B is a collection of k-subsets (called blocks) ...
AbstractIn this paper, the concept of an extended (2, 4)-design is introduced. An extended (2, 4)-de...
A t-design (X, ℬ) is a υ-set X together with a family ℬ of k-subsets from X, called blocks, such tha...
AbstractA cyclic 5-(13, 6, 4) design is constructed and is extended to a simple 6-(14, 7, 4) design ...
AbstractIn this paper, we employ trades to produce some new 6-(14, 7, 4) designs with three automorp...
AbstractThree extension theorems for t-designs are proved; two for t even, and one for t odd. Anothe...
Even though Peltesohn proved that a cyclic (v,3,1)-design exists if and only if $v\equiv 1,3\pmod{6}...
AbstractLet S′ be a simple S′λ(t, k, l) containing b′blocks and let S be a, not necessarily simple, ...
In 1976, Kramer and Mesner observed that finding a t-design with a given automorphism group can be r...
A 4-(12, 6, 4) design that is not also a 5-(12, 6, 1) design must have at least one pair of blocks w...
We enumerate by computer algorithms all simple t (t +7, t +1, 2) designs for 1 \u3c= t \u3c= 5, i.e....
AbstractA general construction for Steiner 2-designs with prime power block size (and with a point-r...
AbstractA t-design (X, B) is a υ-set X together with a family B of k-subsets from X, called blocks, ...
AbstractWe construct a family of simple 4-designs with parameters 4−(2ƒ+1,9,84), (f,6)=1, f⩾5
AbstractLet L be a lattice of dimension n≤24 such that the minimal vectors of L form a 6-design and ...
AbstractA t-(ν, k, λ) design is a pair (X, B), where B is a collection of k-subsets (called blocks) ...
AbstractIn this paper, the concept of an extended (2, 4)-design is introduced. An extended (2, 4)-de...
A t-design (X, ℬ) is a υ-set X together with a family ℬ of k-subsets from X, called blocks, such tha...
AbstractA cyclic 5-(13, 6, 4) design is constructed and is extended to a simple 6-(14, 7, 4) design ...
AbstractIn this paper, we employ trades to produce some new 6-(14, 7, 4) designs with three automorp...
AbstractThree extension theorems for t-designs are proved; two for t even, and one for t odd. Anothe...
Even though Peltesohn proved that a cyclic (v,3,1)-design exists if and only if $v\equiv 1,3\pmod{6}...
AbstractLet S′ be a simple S′λ(t, k, l) containing b′blocks and let S be a, not necessarily simple, ...
In 1976, Kramer and Mesner observed that finding a t-design with a given automorphism group can be r...
A 4-(12, 6, 4) design that is not also a 5-(12, 6, 1) design must have at least one pair of blocks w...
We enumerate by computer algorithms all simple t (t +7, t +1, 2) designs for 1 \u3c= t \u3c= 5, i.e....
AbstractA general construction for Steiner 2-designs with prime power block size (and with a point-r...
AbstractA t-design (X, B) is a υ-set X together with a family B of k-subsets from X, called blocks, ...
AbstractWe construct a family of simple 4-designs with parameters 4−(2ƒ+1,9,84), (f,6)=1, f⩾5
AbstractLet L be a lattice of dimension n≤24 such that the minimal vectors of L form a 6-design and ...
AbstractA t-(ν, k, λ) design is a pair (X, B), where B is a collection of k-subsets (called blocks) ...
AbstractIn this paper, the concept of an extended (2, 4)-design is introduced. An extended (2, 4)-de...
A t-design (X, ℬ) is a υ-set X together with a family ℬ of k-subsets from X, called blocks, such tha...
DOI
Add to ORKG