Journal of Combinatorial Designs最新文献

筛选
英文 中文
On Quasi-Hermitian Varieties in Even Characteristic and Related Orthogonal Arrays
IF 0.5 4区 数学
Journal of Combinatorial Designs Pub Date : 2025-01-06 DOI: 10.1002/jcd.21966
Angela Aguglia, Luca Giuzzi, Alessandro Montinaro, Viola Siconolfi
{"title":"On Quasi-Hermitian Varieties in Even Characteristic and Related Orthogonal Arrays","authors":"Angela Aguglia,&nbsp;Luca Giuzzi,&nbsp;Alessandro Montinaro,&nbsp;Viola Siconolfi","doi":"10.1002/jcd.21966","DOIUrl":"https://doi.org/10.1002/jcd.21966","url":null,"abstract":"<p>In this article, we study the BM quasi-Hermitian varieties, laying in the three-dimensional Desarguesian projective space of even order. After a brief investigation of their combinatorial properties, we first show that all of these varieties are projectively equivalent, exhibiting a behavior which is strikingly different from what happens in odd characteristic. This completes the classification project started there. Here we prove more; indeed, by using previous results, we explicitly determine the structure of the full collineation group stabilizing these varieties. Finally, as a byproduct of our investigation, we also construct a family of simple orthogonal arrays <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>O</mi>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mrow>\u0000 <msup>\u0000 <mi>q</mi>\u0000 \u0000 <mn>5</mn>\u0000 </msup>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <msup>\u0000 <mi>q</mi>\u0000 \u0000 <mn>4</mn>\u0000 </msup>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>q</mi>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mn>2</mn>\u0000 </mrow>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>, with entries in <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <msub>\u0000 <mi>F</mi>\u0000 \u0000 <mi>q</mi>\u0000 </msub>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>, where <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>q</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> is an even prime power. Orthogonal arrays (OA's) are principally used to minimize the number of experiments needed to investigate how variables in testing interact with each other.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"33 3","pages":"109-122"},"PeriodicalIF":0.5,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.21966","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143112442","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
Avoiding Secants of Given Size in Finite Projective Planes
IF 0.5 4区 数学
Journal of Combinatorial Designs Pub Date : 2024-12-30 DOI: 10.1002/jcd.21968
Tamás Héger, Zoltán Lóránt Nagy
{"title":"Avoiding Secants of Given Size in Finite Projective Planes","authors":"Tamás Héger,&nbsp;Zoltán Lóránt Nagy","doi":"10.1002/jcd.21968","DOIUrl":"https://doi.org/10.1002/jcd.21968","url":null,"abstract":"&lt;div&gt;\u0000 \u0000 &lt;p&gt;Let &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;q&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; be a prime power and &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; be a natural number. What are the possible cardinalities of point sets &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;S&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; in a projective plane of order &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;q&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, which do not intersect any line at exactly &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; points? This problem and its variants have been investigated before, in relation with blocking sets, untouchable sets or sets of even type, among others. In this article, we show a series of results which point out the existence of all or almost all possible values &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;m&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;∈&lt;/mo&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;[&lt;/mo&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mn&gt;0&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;msup&gt;\u0000 &lt;mi&gt;q&lt;/mi&gt;\u0000 \u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 &lt;/msup&gt;\u0000 \u0000 &lt;mo&gt;+&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;q&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;+&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;]&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; for &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;∣&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;S&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;∣&lt;/mo&gt;\u0000 \u0000 &lt;mo&gt;=&lt;","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"33 3","pages":"83-93"},"PeriodicalIF":0.5,"publicationDate":"2024-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143120778","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
Tic-Tac-Toe on Designs 设计上的井字游戏
IF 0.5 4区 数学
Journal of Combinatorial Designs Pub Date : 2024-11-17 DOI: 10.1002/jcd.21961
Peter Danziger, Melissa A. Huggan, Rehan Malik, Trent G. Marbach
{"title":"Tic-Tac-Toe on Designs","authors":"Peter Danziger,&nbsp;Melissa A. Huggan,&nbsp;Rehan Malik,&nbsp;Trent G. Marbach","doi":"10.1002/jcd.21961","DOIUrl":"https://doi.org/10.1002/jcd.21961","url":null,"abstract":"&lt;p&gt;We consider playing the game of Tic-Tac-Toe on block designs BIBD&lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;λ&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $(v,k,lambda )$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; and transversal designs TD&lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $(k,n)$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;. Players take turns choosing points and the first player to complete a block wins the game. We show that triple systems, BIBD&lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;3&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;λ&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $(v,3,lambda )$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, are a first-player win if and only if &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;≥&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;5&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $vge 5$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;. Further, we show that for &lt;span&gt;&lt;/span&gt;&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 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;3&lt;/mn&gt;\u0000 ","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"33 2","pages":"58-71"},"PeriodicalIF":0.5,"publicationDate":"2024-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.21961","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142859908","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
An Improvement on Triple Systems Without Two Types of Configurations 无两种构型的三重系统的改进
IF 0.5 4区 数学
Journal of Combinatorial Designs Pub Date : 2024-11-17 DOI: 10.1002/jcd.21962
Liying Yu, Shuhui Yu, Lijun Ji
{"title":"An Improvement on Triple Systems Without Two Types of Configurations","authors":"Liying Yu,&nbsp;Shuhui Yu,&nbsp;Lijun Ji","doi":"10.1002/jcd.21962","DOIUrl":"https://doi.org/10.1002/jcd.21962","url":null,"abstract":"&lt;div&gt;\u0000 \u0000 &lt;p&gt;There are four nonisomorphic configurations of triples that can form a triangle in a three-uniform hypergraph, where the configurations &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;B&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; ${bf{B}}$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; and &lt;span&gt;&lt;/span&gt;&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; ${bf{D}}$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; on &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;{&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;3&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;4&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;5&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;}&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; ${1,2,3,4,5}$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; consist of three triples &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mn&gt;125&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;134&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;234&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $125,134,234$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; and &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mn&gt;123&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;134&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;235&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $123,134,235$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, respectively. Denote by ex&lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;D&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $(n,{bf{D}})$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; and ex&lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;BD&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $(n,{bf{BD}})$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; the maximum number of triples in a three-uniform hypergraph on &lt;span&gt;&lt;/span&gt;&lt;m","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"33 2","pages":"72-78"},"PeriodicalIF":0.5,"publicationDate":"2024-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142861640","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
Latin squares with five disjoint subsquares 有五个不相交的子正方形的拉丁正方形
IF 0.5 4区 数学
Journal of Combinatorial Designs Pub Date : 2024-10-16 DOI: 10.1002/jcd.21960
Tara Kemp
{"title":"Latin squares with five disjoint subsquares","authors":"Tara Kemp","doi":"10.1002/jcd.21960","DOIUrl":"https://doi.org/10.1002/jcd.21960","url":null,"abstract":"&lt;p&gt;Given an integer partition &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&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;msub&gt;\u0000 &lt;mi&gt;h&lt;/mi&gt;\u0000 \u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 &lt;/msub&gt;\u0000 \u0000 &lt;mi&gt;…&lt;/mi&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;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $({h}_{1}{h}_{2}{rm{ldots }}{h}_{k})$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; of &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $n$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, is it possible to find an order &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $n$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; latin square with &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $k$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; pairwise disjoint subsquares of orders &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&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 &lt;/mrow&gt;\u0000 &lt;annotation&gt; ${h}_{1},{rm{ldots }},{h}_{k}$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;? This question was posed by Fuchs and has been answered for all partitions with &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"33 2","pages":"39-57"},"PeriodicalIF":0.5,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142861593","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
Completely reducible super-simple ( v , 4 , 4 ) $(v,4,4)$ -BIBDs and related constant weight codes 完全还原的超简单 ( v , 4 , 4 ) $(v,4,4)$ -BIBD 及相关恒权码
IF 0.5 4区 数学
Journal of Combinatorial Designs Pub Date : 2024-10-10 DOI: 10.1002/jcd.21958
Jingyuan Chen, Huangsheng Yu, R. Julian R. Abel, Dianhua Wu
{"title":"Completely reducible super-simple \u0000 \u0000 \u0000 (\u0000 \u0000 v\u0000 ,\u0000 4\u0000 ,\u0000 4\u0000 \u0000 )\u0000 \u0000 $(v,4,4)$\u0000 -BIBDs and related constant weight codes","authors":"Jingyuan Chen,&nbsp;Huangsheng Yu,&nbsp;R. Julian R. Abel,&nbsp;Dianhua Wu","doi":"10.1002/jcd.21958","DOIUrl":"https://doi.org/10.1002/jcd.21958","url":null,"abstract":"&lt;p&gt;A design is said to be &lt;i&gt;super-simple&lt;/i&gt; if the intersection of any two blocks has at most two elements. A design with index &lt;span&gt;&lt;/span&gt;&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; $lambda $&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; is said to be &lt;i&gt;completely reducible&lt;/i&gt;, if its blocks can be partitioned into nonempty collections &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;B&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;i&lt;/mi&gt;\u0000 &lt;/msub&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;≤&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;i&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;≤&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;λ&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; ${{mathscr{B}}}_{i},1le ile lambda $&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, such that each &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;B&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;i&lt;/mi&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; ${{mathscr{B}}}_{i}$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; together with the point set forms a design with index unity. In this paper, it is proved that there exists a completely reducible super-simple (CRSS) &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;4&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;4&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $(v,4,4)$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; balanced incomplete block design (&lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;4&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;4&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $(v,4,4)$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;-BIBD for short) if and only if &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;≥&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;13&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $vge 13$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"33 1","pages":"27-36"},"PeriodicalIF":0.5,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142665937","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
Characterising ovoidal cones by their hyperplane intersection numbers 通过超平面相交数确定卵圆锥的特征
IF 0.5 4区 数学
Journal of Combinatorial Designs Pub Date : 2024-10-09 DOI: 10.1002/jcd.21959
Bart De Bruyn, Geertrui Van de Voorde
{"title":"Characterising ovoidal cones by their hyperplane intersection numbers","authors":"Bart De Bruyn,&nbsp;Geertrui Van de Voorde","doi":"10.1002/jcd.21959","DOIUrl":"https://doi.org/10.1002/jcd.21959","url":null,"abstract":"<p>In this paper, we characterise point sets having the same intersection numbers with respect to hyperplanes as an ovoidal cone. In particular, we show that a set of points of <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mtext>PG</mtext>\u0000 <mrow>\u0000 <mo>(</mo>\u0000 <mrow>\u0000 <mn>4</mn>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mi>q</mi>\u0000 </mrow>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> $text{PG}(4,q)$</annotation>\u0000 </semantics></math> which blocks all planes and intersects solids in <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>q</mi>\u0000 \u0000 <mo>+</mo>\u0000 \u0000 <mn>1</mn>\u0000 </mrow>\u0000 <annotation> $q+1$</annotation>\u0000 </semantics></math>, <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <msup>\u0000 <mi>q</mi>\u0000 \u0000 <mn>2</mn>\u0000 </msup>\u0000 \u0000 <mo>+</mo>\u0000 \u0000 <mn>1</mn>\u0000 </mrow>\u0000 <annotation> ${q}^{2}+1$</annotation>\u0000 </semantics></math> or <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <msup>\u0000 <mi>q</mi>\u0000 \u0000 <mn>2</mn>\u0000 </msup>\u0000 \u0000 <mo>+</mo>\u0000 \u0000 <mi>q</mi>\u0000 \u0000 <mo>+</mo>\u0000 \u0000 <mn>1</mn>\u0000 </mrow>\u0000 <annotation> ${q}^{2}+q+1$</annotation>\u0000 </semantics></math> points is a plane or an ovoidal cone, and determine all examples that arise when the blocking condition is omitted.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"33 1","pages":"5-26"},"PeriodicalIF":0.5,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.21959","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142665775","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
Partitioning the projective plane into two incidence-rich parts 将投影面划分为两个入射丰富的部分
IF 0.5 4区 数学
Journal of Combinatorial Designs Pub Date : 2024-10-06 DOI: 10.1002/jcd.21956
Zoltán Lóránt Nagy
{"title":"Partitioning the projective plane into two incidence-rich parts","authors":"Zoltán Lóránt Nagy","doi":"10.1002/jcd.21956","DOIUrl":"https://doi.org/10.1002/jcd.21956","url":null,"abstract":"<p>An internal or friendly partition of a vertex set <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>V</mi>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mi>G</mi>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> $V(G)$</annotation>\u0000 </semantics></math> of a graph <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> $G$</annotation>\u0000 </semantics></math> is a partition to two nonempty sets <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>A</mi>\u0000 \u0000 <mo>∪</mo>\u0000 \u0000 <mi>B</mi>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> $Acup B$</annotation>\u0000 </semantics></math> such that every vertex has at least as many neighbours in its own class as in the other one. Motivated by Diwan's existence proof on internal partitions of graphs with high girth, we give constructive proofs for the existence of internal partitions in the incidence graph of projective planes and discuss its geometric properties. In addition, we determine exactly the maximum possible difference between the sizes of the neighbour set in its own class and the neighbour set of the other class that can be attained for all vertices at the same time for the incidence graphs of Desarguesian planes of square order.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"32 12","pages":"703-714"},"PeriodicalIF":0.5,"publicationDate":"2024-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.21956","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142429303","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
Nestings of BIBDs with block size four 块大小为 4 的 BIBD 嵌套
IF 0.5 4区 数学
Journal of Combinatorial Designs Pub Date : 2024-10-06 DOI: 10.1002/jcd.21957
Marco Buratti, Donald L. Kreher, Douglas R. Stinson
{"title":"Nestings of BIBDs with block size four","authors":"Marco Buratti,&nbsp;Donald L. Kreher,&nbsp;Douglas R. Stinson","doi":"10.1002/jcd.21957","DOIUrl":"https://doi.org/10.1002/jcd.21957","url":null,"abstract":"&lt;p&gt;In a nesting of a balanced incomplete block design (or BIBD), we wish to add a point (the &lt;i&gt;nested point&lt;/i&gt;) to every block of a &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;λ&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $(v,k,lambda )$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;-BIBD in such a way that we end up with a partial &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;+&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&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;mn&gt;1&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $(v,k+1,lambda +1)$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;-BIBD. In the case where the partial &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;+&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;λ&lt;/mi&gt;\u0000 \u0000 ","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"32 12","pages":"715-743"},"PeriodicalIF":0.5,"publicationDate":"2024-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.21957","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142429304","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
Every latin hypercube of order 5 has transversals 每个 5 阶拉丁超立方体都有横轴
IF 0.5 4区 数学
Journal of Combinatorial Designs Pub Date : 2024-07-30 DOI: 10.1002/jcd.21954
Alexey L. Perezhogin, Vladimir N. Potapov, Sergey Yu. Vladimirov
{"title":"Every latin hypercube of order 5 has transversals","authors":"Alexey L. Perezhogin,&nbsp;Vladimir N. Potapov,&nbsp;Sergey Yu. Vladimirov","doi":"10.1002/jcd.21954","DOIUrl":"10.1002/jcd.21954","url":null,"abstract":"&lt;p&gt;We prove that for all &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;&gt;&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $ngt 1$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; every latin &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $n$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;-dimensional cube of order 5 has transversals. We find all 123 paratopy classes of layer-latin cubes of order 5 with no transversals. For each &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;≥&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;3&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $nge 3$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; and &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;q&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;≥&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;3&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $qge 3$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; we construct a &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 \u0000 &lt;mi&gt;q&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 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;×&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;q&lt;/mi&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;mi&gt;q&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $(2q-2)times qtimes {rm{cdots }}times q$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; latin &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt; $n$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;-dimensional cuboid of order &lt;span&gt;&lt;/span&gt;&lt;ma","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"32 11","pages":"679-699"},"PeriodicalIF":0.5,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141863809","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信