The 3-way intersection problem for S(2, 4, v) designs

zbMATH Open1368.05015arXiv1301.4764MaRDI QIDQ5273085FDOQ5273085

Authors: Saeedeh Rashidi, Nasrin Soltankhah 

Publication date: 5 July 2017

Abstract: In this paper the 3-way intersection problem for $S(2,4,v)$ designs is investigated. Let $b_v=fracv(v-1)12$ and $I_3[v]=0,1,\mathrm{...},b_{v}setminus{b}_v-7,b_v-6,b_v-5,b_v-4,b_v-3,b_v-2,b_v-1$. Let $$ there exist three $S(2,4,v)$ designs with $k$ same common blocks$$. We show that $J_3[v]subseteq{I}_3[v]$ for any positive integer $vequiv1,4(mmod12)$ and $J_3[v]=I_3[v]$, for $vgeq49$ and $v=13$. We find $J_3[16]$ completely. Also we determine some values of $J_3[v]$ for $v=25,28,37$ and 40.

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

Recommendations

• The triangle intersection problem for \(S(2,4,v)\) designs
• scientific article; zbMATH DE number 3912394
• scientific article; zbMATH DE number 3939376
• Steiner quadruple systems having a prescribed number of quadruples in common
• scientific article; zbMATH DE number 800299

zbMATH Keywords

tradeGDD\(S(2, 4, v)\) design3-way intersection

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Triple systems (05B07)

Cited In (11)

• The 4-way intersection problem for kite systems
• The triangle intersection problem for \(S(2,4,v)\) designs
• The fine triangle intersection problem for \((K_4 - e)\)-designs
• The 3-way flower intersection problem for Steiner triple systems
• Title not available (Why is that?)
• The 3-way intersection problem for kite systems
• On the 3-way \((v,k,2)\) Steiner trades
• Title not available (Why is that?)
• The 3-way intersection problem for Kirkman triple systems
• On the volume of \(\mu\)-way \(G\)-trade
• The triangle intersection numbers of a pair of disjoint \(S(2,4,v)\)s

This page was built for publication: The 3-way intersection problem for \(S(2, 4, v)\) designs

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