Recursive constructions for s-resolvable t-designs

DOI10.1007/S10623-019-00653-6zbMATH Open1434.05024OpenAlexW2953145868WikidataQ127653841 ScholiaQ127653841MaRDI QIDQ2334440FDOQ2334440

Authors: Tran van Trung 

Publication date: 7 November 2019

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-019-00653-6

Recommendations

• A recursive construction for simple \(t\)-designs using resolutions
• Resolvable \(t\)-designs
• An extending theorem for \(s\)-resolvable \(t\)-designs
• A construction for resolvable designs and its generalizations
• Recursive constructions for 3-designs and resolvable 3-designs
• Publication:4723750
• Simple \(t\)-designs: a recursive construction for arbitrary \(t\)
• scientific article; zbMATH DE number 749295
• Some tuple system constructions with applications to resolvable designs

zbMATH Keywords

recursive constructionsimple \(t\)-design\(s\)-resolvable

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Cites Work

• The CRC handbook of combinatorial designs
• Title not available (Why is that?)
• Title not available (Why is that?)
• New large sets of \(t\)-designs
• Title not available (Why is that?)
• Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
• Some friends of Alltop's designs \(4\)-\((2^f+1,5,5)\)
• Some new 2-resolvable Steiner quadruple systems
• Locally trivial t-designs and t-designs without repeated blocks
• Combining \(t\)-designs
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• Extending large sets of \(t\)-designs
• On the construction of \(t\)-designs and the existence of some new infinite families of simple 5-designs
• New infinite families of simple 5-designs
• A family of 4-designs with block size 9
• A new family of 4-designs
• Title not available (Why is that?)
• Simple \(t\)-designs: a recursive construction for arbitrary \(t\)
• On the existence of an infinite family of simple 5-designs
• A recursive construction for simple \(t\)-designs using resolutions
• An infinite class of 4-designs
• Semiregular large sets
• Title not available (Why is that?)
• New large sets oft-designs with prescribed groups of automorphisms
• Steiner systems with automorphism groups \(PSL(2,71)\), \(PSL(2,83)\), and \(P\Sigma L(2,3^5)\)
• Title not available (Why is that?)

Cited In (17)

• Resolvability of infinite designs
• On t‐designs and s‐resolvable t‐designs from hyperovals
• A method of constructing 2-resolvable \(t\)-designs for \(t=3,4\)
• Construction of 3-designs using \((1,\sigma)\)-resolution
• Retracted article: ``Constructions for \(t\)-designs and \(s\)-resolvable \(t\)-designs
• Recursive constructions for 3-designs and resolvable 3-designs
• An extending theorem for \(s\)-resolvable \(t\)-designs
• Title not available (Why is that?)
• On resolvable designs \(S_ 3(3;4,v)\)
• On simple 3-designs having 2-resolutions
• Point-missing \(s\)-resolvable \(t\)-designs: infinite series of 4-designs with constant index
• Partially balanced t-designs
• Resolvable \(t\)-designs
• A recursive construction for simple \(t\)-designs using resolutions
• Simple \(t\)-designs: a recursive construction for arbitrary \(t\)
• Resolutions of the designs in two infinite series of 4-designs
• A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs

This page was built for publication: Recursive constructions for \(s\)-resolvable \(t\)-designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2334440)