Skip to main content
SpringerLink
Log in

Non-embeddable quasi-residual quasi-symmetric designs

  • Original Paper
  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

Quasi-symmetric (36, 16, 12) designs with intersection numbers \(x=6\), \(y=8\) that cannot be embedded in symmetric (64, 28, 12) designs as residuals are constructed.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alraqad, T.A., Shrikhande, M.S.: An overview of embedding problems of quasi-residual designs. J. Stat. Theory Pract. 3(2), 319–347 (2009)

    Article  MathSciNet  Google Scholar 

  2. Assmus Jr., E.F., Key, J.D.: Designs and Their Codes. Cambridge University Press, Cambridge (1992)

    Book  Google Scholar 

  3. Beth, T., Jungnickel, D., Lenz, H.: Design Theory, 2nd edn. Cambridge University Press, Cambridge (1999)

    Book  Google Scholar 

  4. Bhattacharya, K.N.: A new balanced incomplete block design. Sci. Cult. 9, 508 (1944)

    MathSciNet  Google Scholar 

  5. Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symb. Comput. 24(3–4), 235–265 (1997)

    Article  MathSciNet  Google Scholar 

  6. Bracken, C., McGuire, G., Ward, H.: New quasi-symmetric designs constructed using mutually orthogonal Latin squares and Hadamard matrices. Des. Codes Cryptogr. 41(2), 195–198 (2006)

    Article  MathSciNet  Google Scholar 

  7. Colbourn, C.J., Dinitz, J.H. (eds.): Handbook of Combinatorial Designs, 2nd edn. CRC, Boca Raton (2007)

    MATH  Google Scholar 

  8. Ding, Y., Houghten, S., Lam, C., Smith, S., Thiel, L., Tonchev, V.D.: Quasi-symmetric $2$-$(28,12,11)$ designs with an automorphism of order $7$. J. Comb. Des. 6(3), 213–223 (1998)

    Article  MathSciNet  Google Scholar 

  9. Jungnickel, D., Tonchev, V.D.: On symmetric and quasi-symmetric designs with the symmetric difference property and their codes. J. Comb. Theory Ser. A 59(1), 40–50 (1992)

    Article  MathSciNet  Google Scholar 

  10. Kantor, W.M.: Symplectic groups, symmetric designs, and line ovals. J. Algebra 33, 43–58 (1975)

    Article  MathSciNet  Google Scholar 

  11. Kramer, E.S., Mesner, D.M.: $t$-designs on hypergraphs. Discrete Math. 15, 263–296 (1976)

    Article  MathSciNet  Google Scholar 

  12. Krčadinac, V., Vlahović, R.: New quasi-symmetric designs by the Kramer–Mesner method. Discrete Math. 339(12), 2884–2890 (2016)

    Article  MathSciNet  Google Scholar 

  13. Krčadinac, V., Vlahović Kruc, R.: Quasi-symmetric designs on 56 points. Adv. Math. Commun. (2019). https://doi.org/10.3934/amc.2020086

    Article  MATH  Google Scholar 

  14. Lam, C., Thiel, L., Tonchev, V.D.: On quasi-symmetric $2$-$(28,12,11)$ and $2$-$(36,16,12)$ designs. Des. Codes Cryptogr. 5(1), 43–55 (1995)

    Article  MathSciNet  Google Scholar 

  15. Mathon, R., Rosa, A.: $2$-$(v, k,\lambda )$ designs of small order. In: Colbourn, C.J., Dinitz, J.H. (eds.) The Handbook of Combinatorial Designs, 2nd edn, pp. 25–58. CRC, Boca Raton (2007)

    MATH  Google Scholar 

  16. McDonough, T.P., Mavron, V.C., Ward, H.N.: Amalgams of designs and nets. Bull. Lond. Math. Soc. 41(5), 841–852 (2009)

    Article  MathSciNet  Google Scholar 

  17. McKay, B.D., Piperno, A.: Practical graph isomorphism, II. J. Symb. Comput. 60, 94–112 (2014)

    Article  MathSciNet  Google Scholar 

  18. Niskanen, S., Östergård, P.R.J.: Cliquer user’s guide, version 1.0. Communications Laboratory, Helsinki University of Technology, Espoo, Finland, Tech. Rep. T48 (2003)

  19. Östergård, P.R.J.: A fast algorithm for the maximum clique problem. Discrete Appl. Math. 120(1–3), 197–207 (2002)

    Article  MathSciNet  Google Scholar 

  20. Shrikhande, M.S.: Quasi-symmetric designs. In: Colbourn, C.J., Dinitz, J.H. (eds.) The Handbook of Combinatorial Designs, 2nd edn, pp. 578–582. CRC Press, Boca Raton (2007)

    Google Scholar 

  21. Shrikhande, M.S., Alraqad, T.A.: Recent results on families of symmetric designs and non-embeddable quasi-residual designs. In: Crnković, D., Tonchev, V. (eds.) Information Security, Coding Theory and Related Combinatorics, NATO Sci. Peace Secur. Ser. D Inf. Commun. Secur., vol. 29, pp. 363–403. IOS, Amsterdam (2011)

  22. Shrikhande, M.S., Sane, S.S.: Quasi-symmetric Designs. Cambridge University Press, Cambridge (1991)

    Book  Google Scholar 

  23. The GAP Group: GAP—Groups, Algorithms, and Programming, Version 4.8.10. http://www.gap-system.org (2018)

  24. van Trung, T.: Non-embeddable quasi-residual designs with $k<\frac{1}{2} v$. J. Comb. Theory Ser. A 43(1), 133–137 (1986)

    Article  Google Scholar 

Download references

Acknowledgements

This work has been supported by the Croatian Science Foundation under the Project 6732.

Author information

Authors and Affiliations

  1. Department of Mathematics, Faculty of Science, University of Zagreb, Bijenička 30, 10000, Zagreb, Croatia

    Vedran Krčadinac

Authors
  1. Vedran Krčadinac
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vedran Krčadinac.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Krčadinac, V. Non-embeddable quasi-residual quasi-symmetric designs. AAECC 33, 477–483 (2022). https://doi.org/10.1007/s00200-020-00463-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-020-00463-7

Keywords

Search

Navigation