2019
DOI: 10.1002/jcd.21675
|View full text |Cite
|
Sign up to set email alerts
|

Decomposable super‐simple RBIBDs with block size 4 and index 6

Abstract: Necessary conditions for the existence of a decomposable super‐simple resolvable (v,4,6)‐BIBD whose two component subdesigns are both resolvable (v,4,3)‐BIBDs are v≡0 (mod 4) and v≥16. In this paper, it is proved that these necessary conditions are sufficient, except possibly for v∈{268,284,292,296}.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5

Relationship

3
2

Authors

Journals

citations
Cited by 6 publications
(16 citation statements)
references
References 26 publications
0
16
0
Order By: Relevance
“…Hence we can apply Construction 3.4 with l=4 $l=4$ to obtain 3‐decomposable super‐simple (4,6) $(4,6)$‐GDDs of types 367161 $3{6}^{7}1{6}^{1}$, 367321 $3{6}^{7}3{2}^{1}$, 367161241 $3{6}^{7}1{6}^{1}2{4}^{1}$, and 367161281 $3{6}^{7}1{6}^{1}2{8}^{1}$. From [35], a 3‐decomposable super‐simple (u,4,6) $(u,4,6)$‐BIBD exists for each uMathClass-open{16,24,28,32,36MathClass-close} $u\in \{16,24,28,32,36\}$; hence we can apply Construction 3.5 with b=0 $b=0$ to obtain the required 3‐decomposable super‐simple (v,4,6) $(v,4,6)$‐BIBDs. □…”
Section: Proof Of the Main Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…Hence we can apply Construction 3.4 with l=4 $l=4$ to obtain 3‐decomposable super‐simple (4,6) $(4,6)$‐GDDs of types 367161 $3{6}^{7}1{6}^{1}$, 367321 $3{6}^{7}3{2}^{1}$, 367161241 $3{6}^{7}1{6}^{1}2{4}^{1}$, and 367161281 $3{6}^{7}1{6}^{1}2{8}^{1}$. From [35], a 3‐decomposable super‐simple (u,4,6) $(u,4,6)$‐BIBD exists for each uMathClass-open{16,24,28,32,36MathClass-close} $u\in \{16,24,28,32,36\}$; hence we can apply Construction 3.5 with b=0 $b=0$ to obtain the required 3‐decomposable super‐simple (v,4,6) $(v,4,6)$‐BIBDs. □…”
Section: Proof Of the Main Resultsmentioning
confidence: 99%
“…In [38], it is proved that there exists a 3‐decomposable super‐simple (v,4,6) $(v,4,6)$‐BIBD which is near‐resolvable whenever v1(mod4) $v\equiv 1\,(\mathrm{mod}\,4)$ and v17 $v\ge 17$. In [35], it is proved that there exists a 3‐decomposable super‐simple (v,4,6) $(v,4,6)$‐BIBD which is resolvable whenever v0(mod4) $v\equiv 0\,(\mathrm{mod}\,4)$ and v16 $v\ge 16$, with four possible exceptions (v=268,284,292,296) $(v=268,284,292,296)$. The readers may refer [5] for the definitions of a near‐resolvable BIBD and a resolvable BIBD.…”
Section: Proof Of the Main Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…To obtain the main results, we need the following constructions. These constructions and their analogues are used to construct decomposable super-simple designs in [23,24,33,35] In this section, Theorem 1.4 will be proved. For direct constructions of λ-decomposable supersimple λ (4, 2 )-GDDs of type g u with ∈ λ {2, 4}, we will use Z gu as the set of points and take the groups as…”
Section: There Exists Amentioning
confidence: 99%