Skip to main content

New Small 4-Designs with Nonabelian Automorphism Groups

  • Conference paper
  • First Online:
Book cover Mathematical Aspects of Computer and Information Sciences (MACIS 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10693))

Abstract

We prove the existence of designs with parameters 4-(18, 9, 56), 4-(18, 9, 70), 4-(19, 9, 84), and 4-(19, 9, 105) by assuming suitable automorphism groups and performing a computer search using the method of Kramer and Mesner.

This work has been fully supported by the Croatian Science Foundation under the project 1637.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Araya, M., Harada, M.: Mutually disjoint Steiner systems \(S(5,8,24)\) and \(5\)-\((24,12,48)\) designs. Electron. J. Comb. 17, #N1 (2010)

    Google Scholar 

  2. Araya, M., Harada, M., Tonchev, V.D., Wassermann, A.: Mutually disjoint designs and new \(5\)-designs derived from groups and codes. J. Comb. Des. 18(4), 305–317 (2010)

    MathSciNet  MATH  Google Scholar 

  3. The GAP Group, GAP - Groups, Algorithms, and Programming, Version 4.8.7 (2017). http://www.gap-system.org

  4. Khosrovshahi, G.B., Laue, R.: \(t\)-designs with \(t\ge 3\). In: Colbourn, C.J., Dinitz, J.F. (eds.) The Handbook of Combinatorial Designs, 2nd edn., pp. 79–101. Chapman & Hall/CRC, Boca Raton (2007)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Krčadinac, V.: Some new designs with prescribed automorphism groups. J. Comb. Des. (2017, to appear)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Östergård, P.R.J., Pottonen, O.: There exists no Steiner system \(S(4,5,17)\). J. Comb. Theory Ser. A 115(8), 1570–1573 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Stinson, D.R., Swanson, C.M., van Trung, T.: A new look at an old construction: constructing (simple) \(3\)-designs from resolvable \(2\)-designs. Discrete Math. 325, 23–31 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  10. van Trung, T.: Simple \(t\)-designs: a recursive construction for arbitrary \(t\). Des. Codes Cryptogr. 83(3), 493–502 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  11. Wassermann, A.: Finding simple \(t\)-designs with enumeration techniques. J. Comb. Des. 6(2), 79–90 (1998)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mario Osvin Pavčević .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Krčadinac, V., Pavčević, M.O. (2017). New Small 4-Designs with Nonabelian Automorphism Groups. In: Blömer, J., Kotsireas, I., Kutsia, T., Simos, D. (eds) Mathematical Aspects of Computer and Information Sciences. MACIS 2017. Lecture Notes in Computer Science(), vol 10693. Springer, Cham. https://doi.org/10.1007/978-3-319-72453-9_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-72453-9_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-72452-2

  • Online ISBN: 978-3-319-72453-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics