A~TRACT. The following result is proved: Let D be a quasi-symmetric 3-design with intersection numbers x, y(0 ~< x < y < k). D has no three distinct blocks such that any two of them intersect in x points if and only if D is a Hadamard 3-design, or D has a parameter set (v, k, 2
Quasi-symmetric designs related to the triangular graph
β Scribed by M. J. Coster; W. H. Haemers
- Publisher
- Springer
- Year
- 1995
- Tongue
- English
- Weight
- 657 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0925-1022
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Simple solutions of these matrix equations are easy to find; we describe ways of cortstructing rather messy ones. Our investigations are motivated by an intimate relationship between the pairs X, Y and minimal imperfect graphs.
Quasi-symmetric triangle-free designs D with block intersection numbers 0 and y and with no three mutually disjoint blocks are studied. It is shown that the parameters of D are expressible in terms of only two parameters y and m, where m = k/y, k being the block size. Baartmans and Shrikhande prove
We obtain necessary conditions for the existence of a 2 -(v, k, X) design, for which the block intersection sizes sl, s 2 ..... s n satisfy s I ---s 2 ~ ... -Sn -m s (modpe), where p is a prime and the exponent e is odd. These conditions are obtained from restriction on the Smith Normal Form of the
We examine the graph ( G , ) , where the vertices are given by the elements of the conjugacy class of the finite group G , and then adjacency ( Ο³ ) given by Ο³ u Γ― both u 2 and u 2 are involutions and u ΟΆ . In particular , under certain conditions on the pair ( G , ) we may derive from ( G , ) a sec
We give a characterization of codes meeting the Grey Rankin bound. When the codes have even length, the existence of such codes is equivalent to the existence of certain quasi-symmetric designs. We also find the parameters of all linear codes meeting the Grey Rankin bound. ## 1997 Academic Press T