求助PDF
{"title":"λ$\\lambda$-可分解超简单(4,2λ)$(4,2\\lambda)$-GDD的存在性类型g u${g}^{u}$,λ=2,4$\\lambda=2,4$","authors":"Huangsheng Yu, Jingyuan Chen, R. Julian R. Abel, Dianhua Wu","doi":"10.1002/jcd.21881","DOIUrl":null,"url":null,"abstract":"<p>A design is said to be <i>super-simple</i> if the intersection of any two of its blocks has at most two elements. A design with index <math>\n <semantics>\n <mrow>\n <mi>t</mi>\n <mi>λ</mi>\n </mrow>\n <annotation> $t\\lambda $</annotation>\n </semantics></math> is said to be <math>\n <semantics>\n <mrow>\n <mi>λ</mi>\n </mrow>\n <annotation> $\\lambda $</annotation>\n </semantics></math>-<i>decomposable</i>, if its blocks can be partitioned into nonempty collections <math>\n <semantics>\n <mrow>\n <msub>\n <mi>ℬ</mi>\n <mi>i</mi>\n </msub>\n </mrow>\n <annotation> ${{\\rm{ {\\mathcal B} }}}_{i}$</annotation>\n </semantics></math>, <math>\n <semantics>\n <mrow>\n <mn>1</mn>\n <mo>≤</mo>\n <mi>i</mi>\n <mo>≤</mo>\n <mi>t</mi>\n </mrow>\n <annotation> $1\\le i\\le t$</annotation>\n </semantics></math>, such that each <math>\n <semantics>\n <mrow>\n <msub>\n <mi>ℬ</mi>\n <mi>i</mi>\n </msub>\n </mrow>\n <annotation> ${{\\rm{ {\\mathcal B} }}}_{i}$</annotation>\n </semantics></math> with the point set forms a design with index <math>\n <semantics>\n <mrow>\n <mi>λ</mi>\n </mrow>\n <annotation> $\\lambda $</annotation>\n </semantics></math>. In this paper, it is proved that for <math>\n <semantics>\n <mrow>\n <mi>λ</mi>\n <mo>∈</mo>\n <mrow>\n <mo>{</mo>\n <mrow>\n <mn>2</mn>\n <mo>,</mo>\n <mn>4</mn>\n </mrow>\n <mo>}</mo>\n </mrow>\n </mrow>\n <annotation> $\\lambda \\in \\{2,4\\}$</annotation>\n </semantics></math>, there exists a <math>\n <semantics>\n <mrow>\n <mi>λ</mi>\n </mrow>\n <annotation> $\\lambda $</annotation>\n </semantics></math>-decomposable super-simple <math>\n <semantics>\n <mrow>\n <mrow>\n <mo>(</mo>\n <mrow>\n <mn>4</mn>\n <mo>,</mo>\n <mn>2</mn>\n <mi>λ</mi>\n </mrow>\n <mo>)</mo>\n </mrow>\n </mrow>\n <annotation> $(4,2\\lambda )$</annotation>\n </semantics></math>-GDD of type <math>\n <semantics>\n <mrow>\n <msup>\n <mi>g</mi>\n <mi>u</mi>\n </msup>\n </mrow>\n <annotation> ${g}^{u}$</annotation>\n </semantics></math> if and only if <math>\n <semantics>\n <mrow>\n <mi>u</mi>\n <mo>≥</mo>\n <mn>4</mn>\n </mrow>\n <annotation> $u\\ge 4$</annotation>\n </semantics></math>, <math>\n <semantics>\n <mrow>\n <mi>g</mi>\n <mrow>\n <mo>(</mo>\n <mrow>\n <mi>u</mi>\n <mo>−</mo>\n <mn>2</mn>\n </mrow>\n <mo>)</mo>\n </mrow>\n <mo>≥</mo>\n <mn>2</mn>\n <mi>λ</mi>\n </mrow>\n <annotation> $g(u-2)\\ge 2\\lambda $</annotation>\n </semantics></math> and <math>\n <semantics>\n <mrow>\n <mi>g</mi>\n <mrow>\n <mo>(</mo>\n <mrow>\n <mi>u</mi>\n <mo>−</mo>\n <mn>1</mn>\n </mrow>\n <mo>)</mo>\n </mrow>\n <mo>≡</mo>\n <mspace></mspace>\n <mn>0</mn>\n <mspace></mspace>\n <mrow>\n <mo>(</mo>\n <mrow>\n <mi>mod</mi>\n <mspace></mspace>\n <mn>3</mn>\n </mrow>\n <mo>)</mo>\n </mrow>\n </mrow>\n <annotation> $g(u-1)\\equiv \\,0\\,(\\mathrm{mod}\\,3)$</annotation>\n </semantics></math>, except for <math>\n <semantics>\n <mrow>\n <mrow>\n <mo>(</mo>\n <mrow>\n <mi>g</mi>\n <mo>,</mo>\n <mi>u</mi>\n <mo>,</mo>\n <mi>λ</mi>\n </mrow>\n <mo>)</mo>\n </mrow>\n <mo>=</mo>\n <mrow>\n <mo>(</mo>\n <mrow>\n <mn>3</mn>\n <mo>,</mo>\n <mn>5</mn>\n <mo>,</mo>\n <mn>2</mn>\n </mrow>\n <mo>)</mo>\n </mrow>\n </mrow>\n <annotation> $(g,u,\\lambda )=(3,5,2)$</annotation>\n </semantics></math>, and except possibly for <math>\n <semantics>\n <mrow>\n <mrow>\n <mo>(</mo>\n <mrow>\n <mi>g</mi>\n <mo>,</mo>\n <mi>u</mi>\n <mo>,</mo>\n <mi>λ</mi>\n </mrow>\n <mo>)</mo>\n </mrow>\n <mo>∈</mo>\n <mrow>\n <mo>{</mo>\n <mrow>\n <mrow>\n <mo>(</mo>\n <mrow>\n <mn>2</mn>\n <mo>,</mo>\n <mn>7</mn>\n <mo>,</mo>\n <mn>2</mn>\n </mrow>\n <mo>)</mo>\n </mrow>\n <mo>,</mo>\n <mrow>\n <mo>(</mo>\n <mrow>\n <mn>6</mn>\n <mo>,</mo>\n <mn>5</mn>\n <mo>,</mo>\n <mn>4</mn>\n </mrow>\n <mo>)</mo>\n </mrow>\n </mrow>\n <mo>}</mo>\n </mrow>\n </mrow>\n <annotation> $(g,u,\\lambda )\\in \\{(2,7,2),(6,5,4)\\}$</annotation>\n </semantics></math>.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"31 6","pages":"289-303"},"PeriodicalIF":0.5000,"publicationDate":"2023-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The existence of \\n \\n \\n λ\\n \\n $\\\\lambda $\\n -decomposable super-simple \\n \\n \\n \\n (\\n \\n 4\\n ,\\n 2\\n λ\\n \\n )\\n \\n \\n $(4,2\\\\lambda )$\\n -GDDs of type \\n \\n \\n \\n g\\n u\\n \\n \\n ${g}^{u}$\\n with \\n \\n \\n λ\\n =\\n 2\\n ,\\n 4\\n \\n $\\\\lambda =2,4$\",\"authors\":\"Huangsheng Yu, Jingyuan Chen, R. Julian R. Abel, Dianhua Wu\",\"doi\":\"10.1002/jcd.21881\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>A design is said to be <i>super-simple</i> if the intersection of any two of its blocks has at most two elements. A design with index <math>\\n <semantics>\\n <mrow>\\n <mi>t</mi>\\n <mi>λ</mi>\\n </mrow>\\n <annotation> $t\\\\lambda $</annotation>\\n </semantics></math> is said to be <math>\\n <semantics>\\n <mrow>\\n <mi>λ</mi>\\n </mrow>\\n <annotation> $\\\\lambda $</annotation>\\n </semantics></math>-<i>decomposable</i>, if its blocks can be partitioned into nonempty collections <math>\\n <semantics>\\n <mrow>\\n <msub>\\n <mi>ℬ</mi>\\n <mi>i</mi>\\n </msub>\\n </mrow>\\n <annotation> ${{\\\\rm{ {\\\\mathcal B} }}}_{i}$</annotation>\\n </semantics></math>, <math>\\n <semantics>\\n <mrow>\\n <mn>1</mn>\\n <mo>≤</mo>\\n <mi>i</mi>\\n <mo>≤</mo>\\n <mi>t</mi>\\n </mrow>\\n <annotation> $1\\\\le i\\\\le t$</annotation>\\n </semantics></math>, such that each <math>\\n <semantics>\\n <mrow>\\n <msub>\\n <mi>ℬ</mi>\\n <mi>i</mi>\\n </msub>\\n </mrow>\\n <annotation> ${{\\\\rm{ {\\\\mathcal B} }}}_{i}$</annotation>\\n </semantics></math> with the point set forms a design with index <math>\\n <semantics>\\n <mrow>\\n <mi>λ</mi>\\n </mrow>\\n <annotation> $\\\\lambda $</annotation>\\n </semantics></math>. In this paper, it is proved that for <math>\\n <semantics>\\n <mrow>\\n <mi>λ</mi>\\n <mo>∈</mo>\\n <mrow>\\n <mo>{</mo>\\n <mrow>\\n <mn>2</mn>\\n <mo>,</mo>\\n <mn>4</mn>\\n </mrow>\\n <mo>}</mo>\\n </mrow>\\n </mrow>\\n <annotation> $\\\\lambda \\\\in \\\\{2,4\\\\}$</annotation>\\n </semantics></math>, there exists a <math>\\n <semantics>\\n <mrow>\\n <mi>λ</mi>\\n </mrow>\\n <annotation> $\\\\lambda $</annotation>\\n </semantics></math>-decomposable super-simple <math>\\n <semantics>\\n <mrow>\\n <mrow>\\n <mo>(</mo>\\n <mrow>\\n <mn>4</mn>\\n <mo>,</mo>\\n <mn>2</mn>\\n <mi>λ</mi>\\n </mrow>\\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n <annotation> $(4,2\\\\lambda )$</annotation>\\n </semantics></math>-GDD of type <math>\\n <semantics>\\n <mrow>\\n <msup>\\n <mi>g</mi>\\n <mi>u</mi>\\n </msup>\\n </mrow>\\n <annotation> ${g}^{u}$</annotation>\\n </semantics></math> if and only if <math>\\n <semantics>\\n <mrow>\\n <mi>u</mi>\\n <mo>≥</mo>\\n <mn>4</mn>\\n </mrow>\\n <annotation> $u\\\\ge 4$</annotation>\\n </semantics></math>, <math>\\n <semantics>\\n <mrow>\\n <mi>g</mi>\\n <mrow>\\n <mo>(</mo>\\n <mrow>\\n <mi>u</mi>\\n <mo>−</mo>\\n <mn>2</mn>\\n </mrow>\\n <mo>)</mo>\\n </mrow>\\n <mo>≥</mo>\\n <mn>2</mn>\\n <mi>λ</mi>\\n </mrow>\\n <annotation> $g(u-2)\\\\ge 2\\\\lambda $</annotation>\\n </semantics></math> and <math>\\n <semantics>\\n <mrow>\\n <mi>g</mi>\\n <mrow>\\n <mo>(</mo>\\n <mrow>\\n <mi>u</mi>\\n <mo>−</mo>\\n <mn>1</mn>\\n </mrow>\\n <mo>)</mo>\\n </mrow>\\n <mo>≡</mo>\\n <mspace></mspace>\\n <mn>0</mn>\\n <mspace></mspace>\\n <mrow>\\n <mo>(</mo>\\n <mrow>\\n <mi>mod</mi>\\n <mspace></mspace>\\n <mn>3</mn>\\n </mrow>\\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n <annotation> $g(u-1)\\\\equiv \\\\,0\\\\,(\\\\mathrm{mod}\\\\,3)$</annotation>\\n </semantics></math>, except for <math>\\n <semantics>\\n <mrow>\\n <mrow>\\n <mo>(</mo>\\n <mrow>\\n <mi>g</mi>\\n <mo>,</mo>\\n <mi>u</mi>\\n <mo>,</mo>\\n <mi>λ</mi>\\n </mrow>\\n <mo>)</mo>\\n </mrow>\\n <mo>=</mo>\\n <mrow>\\n <mo>(</mo>\\n <mrow>\\n <mn>3</mn>\\n <mo>,</mo>\\n <mn>5</mn>\\n <mo>,</mo>\\n <mn>2</mn>\\n </mrow>\\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n <annotation> $(g,u,\\\\lambda )=(3,5,2)$</annotation>\\n </semantics></math>, and except possibly for <math>\\n <semantics>\\n <mrow>\\n <mrow>\\n <mo>(</mo>\\n <mrow>\\n <mi>g</mi>\\n <mo>,</mo>\\n <mi>u</mi>\\n <mo>,</mo>\\n <mi>λ</mi>\\n </mrow>\\n <mo>)</mo>\\n </mrow>\\n <mo>∈</mo>\\n <mrow>\\n <mo>{</mo>\\n <mrow>\\n <mrow>\\n <mo>(</mo>\\n <mrow>\\n <mn>2</mn>\\n <mo>,</mo>\\n <mn>7</mn>\\n <mo>,</mo>\\n <mn>2</mn>\\n </mrow>\\n <mo>)</mo>\\n </mrow>\\n <mo>,</mo>\\n <mrow>\\n <mo>(</mo>\\n <mrow>\\n <mn>6</mn>\\n <mo>,</mo>\\n <mn>5</mn>\\n <mo>,</mo>\\n <mn>4</mn>\\n </mrow>\\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n <mo>}</mo>\\n </mrow>\\n </mrow>\\n <annotation> $(g,u,\\\\lambda )\\\\in \\\\{(2,7,2),(6,5,4)\\\\}$</annotation>\\n </semantics></math>.</p>\",\"PeriodicalId\":15389,\"journal\":{\"name\":\"Journal of Combinatorial Designs\",\"volume\":\"31 6\",\"pages\":\"289-303\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2023-03-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Designs\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jcd.21881\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Designs","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jcd.21881","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
引用
批量引用
The existence of
λ
$\lambda $
-decomposable super-simple
(
4
,
2
λ
)
$(4,2\lambda )$
-GDDs of type
g
u
${g}^{u}$
with
λ
=
2
,
4
$\lambda =2,4$
A design is said to be super-simple if the intersection of any two of its blocks has at most two elements. A design with index
t
λ
$t\lambda $
is said to be
λ
$\lambda $
-decomposable , if its blocks can be partitioned into nonempty collections
ℬ
i
${{\rm{ {\mathcal B} }}}_{i}$
,
1
≤
i
≤
t
$1\le i\le t$
, such that each
ℬ
i
${{\rm{ {\mathcal B} }}}_{i}$
with the point set forms a design with index
λ
$\lambda $
. In this paper, it is proved that for
λ
∈
{
2
,
4
}
$\lambda \in \{2,4\}$
, there exists a
λ
$\lambda $
-decomposable super-simple
(
4
,
2
λ
)
$(4,2\lambda )$
-GDD of type
g
u
${g}^{u}$
if and only if
u
≥
4
$u\ge 4$
,
g
(
u
−
2
)
≥
2
λ
$g(u-2)\ge 2\lambda $
and
g
(
u
−
1
)
≡
0
(
mod
3
)
$g(u-1)\equiv \,0\,(\mathrm{mod}\,3)$
, except for
(
g
,
u
,
λ
)
=
(
3
,
5
,
2
)
$(g,u,\lambda )=(3,5,2)$
, and except possibly for
(
g
,
u
,
λ
)
∈
{
(
2
,
7
,
2
)
,
(
6
,
5
,
4
)
}
$(g,u,\lambda )\in \{(2,7,2),(6,5,4)\}$
.