Construction of 3-designs using (1,)-resolution
From MaRDI portal
Publication:326330
DOI10.3934/AMC.2016022zbMATH Open1348.05035arXiv1603.02025OpenAlexW2963572313MaRDI QIDQ326330FDOQ326330
Authors: Tran van Trung
Publication date: 12 October 2016
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Abstract: The paper deals with recursive constructions for simple 3-designs based on other 3-designs having -resolution. The concept of -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 -resolvability of the constructed designs.
Full work available at URL: https://arxiv.org/abs/1603.02025
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On resolvable designs \(S_ 3(3;4,v)\)
- Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
- The existence of simple \(S_ 3(3,4,\nu)\)
- Resolvable \(t\)-designs
- Construction of 3-designs using parallelism
- Unifying some known infinite families of combinatorial 3-designs
- A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs
- Some friends of Alltop's designs \(4\)-\((2^f+1,5,5)\)
- Title not available (Why is that?)
- Recursive constructions for 3-designs and resolvable 3-designs
Cited In (1)
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)