Abstract
In this paper we show that Lander's coding-theoretic proof of (parts of) the Bruck-Ryser-Chowla Theorem can be suitably modified to obtain analogous number theoretic restrictions on the parameters of quasi-symmetric designs. These results may be thought of as extensions to odd primes of the recent binary nonexistence results due to Calderbank et al. The results in this paper kill infinitely many feasible parameters for quasi-symmetric designs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bhagwandas and S.S. Shrikhande, Duals of incomplete block designs, J. Indian Statist. Assoc 3 (1965), 30–37.
R.H. Bruck and H.J. Ryser, The nonexistence of certain finite projective planes, Can. J. Math. 1 (1949), 88–93.
A.R. Calderbank, The application of invariant theory to the existence of quasi-symmetric designs, J. Combin. Theory (ser. A) 44 (1987), 94–109.
A.R. Calderbank, Geometric invariants for quasi-symmetric designs, J. Combin. Theory (ser. A) 47 (1988), 101–110.
A.R. Calderbank and P. Frankl, Binary codes and quasi-symmetric designs, Discrete Math. 83 (1990), 201–204.
P.J. Cameron and J.H. van Lint, Graphs, codes and designs, London Math. Soc. Lecture Note 43, Cambridge Univ. Press, Cambridge, 1980.
L.C. Chang, Association schemes of partially balanced block designs with parameters v = 28, n 1, = 12, n 2 = 15 and p 11 2 = 4, Sci. Record Peking Math, (new ser.) 4 (1960), 12–18.
S. Chowla and H.J. Ryser, Combinatorial problems, Can. J. Math. 2 (1950), 93–99.
W.S. Connor, Jr. and M. Hall, Jr., An embedding theorem for balanced incomplete block designs, Can. J. Math. 6 (1953), 35–41.
W.S. Connor, Jr., The uniqueness of the triangular association scheme, Ann. Math. Statist. 29 (1958), 262–266.
J.M. Goethals and J.J. Seidel, Strongly regular graphs derived from combinatorial designs, Can. J. Math. 22 (1970), 597–614.
W. Haemers, Eigenvalue techniques in design and graph theory, Math. Centrum Tract, Amsterdam, 1979.
W. Haemers. Some non-existence results for quasi-symmetric block designs, R.C. Bose memorial conference, Calcutta, 1988.
A.J. Hoffman, On the uniqueness of the triangular association scheme, Ann. Math. Statist. 31(1960), 492–497.
A.J. Hoffman, On eigenvalues and colorings of graphs, in Graph Theory and Its Applications (B. Harris, ed.), Academic Press, New York, 1970.
D.R. Hughes and F.C. Piper, Design Theory, Cambridge Univ. Press, Cambridge, 1985.
E.S. Lander, Symmetric designs: An algebraic approach, London Math. Soc. Lecture Note ser. 74, Cambridge Univ. Press, Cambridge, 1983.
K. Mukherjea, Personal communication, 1991.
A. Neumaier, Regular sets and quasi-symmetric 2-designs, in Combinatorial Theory (D. Jungnickel and K. Vedder, eds.), Lecture Notes in Math. 969, Springer Verlag, New York, 1982.
S.S. Shirkhande, The impossibility of certain symmetrical balanced incomplete block designs, Ann. Math. Statist. 21 (1950), 106–111.
S.S. Shrikhande, On a characterisation of the triangular association scheme, Ann. Math. Statist. 30 (1959), 39–47.
V.D. Tonchev, Quasi-symmetric designs and self dual codes, Euro. J. Combin. 7 (1986), 67–73.
Author information
Authors and Affiliations
Additional information
Communicated by S.A. Vanstone
Rights and permissions
About this article
Cite this article
Bagchi, B. On quasi-symmetric designs. Des Codes Crypt 2, 69–79 (1992). https://doi.org/10.1007/BF00124210
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00124210