Pawale, R.M. and S.S. Sane, A short p,oof of a conjecture on quasi-symmetric 2-designs, Discrete Mathematics 96 (1991) 71-74. It was conjettured by Sane and M.S. Shrikhande that the only nontrivial quasi-symmetric 3-design with the smaller block intersection number one is either the Witt 4-(23, 7,
On a conjecture of jungnickel and tonchev for quasi-symmetric designs
โ Scribed by Yury J. Ionin; Mohan S. Shrikhande
- Publisher
- John Wiley and Sons
- Year
- 1994
- Tongue
- English
- Weight
- 582 KB
- Volume
- 2
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
โฆ Synopsis
Jungnickel and Tonchev conjectured in [4] that if a quasi-symmetric design D is an s-fold quasi-multiple of a symmetric (v,k, A) design with (k, (sl)A) = 1, then D is a multiple. We prove this conjecture under any one of the conditions: s 5 7, k -1 is prime, or the design D is a 3-design. It is shown that for any fixed s, the conjecture is true with at most finitely many exceptions. The unique quasi-symmetric 3-(22,7,4) design is characterized as the only quasi-symmetric 3-design, which as a 2-design is an s-fold quasi-multiple with s = 1 (mod k).
๐ SIMILAR VOLUMES
Triangle-free quasi-symmetric 2-(v, k,k) designs with intersection numbers x, y; 01, are investigated. It is proved that k โฅ 2 yx -3. As a consequence it is seen that for fixed k, there are finitely many triangle-free quasi-symmetric designs. It is also proved that: k โค y( yx)+ x.
We show that a family of cyclic Hadamard designs defined from regular ovals is a sub-family of a class of difference set designs due to B.
All quasi-symmetric 2-(28, 12, 11) designs with an automorphism of order 7 without fixed points or blocks are enumerated. Up to isomorphism, there are exactly 246 such designs. All but four of these designs are embeddable as derived designs in symmetric 2-(64, 28, 12) designs, producing in this way
## Abstract It is wellโknown that the number of designs with the parameters of a classical design having as blocks the hyperplanes in __PG__(__n, q__) or __AG__(__n, q__), __n__โฅ3, grows exponentially. This result was extended recently [D. Jungnickel, V. D. Tonchev, Des Codes Cryptogr, published on