Sane, Sharad (2001) A proof of the Jungnickel-Tonchev conjecture on quasi-multiple quasi-symmetric designs Designs, Codes and Cryptography, 23 (3). pp. 291-296. ISSN 0925-1022
Full text not available from this repository.
Official URL: http://www.springerlink.com/content/x71q07244x8612...
Related URL: http://dx.doi.org/10.1023/A:1011266910342
Abstract
A proof of the following conjecture of Jungnickel and Tonchev on quasi-multiple quasi-symmetric designs is given: Let D be a design whose parameter set (v',b',r',k',λ') equals (v,sv,sk,k, sλ) for some positive integer s and for some integers v,k,λ that satisfy λ(v-1) = k(k-1) (that is, these integers satisfy the parametric feasibility conditions for a symmetric (v,k,λ)-design). Further assume that D is a quasi-symmetric design, that is D has at most two block intersection numbers. If (k,λ (s-1)) = 1, then the only way D can be constructed is by taking multiple copies of a symmetric (v,k,λ)-design.
Item Type: | Article |
---|---|
Source: | Copyright of this article belongs to Springer. |
Keywords: | Block Intersection Numbers; Symmetric Designs; Quasi-symmetric Designs; Quasi-multiples; Multiples; Proper Quasi-multiple Designs |
ID Code: | 68023 |
Deposited On: | 02 Nov 2011 03:11 |
Last Modified: | 02 Nov 2011 03:11 |
Repository Staff Only: item control page