Construction of 3-designs using (1,)-resolution

DOI10.3934/AMC.2016022MaRDI QIDQ326330zbMATH OpenOpenAlexFDO

Authors Tran van Trung

Publication date 12 October 2016

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1603.02025

zbMATH Keywords

\((1,\sigma)\)-resolution3-designrecursive construction

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Abstract: The paper deals with recursive constructions for simple 3-designs based on other 3-designs having $(1,sigma)$-resolution. The concept of $(1,sigma)$-resolution may be viewed as a generalization of the parallelism for designs. We show the constructions and their applications to produce many previously unknown infinite families of simple 3-designs. We also include a discussion of $(1,sigma)$-resolvability of the constructed designs.

Recommendations

• Unifying some known infinite families of combinatorial 3-designs
• On simple 3-designs having 2-resolutions
• Recursive constructions for 3-designs and resolvable 3-designs
• A recursive construction for simple \(t\)-designs using resolutions
• Recursive constructions for \(s\)-resolvable \(t\)-designs

Cites work

• scientific article; zbMATH DE number 3478938 (Why is no real title available?)
• scientific article; zbMATH DE number 867473 (Why is no real title available?)
• scientific article; zbMATH DE number 3205799 (Why is no real title available?)
• scientific article; zbMATH DE number 3305585 (Why is no real title available?)
• scientific article; zbMATH DE number 3097793 (Why is no real title available?)
• A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs
• Construction of 3-designs using parallelism
• On resolvable designs \(S_ 3(3;4,v)\)
• Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
• Recursive constructions for 3-designs and resolvable 3-designs
• Resolvable t-designs
• Some friends of Alltop's designs \(4\)-\((2^f+1,5,5)\)
• The existence of simple \(S_ 3(3,4,\nu)\)
• Unifying some known infinite families of combinatorial 3-designs

Cited in

(1)

• A recursive construction for simple \(t\)-designs using resolutions

This page was built for publication: Construction of 3-designs using \((1,\sigma)\)-resolution

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