首页 > 最新文献

Journal of Combinatorial Designs最新文献

英文 中文
Sporadic simple groups as flag-transitive automorphism groups of symmetric designs 作为对称设计的旗转自形群的零星简单群
IF 0.7 4区 数学 Q3 MATHEMATICS Pub Date : 2023-12-20 DOI: 10.1002/jcd.21928
Seyed Hassan Alavi, Ashraf Daneshkhah

In this article, we study symmetric designs admitting flag-transitive, point-imprimitive almost simple automorphism groups with socle sporadic simple groups. As a corollary, we present a classification of symmetric designs admitting flag-transitive automorphism group whose socle is a sporadic simple group, and in conclusion, there are exactly seven such designs, one of which admits a point-imprimitive automorphism group and the remaining are point-primitive.

在这篇文章中,我们研究了对称设计,这些对称设计接纳了以零星简单群为基底的旗变、点直观几乎简单的自变群。作为一个推论,我们提出了一种对称设计的分类,这种设计容许以零星简单群为坐标系的旗变自变群,总之,这样的设计正好有七个,其中一个容许点直观自变群,其余的都是点直观自变群。
{"title":"Sporadic simple groups as flag-transitive automorphism groups of symmetric designs","authors":"Seyed Hassan Alavi,&nbsp;Ashraf Daneshkhah","doi":"10.1002/jcd.21928","DOIUrl":"10.1002/jcd.21928","url":null,"abstract":"<p>In this article, we study symmetric designs admitting flag-transitive, point-imprimitive almost simple automorphism groups with socle sporadic simple groups. As a corollary, we present a classification of symmetric designs admitting flag-transitive automorphism group whose socle is a sporadic simple group, and in conclusion, there are exactly seven such designs, one of which admits a point-imprimitive automorphism group and the remaining are point-primitive.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"32 3","pages":"127-168"},"PeriodicalIF":0.7,"publicationDate":"2023-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138826142","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reduction for flag-transitive point-primitive 2-(v, k, λ) designs with λ prime 具有λ素数的标志传递点基元2-(v, k, λ)设计的约简
IF 0.7 4区 数学 Q3 MATHEMATICS Pub Date : 2023-11-28 DOI: 10.1002/jcd.21927
Yongli Zhang, Jianfu Chen

It is shown that the flag-transitive, point-primitive automorphism groups of 2-(� � v� � ,� � k� � ,� � λ� � ) $(v,k,lambda )$ designs with λ $lambda $ prime must be of affine type or almost simple type.

证明了具有λ$ λ$素数的2-(v,k,λ)$(v,k, λ)$设计的标志传递点基自同构群必须是仿射型或几乎简单型。
{"title":"Reduction for flag-transitive point-primitive 2-(v, k, λ) designs with λ prime","authors":"Yongli Zhang,&nbsp;Jianfu Chen","doi":"10.1002/jcd.21927","DOIUrl":"10.1002/jcd.21927","url":null,"abstract":"<p>It is shown that the flag-transitive, point-primitive automorphism groups of 2-<math>\u0000 <semantics>\u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mrow>\u0000 <mi>v</mi>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>k</mi>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>λ</mi>\u0000 </mrow>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 <annotation> $(v,k,lambda )$</annotation>\u0000 </semantics></math> designs with <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>λ</mi>\u0000 </mrow>\u0000 <annotation> $lambda $</annotation>\u0000 </semantics></math> prime must be of affine type or almost simple type.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"32 2","pages":"88-101"},"PeriodicalIF":0.7,"publicationDate":"2023-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138508717","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Incidence-free sets and edge domination in incidence graphs 关联图中的无关联集和边支配
IF 0.7 4区 数学 Q3 MATHEMATICS Pub Date : 2023-11-23 DOI: 10.1002/jcd.21925
Sam Spiro, Sam Adriaensen, Sam Mattheus
<p>A set of edges <math> <semantics> <mrow> <mi>Γ</mi> </mrow> <annotation> ${rm{Gamma }}$</annotation> </semantics></math> of a graph <math> <semantics> <mrow> <mi>G</mi> </mrow> <annotation> $G$</annotation> </semantics></math> is an edge dominating set if every edge of <math> <semantics> <mrow> <mi>G</mi> </mrow> <annotation> $G$</annotation> </semantics></math> intersects at least one edge of <math> <semantics> <mrow> <mi>Γ</mi> </mrow> <annotation> ${rm{Gamma }}$</annotation> </semantics></math>, and the edge domination number <math> <semantics> <mrow> <msub> <mi>γ</mi> <mi>e</mi> </msub> <mrow> <mo>(</mo> <mi>G</mi> <mo>)</mo> </mrow> </mrow> <annotation> ${gamma }_{e}(G)$</annotation> </semantics></math> is the smallest size of an edge dominating set. Expanding on work of Laskar and Wallis, we study <math> <semantics> <mrow> <msub> <mi>γ</mi> <mi>e</mi> </msub> <mrow> <mo>(</mo> <mi>G</mi> <mo>)</mo> </mrow> </mrow> <annotation> ${gamma }_{e}(G)$</annotation> </semantics></math> for graphs <math> <semantics> <mrow> <mi>G</mi> </mrow> <annotation> $G$</annotation> </semantics></math> which are the incidence graph of some incidence structure <math> <semantics> <mrow> <mi>D</mi> </mrow> <annotation> $D$</annotation> </semantics></math>, with an emphasis on the case when <math> <semantics> <mrow> <mi>D</mi> </mrow> <annotation> $D$</annotation> </semantics></math> is a symmetric design. In particular, we show in this latter case that determining <math>
图G $G$的一组边Γ ${rm{Gamma }}$是边支配集,如果G $G$的每条边都与Γ ${rm{Gamma }}$的至少一条边相交,并且边支配数Γ e(G) ${gamma }_{e}(G)$是边支配集的最小值。在Laskar和Wallis工作的基础上,我们研究了某些关联结构D $D$的关联图G $G$的γe(G) ${gamma }_{e}(G)$,重点研究了D $D$是对称设计的情况。特别地,我们在后一种情况下表明,确定γe(G) ${gamma }_{e}(G)$等同于确定某些无入射集D $D$的最大大小。在整个过程中,我们使用了各种组合、概率和几何技术,并辅以谱图理论的工具。
{"title":"Incidence-free sets and edge domination in incidence graphs","authors":"Sam Spiro,&nbsp;Sam Adriaensen,&nbsp;Sam Mattheus","doi":"10.1002/jcd.21925","DOIUrl":"10.1002/jcd.21925","url":null,"abstract":"&lt;p&gt;A set of edges &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;Γ&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; ${rm{Gamma }}$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; of a graph &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $G$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; is an edge dominating set if every edge of &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $G$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; intersects at least one edge of &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;Γ&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; ${rm{Gamma }}$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, and the edge domination number &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;γ&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;e&lt;/mi&gt;\u0000 &lt;/msub&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; ${gamma }_{e}(G)$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; is the smallest size of an edge dominating set. Expanding on work of Laskar and Wallis, we study &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;γ&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;e&lt;/mi&gt;\u0000 &lt;/msub&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; ${gamma }_{e}(G)$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; for graphs &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $G$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; which are the incidence graph of some incidence structure &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;D&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $D$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, with an emphasis on the case when &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;D&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $D$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; is a symmetric design. In particular, we show in this latter case that determining &lt;math&gt;\u0000 ","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"32 2","pages":"55-87"},"PeriodicalIF":0.7,"publicationDate":"2023-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.21925","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138508716","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On symmetric designs with flag-transitive and point-quasiprimitive automorphism groups 关于具有旗变换群和点准三态群的对称设计
IF 0.7 4区 数学 Q3 MATHEMATICS Pub Date : 2023-11-05 DOI: 10.1002/jcd.21924
Zhilin Zhang, Jianfu Chen, Shenglin Zhou

Let � � D� � =� � (� � P� � ,� � � � ) be a nontrivial symmetric � � (� � v� � ,� � k� � ,� � λ� � )-design with � � λ� � � � 100, and let � � G be a flag-transitive automorphism group of � � D. In this paper, we show that if � � G is quasiprimitive on � � P, then � � G is of holomorph affine or almost simple type. Moreover, if � � G is imprimitive on � � P, then � � G is of almost simple type. According to this observation and to the classification of the finite simple groups we determine all such symmetric designs and the corresponding automorphism groups. We conclude with two open problems and a conjecture.

设 D = ( P , ℬ ) 是一个非对称对称 ( v , k , λ ) 设计,且 λ ≤ 100 。 -设计,且 λ ≤ 100 ,设 G 是 D 的旗反自变群。本文将证明,如果 G 在 P 上是类对立的,那么 G 是全形仿射型或近似简单型。此外,如果 G 在 P 上是隐含的,那么 G 几乎是简单类型的。根据这一观察和有限简单群的分类,我们确定了所有这类对称设计和相应的自变群。最后,我们提出两个悬而未决的问题和一个猜想。
{"title":"On symmetric designs with flag-transitive and point-quasiprimitive automorphism groups","authors":"Zhilin Zhang,&nbsp;Jianfu Chen,&nbsp;Shenglin Zhou","doi":"10.1002/jcd.21924","DOIUrl":"10.1002/jcd.21924","url":null,"abstract":"<p>Let <math>\u0000 \u0000 <mrow>\u0000 <mi>D</mi>\u0000 \u0000 <mo>=</mo>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mrow>\u0000 <mi>P</mi>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>ℬ</mi>\u0000 </mrow>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow></math> be a nontrivial symmetric <math>\u0000 \u0000 <mrow>\u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mrow>\u0000 <mi>v</mi>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>k</mi>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>λ</mi>\u0000 </mrow>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow></math>-design with <math>\u0000 \u0000 <mrow>\u0000 <mi>λ</mi>\u0000 \u0000 <mo>≤</mo>\u0000 \u0000 <mn>100</mn>\u0000 </mrow></math>, and let <math>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow></math> be a flag-transitive automorphism group of <math>\u0000 \u0000 <mrow>\u0000 <mi>D</mi>\u0000 </mrow></math>. In this paper, we show that if <math>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow></math> is quasiprimitive on <math>\u0000 \u0000 <mrow>\u0000 <mi>P</mi>\u0000 </mrow></math>, then <math>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow></math> is of holomorph affine or almost simple type. Moreover, if <math>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow></math> is imprimitive on <math>\u0000 \u0000 <mrow>\u0000 <mi>P</mi>\u0000 </mrow></math>, then <math>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow></math> is of almost simple type. According to this observation and to the classification of the finite simple groups we determine all such symmetric designs and the corresponding automorphism groups. We conclude with two open problems and a conjecture.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"32 3","pages":"107-126"},"PeriodicalIF":0.7,"publicationDate":"2023-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135726222","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Dual incidences and t-designs in vector spaces 向量空间中的对偶关联和t-设计
IF 0.7 4区 数学 Q3 MATHEMATICS Pub Date : 2023-10-13 DOI: 10.1002/jcd.21922
Kristijan Tabak
<p>Let <math> <semantics> <mrow> <mi>V</mi> </mrow> <annotation> $V$</annotation> </semantics></math> be an <math> <semantics> <mrow> <mi>n</mi> </mrow> <annotation> $n$</annotation> </semantics></math>-dimensional vector space over <math> <semantics> <mrow> <msub> <mi>F</mi> <mi>q</mi> </msub> </mrow> <annotation> ${{mathbb{F}}}_{q}$</annotation> </semantics></math> and <math> <semantics> <mrow> <mi>H</mi> </mrow> <annotation> ${rm{ {mathcal H} }}$</annotation> </semantics></math> is any set of <math> <semantics> <mrow> <mi>k</mi> </mrow> <annotation> $k$</annotation> </semantics></math>-dimensional subspaces of <math> <semantics> <mrow> <mi>V</mi> </mrow> <annotation> $V$</annotation> </semantics></math>. We construct two incidence structures <math> <semantics> <mrow> <msub> <mi>D</mi> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>H</mi> <mo>)</mo> </mrow> </mrow> <annotation> ${{mathscr{D}}}_{max}({rm{ {mathcal H} }})$</annotation> </semantics></math> and <math> <semantics> <mrow> <msub> <mi>D</mi> <mrow> <mi>m</mi> <mi>i</mi> <mi>n</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>H</mi> <mo>)</mo> </mrow> </mrow> <annotation> ${{mathscr{D}}}_{min}({rm{ {mathcal H} }})$</annotation> </semantics></math> using subspaces from <math> <semantics> <mrow> <mi>H</mi> </mrow> <annotation> ${rm{ {mathcal H} }}$</annotation>
设V$ V$是F $ q ${{mathbb{F}}}_{q}$和H上的n$ n维向量空间${rm{{mathcal H}}}$是V$ V$的k$ k$维子空间的任意集合。我们构造了两个关联结构D m a x (H)${{mathscr{D}}}_{max}({rm{{mathcal H}}})$和D m i n (H)${{mathscr{D}}}_{min}({rm{mathcal H}}})$使用H ${rm{{mathcal H}}}} $的子空间。这些点是H ${rm{{mathcal H}}}$的子空间。dmma x (H)的块${{mathscr{D}}}_{max}({rm{{mathcal H}}})$由V$ V$的所有超平面索引,而dm块i n (H)${{mathscr{D}}}_{min}({rm{{mathcal H}}})$由维度为1的所有子空间索引。我们证明了dmma x (H)${{mathscr{D}}}_{max}({rm{{mathcal H}}})$和D m i n (H)${{mathscr{D}}}_{min}({rm{{mathcal H}}})$是对偶的,因为它们的关联矩阵是相关的,一个可以从另一个计算出来。 另外,如果H ${rm{{mathcal H}}}$是t−(n),k ,λ) q $t-{(n,k, λ)}_{q}$ -设计证明了D m关联矩阵的新矩阵方程ax (H)$ {{mathscr{D}}}_{max}({rm{mathcal H}}})$和Dmin (H)$ {{mathscr{D}}}_{min}({rm{{mathcal H}}})$。
{"title":"Dual incidences and t-designs in vector spaces","authors":"Kristijan Tabak","doi":"10.1002/jcd.21922","DOIUrl":"https://doi.org/10.1002/jcd.21922","url":null,"abstract":"&lt;p&gt;Let &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;V&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $V$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; be an &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $n$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;-dimensional vector space over &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;F&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;q&lt;/mi&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; ${{mathbb{F}}}_{q}$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; and &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;H&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; ${rm{ {mathcal H} }}$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; is any set of &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $k$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;-dimensional subspaces of &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;V&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $V$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;. We construct two incidence structures &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;D&lt;/mi&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;m&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;a&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;x&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/msub&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;H&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; ${{mathscr{D}}}_{max}({rm{ {mathcal H} }})$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; and &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;D&lt;/mi&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;m&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;i&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/msub&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;H&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; ${{mathscr{D}}}_{min}({rm{ {mathcal H} }})$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; using subspaces from &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;H&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; ${rm{ {mathcal H} }}$&lt;/annotation&gt;\u0000 ","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"32 1","pages":"46-52"},"PeriodicalIF":0.7,"publicationDate":"2023-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134805714","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Completing the solution of the directed Oberwolfach problem with cycles of equal length 完成了等长环有向Oberwolfach问题的求解
IF 0.7 4区 数学 Q3 MATHEMATICS Pub Date : 2023-09-25 DOI: 10.1002/jcd.21918
Alice Lacaze-Masmonteil

In this paper, we give a solution to the last outstanding case of the directed Oberwolfach problem with tables of uniform length. Namely, we address the two-table case with tables of equal odd length. We prove that the complete symmetric digraph on 2m $2m$ vertices, denoted K2m* ${K}_{2m}^{* }$, admits a resolvable decomposition into directed cycles of odd length m $m$. This completely settles the directed Oberwolfach problem with tables of uniform length.

本文给出了具有等长表的有向Oberwolfach问题的最后一个突出情况的解。也就是说,我们用奇数长度相等的表来处理双表的情况。我们证明了2m$ 2m$顶点上的完全对称有向图,记作K 2m * ${K}_{2m}^{*}$,允许分解成奇数长度m$ m$的有向环。这完全解决了等长表的有向奥伯沃尔法赫问题。
{"title":"Completing the solution of the directed Oberwolfach problem with cycles of equal length","authors":"Alice Lacaze-Masmonteil","doi":"10.1002/jcd.21918","DOIUrl":"https://doi.org/10.1002/jcd.21918","url":null,"abstract":"<p>In this paper, we give a solution to the last outstanding case of the directed Oberwolfach problem with tables of uniform length. Namely, we address the two-table case with tables of equal odd length. We prove that the complete symmetric digraph on <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>2</mn>\u0000 <mi>m</mi>\u0000 </mrow>\u0000 <annotation> $2m$</annotation>\u0000 </semantics></math> vertices, denoted <math>\u0000 <semantics>\u0000 <mrow>\u0000 <msubsup>\u0000 <mi>K</mi>\u0000 <mrow>\u0000 <mn>2</mn>\u0000 <mi>m</mi>\u0000 </mrow>\u0000 <mo>*</mo>\u0000 </msubsup>\u0000 </mrow>\u0000 <annotation> ${K}_{2m}^{* }$</annotation>\u0000 </semantics></math>, admits a resolvable decomposition into directed cycles of odd length <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>m</mi>\u0000 </mrow>\u0000 <annotation> $m$</annotation>\u0000 </semantics></math>. This completely settles the directed Oberwolfach problem with tables of uniform length.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"32 1","pages":"5-30"},"PeriodicalIF":0.7,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.21918","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134880386","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Orthogonal cycle systems with cycle length less than 10 周期长度小于10的正交循环系
IF 0.7 4区 数学 Q3 MATHEMATICS Pub Date : 2023-09-25 DOI: 10.1002/jcd.21921
Selda Küçükçifçi, Emine Şule Yazıcı
<p>An <math> <semantics> <mrow> <mi>H</mi> </mrow> <annotation> $H$</annotation> </semantics></math>-decomposition of a graph <math> <semantics> <mrow> <mi>G</mi> </mrow> <annotation> $G$</annotation> </semantics></math> is a partition of the edge set of <math> <semantics> <mrow> <mi>G</mi> </mrow> <annotation> $G$</annotation> </semantics></math> into subsets, where each subset induces a copy of the graph <math> <semantics> <mrow> <mi>H</mi> </mrow> <annotation> $H$</annotation> </semantics></math>. A <math> <semantics> <mrow> <mi>k</mi> </mrow> <annotation> $k$</annotation> </semantics></math>-orthogonal <math> <semantics> <mrow> <mi>H</mi> </mrow> <annotation> $H$</annotation> </semantics></math>-decomposition of <math> <semantics> <mrow> <mi>G</mi> </mrow> <annotation> $G$</annotation> </semantics></math> is a set of <math> <semantics> <mrow> <mi>k</mi> </mrow> <annotation> $k$</annotation> </semantics></math><math> <semantics> <mrow> <mi>H</mi> </mrow> <annotation> $H$</annotation> </semantics></math>-decompositions of <math> <semantics> <mrow> <mi>G</mi> </mrow> <annotation> $G$</annotation> </semantics></math> such that any two copies of <math> <semantics> <mrow> <mi>H</mi> </mrow> <annotation> $H$</annotation> </semantics></math> in distinct <math> <semantics> <mrow> <mi>H</mi> </mrow> <annotation> $H$</annotation> </semantics></math>-decompositions intersect in at most one edge. When <math> <semantics> <mrow> <mi>G</mi> <mo>=</mo> <msub> <mi>K</mi> <mi>v</mi> </msub> </mrow> <annotation> $G={K}_{v}$</annotation> </semantics></math>, we call the <math> <semantics> <mrow> <mi>H</mi> </mrow> <annotation> $H$</annotation> </semantics></math>-decompositi
图G$ G$的H$ H$分解是将G$ G$的边集划分为若干子集,其中每个子集归纳出图H$ H$的一个副本。G$ G$的k$ k$ -正交H$ H$分解是k$ k$ H$ H$的集合- G$ G$的分解使得H$ H$的任意两个副本在不同的H$ H$分解中最多相交于一条边。当G= K v $G={K}_{v}$时,我们称之为H$ H$分解和H$ H$ - v$ v$阶系统。在本文中,我们考虑了H$ H$是一个r $ell $ -环的情况,并构造了一对r $ell $ -环的正交系统{5,6,7,8,9}$ well in {5,6,7,8,9}$,除了当r =v$ r =v$。
{"title":"Orthogonal cycle systems with cycle length less than 10","authors":"Selda Küçükçifçi,&nbsp;Emine Şule Yazıcı","doi":"10.1002/jcd.21921","DOIUrl":"https://doi.org/10.1002/jcd.21921","url":null,"abstract":"&lt;p&gt;An &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;H&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $H$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;-decomposition of a graph &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $G$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; is a partition of the edge set of &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $G$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; into subsets, where each subset induces a copy of the graph &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;H&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $H$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;. A &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $k$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;-orthogonal &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;H&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $H$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;-decomposition of &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $G$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; is a set of &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $k$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;H&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $H$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;-decompositions of &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $G$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; such that any two copies of &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;H&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $H$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; in distinct &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;H&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $H$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;-decompositions intersect in at most one edge. When &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;mo&gt;=&lt;/mo&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;K&lt;/mi&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $G={K}_{v}$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, we call the &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;H&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $H$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;-decompositi","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"32 1","pages":"31-45"},"PeriodicalIF":0.7,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134814340","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Generalizations of some Nordhaus–Gaddum-type results on spectral radius 谱半径上某些Nordhaus–Gaddum型结果的推广
IF 0.7 4区 数学 Q3 MATHEMATICS Pub Date : 2023-09-21 DOI: 10.1002/jcd.21919
Junying Lu, Lanchao Wang, Yaojun Chen
<p>Let <math> <semantics> <mrow> <mi>G</mi> </mrow> <annotation> $G$</annotation> </semantics></math> be a simple graph and <math> <semantics> <mrow> <mi>λ</mi> <mrow> <mo>(</mo> <mi>G</mi> <mo>)</mo> </mrow> </mrow> <annotation> $lambda (G)$</annotation> </semantics></math> the spectral radius of <math> <semantics> <mrow> <mi>G</mi> </mrow> <annotation> $G$</annotation> </semantics></math>. For <math> <semantics> <mrow> <mi>k</mi> <mo>≥</mo> <mn>2</mn> </mrow> <annotation> $kge 2$</annotation> </semantics></math>, a <math> <semantics> <mrow> <mi>k</mi> </mrow> <annotation> $k$</annotation> </semantics></math>-edge decomposition <math> <semantics> <mrow> <mo>(</mo> <mrow> <msub> <mi>H</mi> <mn>1</mn> </msub> <mo>,</mo> <mi>…</mi> <mo>,</mo> <msub> <mi>H</mi> <mi>k</mi> </msub> </mrow> <mo>)</mo> </mrow> <annotation> $({H}_{1},{rm{ldots }},{H}_{k})$</annotation> </semantics></math> is <math> <semantics> <mrow> <mi>k</mi> </mrow> <annotation> $k$</annotation> </semantics></math> spanning subgraphs such that their edge sets form a <math> <semantics> <mrow> <mi>k</mi> </mrow> <annotation> $k$</annotation> </semantics></math>-partition of the edge set of <math> <semantics> <mrow> <mi>G</mi> </mrow> <annotation> $G$</annotation> </semantics></math>. In this paper, we obtain some sharp lower and upper bounds for <math> <semantics> <mrow> <mi>λ</mi> <mrow> <mo>(</mo>
设G$G$是一个简单图,λ(G)$lambda(G)$是谱G$G$的半径。对于k≥2$kge 2$,k$k$边分解(h1,…,Hk)$({H}_{1} ,{rm{ldots}},{H}_{k} )$是k$k$生成子图,使得它们的边集形成G$G$的边集的k$k$-划分。在本文中,我们得到了λ(H1)+…+λ(H k)$lambda({H}_{1} )+,cdots,+lambda({H}_{k} )$根据H i的集团数${H}_{i} $和G$G$的大小,并讨论什么是k$k$-边分解(h1,…,Hk)$({H}_{1} ,{rm{ldots}},{H}_{k} )$可以最大化λ(H1)+…+λ(H k)$lambda({H}_{1} )+cdots,+lambda({H}_{k} )$,当G$G$是一个完全图时。这些结果推广了Nosal、Hong和Shu以及Nikiforov关于k=2$k=2$的谱半径的一些Nordhaus–Gaddum型结果。
{"title":"Generalizations of some Nordhaus–Gaddum-type results on spectral radius","authors":"Junying Lu,&nbsp;Lanchao Wang,&nbsp;Yaojun Chen","doi":"10.1002/jcd.21919","DOIUrl":"https://doi.org/10.1002/jcd.21919","url":null,"abstract":"&lt;p&gt;Let &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $G$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; be a simple graph and &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;λ&lt;/mi&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $lambda (G)$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; the spectral radius of &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $G$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;. For &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;≥&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $kge 2$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, a &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $k$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;-edge decomposition &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;H&lt;/mi&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;/msub&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;…&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;msub&gt;\u0000 &lt;mi&gt;H&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $({H}_{1},{rm{ldots }},{H}_{k})$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; is &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $k$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; spanning subgraphs such that their edge sets form a &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $k$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;-partition of the edge set of &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $G$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;. In this paper, we obtain some sharp lower and upper bounds for &lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;λ&lt;/mi&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 ","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"31 12","pages":"701-712"},"PeriodicalIF":0.7,"publicationDate":"2023-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50153173","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Construction of rank 4 self-dual association schemes inducing three partial geometric designs 诱导三个局部几何设计的秩为4的自对偶关联方案的构造
IF 0.7 4区 数学 Q3 MATHEMATICS Pub Date : 2023-09-05 DOI: 10.1002/jcd.21917
Akihide Hanaki

Xu characterized rank 4 self-dual association schemes inducing three partial geometric designs by their character tables. We construct such association schemes as Schur rings over Abelian 2-groups.

徐用秩4自对偶关联方案的特征表刻画了它们的三个局部几何设计。我们构造了阿贝尔2-群上的Schur环这样的关联方案。
{"title":"Construction of rank 4 self-dual association schemes inducing three partial geometric designs","authors":"Akihide Hanaki","doi":"10.1002/jcd.21917","DOIUrl":"https://doi.org/10.1002/jcd.21917","url":null,"abstract":"<p>Xu characterized rank 4 self-dual association schemes inducing three partial geometric designs by their character tables. We construct such association schemes as Schur rings over Abelian 2-groups.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"31 12","pages":"691-700"},"PeriodicalIF":0.7,"publicationDate":"2023-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50122308","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
proper partial geometries with an automorphism group acting primitively on points and lines 自同构群初始作用于点和线的适当局部几何
IF 0.7 4区 数学 Q3 MATHEMATICS Pub Date : 2023-08-31 DOI: 10.1002/jcd.21914
Wendi Di

Let S ${mathscr{S}}$ be a finite proper partial geometry pg(s� � ,� � t� � ,� � α� � ) $(s,t,alpha )$ not isomorphic to the van Lint–Schrijver partial geometry pg(5� � ,� � 5� � ,� � 2� � ) $(5,5,2)$ and let G $G$ be a group of automorphisms of S ${mathscr{S}}$ acting primitively on both points and lines of S ${mathscr{S}}$, we show that if α� � � � 60 $alpha le 60$ then G $G$ must be almost simple.

设S${mathscr{S}}$是一个有限的正偏几何pg(s,t,α)$(s,talpha)$不同构到van Lint–Schrijver局部几何pg(5,5,2)$(5,5,2)$并出租G$G$是S${mathscr{S}}$的一组自同构,我们证明了如果α≤60$alphale60$,那么G$G$必须是几乎简单的。
{"title":"proper partial geometries with an automorphism group acting primitively on points and lines","authors":"Wendi Di","doi":"10.1002/jcd.21914","DOIUrl":"https://doi.org/10.1002/jcd.21914","url":null,"abstract":"<p>Let <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>S</mi>\u0000 </mrow>\u0000 <annotation> ${mathscr{S}}$</annotation>\u0000 </semantics></math> be a finite proper partial geometry pg<math>\u0000 <semantics>\u0000 <mrow>\u0000 <mrow>\u0000 <mo>(</mo>\u0000 <mrow>\u0000 <mi>s</mi>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>t</mi>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>α</mi>\u0000 </mrow>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> $(s,t,alpha )$</annotation>\u0000 </semantics></math> not isomorphic to the van Lint–Schrijver partial geometry pg<math>\u0000 <semantics>\u0000 <mrow>\u0000 <mrow>\u0000 <mo>(</mo>\u0000 <mrow>\u0000 <mn>5</mn>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mn>5</mn>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mn>2</mn>\u0000 </mrow>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> $(5,5,2)$</annotation>\u0000 </semantics></math> and let <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 <annotation> $G$</annotation>\u0000 </semantics></math> be a group of automorphisms of <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>S</mi>\u0000 </mrow>\u0000 <annotation> ${mathscr{S}}$</annotation>\u0000 </semantics></math> acting primitively on both points and lines of <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>S</mi>\u0000 </mrow>\u0000 <annotation> ${mathscr{S}}$</annotation>\u0000 </semantics></math>, we show that if <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>α</mi>\u0000 \u0000 <mo>≤</mo>\u0000 \u0000 <mn>60</mn>\u0000 </mrow>\u0000 <annotation> $alpha le 60$</annotation>\u0000 </semantics></math> then <math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 <annotation> $G$</annotation>\u0000 </semantics></math> must be almost simple.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"31 11","pages":"642-664"},"PeriodicalIF":0.7,"publicationDate":"2023-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50148812","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Journal of Combinatorial Designs
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1