Skip to main content
Log in

Quasi-symmetric 2, 3, 4-designs

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

Quasi-symmetric designs are block designs with two block intersection numbersx andy It is shown that with the exception of (x, y)=(0, 1), for a fixed value of the block sizek, there are finitely many such designs. Some finiteness results on block graphs are derived. For a quasi-symmetric 3-design with positivex andy, the intersection numbers are shown to be roots of a quadratic whose coefficients are polynomial functions ofv, k and λ. Using this quadratic, various characterizations of the Witt—Lüneburg design on 23 points are obtained. It is shown that ifx=1, then a fixed value of λ determines at most finitely many such designs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A. Baartmans andM. S. Shrikhande, Designs with no three mutually disjoint blocks,Discrete Math. 40 (1982), 129–139.

    Article  MATH  MathSciNet  Google Scholar 

  2. P. J. Cameron, Extending Symmetric designs,J. Combin. Theory (A),14 (1973), 215–220.

    Article  MATH  MathSciNet  Google Scholar 

  3. P. J. Cameron, Near regularity conditions for designs,Geometriae Dedicata 2 (1973), 213–223.

    Article  MATH  MathSciNet  Google Scholar 

  4. P. J. Cameron andJ. H. Van Lint,Graphs, Codes and Designs, London Math. Soc. Lecture Note Series,43 (1980).

  5. P. Delsarte, An algebraic approach to the association schemes of coding theory,Philips Res. Repts, Supp. 10 (1973).

  6. A. Hedayat andS. Kageyama, The family oft-designs — Part I,J. Statist. Plann. and Inference 4 (1980), 173–212.

    Article  MATH  MathSciNet  Google Scholar 

  7. R. Holliday, Quasi-symmetric designs withy=λ,Congressus Numerantum 48 (1985), 195–201.

    MathSciNet  Google Scholar 

  8. N. Ito, On tight 4-designs,Osaka J. Math. 12 (1975), 493–522.

    MATH  MathSciNet  Google Scholar 

  9. S. Kageeyama andA. Hedayat, The family oft-designs — Part II,J. Statist. Plann. and Inference 7 (1983), 257–287.

    Article  Google Scholar 

  10. C. W. H. Lam, L. Thiel, S. Swiercz andJ. McKay, The non-existence of ovals in the projective plane of order 10,Discrete Math. 45 (1983), 319–321.

    Article  MathSciNet  Google Scholar 

  11. N. B. Limaye, S. S. Sane andM. S. Shrikhande, The structure of triangle-free quasi-symmetric designs,Discrete Math. 64 (1987), 199–207.

    Article  MATH  MathSciNet  Google Scholar 

  12. D. K. Ray-Chaudhuri andR. M. Wilson, Ont-designs,Osaka J. of Math. 12 (1975), 737–744.

    MATH  MathSciNet  Google Scholar 

  13. S. S. Sane andM. S. Shrikhande, Finiteness questions in quasi-symmetric designs,J. Combin. Theory (A),42 (1986), 252–258.

    Article  MATH  MathSciNet  Google Scholar 

  14. M. S. Shrikhande, Designs with triangle-free graph,in: Proceedings of the seminar on combinatorics and Graph Theory in honor of S. S. Shrikhande at the Indian Statistical Institute, Calcutta, (1982), 334–339.

  15. M. S. Shrikhande, A survey of some problems in combinatorial designs — a matrix approach,Linear Algebra and Appl.,79 (1986), 215–247.

    Article  MATH  MathSciNet  Google Scholar 

  16. R. M. Wilson, On the theory oft-designs,in: Enumeration and Designs, Academic Press (1984) 19–49.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sane, S.S., Shrikhande, M.S. Quasi-symmetric 2, 3, 4-designs. Combinatorica 7, 291–301 (1987). https://doi.org/10.1007/BF02579306

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02579306

AMS subject classification (1980)

Navigation