Some 2-(2n+1,n,n-1) designs with multiple extensions
| dc.contributor.author | Breach, Derrick Rodney | |
| dc.date.accessioned | 2015-12-16T00:14:48Z | |
| dc.date.available | 2015-12-16T00:14:48Z | |
| dc.date.issued | 1978 | en |
| dc.description.abstract | A 2-(2n+1,n,λ) design can always be extended to a 3-(2n+2,n+1,λ) design by complementation. If λ is large enough there may.be other methods of extension. By constructing non-self-complementary 3-(18,9,7) designs it is shown that there is a 2-(17,8,7) design with 16 extensions. The method generalises to construct non-self complementary 3-(2n+2,n+1,n-1) designs for larger values of n. | en |
| dc.identifier.uri | http://hdl.handle.net/10092/11626 | |
| dc.language.iso | en | |
| dc.publisher | University of Canterbury. Dept. of Mathematics | en |
| dc.relation.isreferencedby | NZCU | |
| dc.rights | Copyright Derrick Rodney Breach | en |
| dc.subject.anzsrc | Field of Research::01 - Mathematical Sciences | en |
| dc.title | Some 2-(2n+1,n,n-1) designs with multiple extensions | en |
| dc.type | Discussion / Working Papers | |
| uc.bibnumber | 106580 | |
| uc.college | Faculty of Engineering |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- breach_report_no14_1978.pdf
- Size:
- 594.07 KB
- Format:
- Adobe Portable Document Format