The Existence of 3 2 -DSS ( 4 , 6 ) -GDDs of Type g u

IF 0.8 4区 数学 Q3 MATHEMATICS
Journal of Combinatorial Designs Pub Date : 2026-08-11 Epub Date: 2026-07-23 DOI:10.1002/jcd.70027
Jingyuan Chen, Huangsheng Yu, R. Julian R. Abel, Dianhua Wu
{"title":"The Existence of \n \n \n \n \n 3\n 2\n \n \n \n -DSS \n \n \n \n \n (\n \n 4\n ,\n 6\n \n )\n \n \n \n -GDDs of Type \n \n \n \n \n g\n u","authors":"Jingyuan Chen,&nbsp;Huangsheng Yu,&nbsp;R. Julian R. Abel,&nbsp;Dianhua Wu","doi":"10.1002/jcd.70027","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>A design is said to be <i>super-simple</i> if any two of its blocks have at most two common points. A design with index <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>t</mi>\n \n <mi>λ</mi>\n </mrow>\n </mrow>\n </semantics></math> is said to be <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <msup>\n <mi>λ</mi>\n \n <mi>t</mi>\n </msup>\n </mrow>\n </mrow>\n </semantics></math>-<i>decomposable</i>, if its blocks can be partitioned into nonempty collections <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <msub>\n <mi>ℬ</mi>\n \n <mi>i</mi>\n </msub>\n \n <mo>,</mo>\n \n <mn>1</mn>\n \n <mo>≤</mo>\n \n <mi>i</mi>\n \n <mo>≤</mo>\n \n <mi>t</mi>\n </mrow>\n </mrow>\n </semantics></math>, such that each <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <msub>\n <mi>ℬ</mi>\n \n <mi>i</mi>\n </msub>\n </mrow>\n </mrow>\n </semantics></math> with the point set forms a design with index <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>λ</mi>\n </mrow>\n </mrow>\n </semantics></math>. In this paper, it is proved that there exists a <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <msup>\n <mn>3</mn>\n \n <mn>2</mn>\n </msup>\n </mrow>\n </mrow>\n </semantics></math>-DSS <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mn>4</mn>\n \n <mo>,</mo>\n \n <mn>6</mn>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n </semantics></math>-GDD (decomposable super-simple group divisible design) of type <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <msup>\n <mi>g</mi>\n \n <mi>u</mi>\n </msup>\n </mrow>\n </mrow>\n </semantics></math> if and only if <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>u</mi>\n \n <mo>≥</mo>\n \n <mn>4</mn>\n \n <mo>,</mo>\n \n <mi>g</mi>\n \n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>u</mi>\n \n <mo>−</mo>\n \n <mn>2</mn>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n \n <mo>≥</mo>\n \n <mn>12</mn>\n </mrow>\n </mrow>\n </semantics></math> and <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <msup>\n <mi>g</mi>\n \n <mn>2</mn>\n </msup>\n \n <mi>u</mi>\n \n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>u</mi>\n \n <mo>−</mo>\n \n <mn>1</mn>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n \n <mo>≡</mo>\n \n <mn>0</mn>\n <mspace></mspace>\n \n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>mod</mi>\n <mspace></mspace>\n \n <mn>4</mn>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n </semantics></math>, and except possibly for <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <msup>\n <mi>g</mi>\n \n <mi>u</mi>\n </msup>\n \n <mo>∈</mo>\n \n <mrow>\n <mo>{</mo>\n \n <mrow>\n <msup>\n <mn>2</mn>\n \n <mn>8</mn>\n </msup>\n \n <mo>,</mo>\n \n <msup>\n <mn>6</mn>\n \n <mn>4</mn>\n </msup>\n </mrow>\n \n <mo>}</mo>\n </mrow>\n </mrow>\n </mrow>\n </semantics></math>.</p>\n </div>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"34 10","pages":"464-480"},"PeriodicalIF":0.8000,"publicationDate":"2026-08-11","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.70027","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/7/23 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

A design is said to be super-simple if any two of its blocks have at most two common points. A design with index t λ is said to be λ t -decomposable, if its blocks can be partitioned into nonempty collections ℬ i , 1 ≤ i ≤ t , such that each ℬ i with the point set forms a design with index λ . In this paper, it is proved that there exists a 3 2 -DSS ( 4 , 6 ) -GDD (decomposable super-simple group divisible design) of type g u if and only if u ≥ 4 , g ( u − 2 ) ≥ 12 and g 2 u ( u − 1 ) ≡ 0 ( mod 4 ) , and except possibly for g u ∈ { 2 8 , 6 4 } .

32 -DSS (4,6) - g型gdd
如果其中任意两个积木最多有两个共同点,那么这个设计就被称为“超级简单”。指标为t λ的设计称为λ t可分解的,如果它的块可以被分割成非空集合,1≤I≤t,使得每个点集的每一个点集都形成一个指数为λ的设计。 在本文中,证明了存在一个32 -DSS (4),6) -GDD(可分解超简单群可分设计)当且仅当U≥4,G (u−2)≥12g2u (u -(1)≡0 (mod 4)) ,除了可能的g∈{28, 4}。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.60
自引率
14.30%
发文量
55
审稿时长
>12 weeks
期刊介绍: The Journal of Combinatorial Designs is an international journal devoted to the timely publication of the most influential papers in the area of combinatorial design theory. All topics in design theory, and in which design theory has important applications, are covered, including: block designs, t-designs, pairwise balanced designs and group divisible designs Latin squares, quasigroups, and related algebras computational methods in design theory construction methods applications in computer science, experimental design theory, and coding theory graph decompositions, factorizations, and design-theoretic techniques in graph theory and extremal combinatorics finite geometry and its relation with design theory. algebraic aspects of design theory. Researchers and scientists can depend on the Journal of Combinatorial Designs for the most recent developments in this rapidly growing field, and to provide a forum for both theoretical research and applications. All papers appearing in the Journal of Combinatorial Designs are carefully peer refereed.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书