{"title":"On the existence of \n \n \n k\n \n $k$\n -cycle semiframes for even \n \n \n k\n \n $k$","authors":"Li Wang, Haibo Ji, Haitao Cao","doi":"10.1002/jcd.21908","DOIUrl":null,"url":null,"abstract":"<p>A <math>\n <semantics>\n <mrow>\n <msub>\n <mi>C</mi>\n <mi>k</mi>\n </msub>\n </mrow>\n <annotation> ${C}_{k}$</annotation>\n </semantics></math>-semiframe 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> is a <math>\n <semantics>\n <mrow>\n <msub>\n <mi>C</mi>\n <mi>k</mi>\n </msub>\n </mrow>\n <annotation> ${C}_{k}$</annotation>\n </semantics></math>-group divisible design of type <math>\n <semantics>\n <mrow>\n <msup>\n <mi>g</mi>\n <mi>u</mi>\n </msup>\n <mrow>\n <mo>(</mo>\n <mrow>\n <mi>X</mi>\n <mo>,</mo>\n <mi>G</mi>\n <mo>,</mo>\n <mi>ℬ</mi>\n </mrow>\n <mo>)</mo>\n </mrow>\n </mrow>\n <annotation> ${g}^{u}({\\mathscr{X}},{\\mathscr{G}},{\\rm{ {\\mathcal B} }})$</annotation>\n </semantics></math> in which <math>\n <semantics>\n <mrow>\n <mi>X</mi>\n </mrow>\n <annotation> ${\\mathscr{X}}$</annotation>\n </semantics></math> is the vertex set, <math>\n <semantics>\n <mrow>\n <mi>G</mi>\n </mrow>\n <annotation> ${\\mathscr{G}}$</annotation>\n </semantics></math> is the group set, and the set <math>\n <semantics>\n <mrow>\n <mi>ℬ</mi>\n </mrow>\n <annotation> ${\\rm{ {\\mathcal B} }}$</annotation>\n </semantics></math> of <math>\n <semantics>\n <mrow>\n <mi>k</mi>\n </mrow>\n <annotation> $k$</annotation>\n </semantics></math>-cycles can be written as a disjoint union <math>\n <semantics>\n <mrow>\n <mi>ℬ</mi>\n <mo>=</mo>\n <mi>P</mi>\n <mo>∪</mo>\n <mi>Q</mi>\n </mrow>\n <annotation> ${\\rm{ {\\mathcal B} }}={\\mathscr{P}}\\cup {\\mathscr{Q}}$</annotation>\n </semantics></math> where <math>\n <semantics>\n <mrow>\n <mi>P</mi>\n </mrow>\n <annotation> ${\\mathscr{P}}$</annotation>\n </semantics></math> is partitioned into parallel classes on <math>\n <semantics>\n <mrow>\n <mi>X</mi>\n </mrow>\n <annotation> ${\\mathscr{X}}$</annotation>\n </semantics></math> and <math>\n <semantics>\n <mrow>\n <mi>Q</mi>\n </mrow>\n <annotation> ${\\mathscr{Q}}$</annotation>\n </semantics></math> is partitioned into holey parallel classes, each parallel class or holey parallel class being a set of vertex disjoint cycles whose vertex sets partition <math>\n <semantics>\n <mrow>\n <mi>X</mi>\n </mrow>\n <annotation> ${\\mathscr{X}}$</annotation>\n </semantics></math> or <math>\n <semantics>\n <mrow>\n <mi>X</mi>\n <mspace></mspace>\n <mo>⧹</mo>\n <msub>\n <mi>G</mi>\n <mi>j</mi>\n </msub>\n </mrow>\n <annotation> ${\\mathscr{X}}\\,\\setminus {G}_{j}$</annotation>\n </semantics></math> for some <math>\n <semantics>\n <mrow>\n <msub>\n <mi>G</mi>\n <mi>j</mi>\n </msub>\n <mo>∈</mo>\n <mi>G</mi>\n </mrow>\n <annotation> ${G}_{j}\\in {\\mathscr{G}}$</annotation>\n </semantics></math>. In this paper, we almost completely solve the existence of a <math>\n <semantics>\n <mrow>\n <msub>\n <mi>C</mi>\n <mrow>\n <mn>4</mn>\n <mi>k</mi>\n </mrow>\n </msub>\n </mrow>\n <annotation> ${C}_{4k}$</annotation>\n </semantics></math>-semiframe 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> for all <math>\n <semantics>\n <mrow>\n <mi>k</mi>\n <mo>≥</mo>\n <mn>1</mn>\n </mrow>\n <annotation> $k\\ge 1$</annotation>\n </semantics></math> and a <math>\n <semantics>\n <mrow>\n <msub>\n <mi>C</mi>\n <mrow>\n <mn>4</mn>\n <mi>k</mi>\n <mo>+</mo>\n <mn>2</mn>\n </mrow>\n </msub>\n </mrow>\n <annotation> ${C}_{4k+2}$</annotation>\n </semantics></math>-semiframe 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> for all <math>\n <semantics>\n <mrow>\n <mi>k</mi>\n <mo>≥</mo>\n <mn>1</mn>\n </mrow>\n <annotation> $k\\ge 1$</annotation>\n </semantics></math> and <math>\n <semantics>\n <mrow>\n <mi>g</mi>\n <mo>≡</mo>\n <mn>0</mn>\n <mspace></mspace>\n <mrow>\n <mo>(</mo>\n <mrow>\n <mi>mod</mi>\n <mspace></mspace>\n <mn>8</mn>\n <mi>k</mi>\n <mo>+</mo>\n <mn>4</mn>\n </mrow>\n <mo>)</mo>\n </mrow>\n </mrow>\n <annotation> $g\\equiv 0\\,(\\mathrm{mod}\\,8k+4)$</annotation>\n </semantics></math>.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"31 10","pages":"511-530"},"PeriodicalIF":0.5000,"publicationDate":"2023-07-13","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.21908","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
A -semiframe of type is a -group divisible design of type in which is the vertex set, is the group set, and the set of -cycles can be written as a disjoint union where is partitioned into parallel classes on and is partitioned into holey parallel classes, each parallel class or holey parallel class being a set of vertex disjoint cycles whose vertex sets partition or for some . In this paper, we almost completely solve the existence of a -semiframe of type for all and a -semiframe of type for all and .
期刊介绍:
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.