Construction of 3-designs using \((1,\sigma)\)-resolution
From MaRDI portal
Publication:326330
DOI10.3934/amc.2016022zbMath1348.05035arXiv1603.02025OpenAlexW2963572313MaRDI QIDQ326330
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
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Recursive constructions for 3-designs and resolvable 3-designs