Latin squares with five disjoint subsquares

IF 0.5 4区数学 Q3 MATHEMATICS

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":null,"url":null,"abstract":"Given an integer partition <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mrow>\n <mo>(</mo>\n \n <mrow>\n <msub>\n <mi>h</mi>\n \n <mn>1</mn>\n </msub>\n \n <msub>\n <mi>h</mi>\n \n <mn>2</mn>\n </msub>\n \n <mi>…</mi>\n \n <msub>\n <mi>h</mi>\n \n <mi>k</mi>\n </msub>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n <annotation> $({h}_{1}{h}_{2}{\\rm{\\ldots }}{h}_{k})$</annotation>\n </semantics></math> of <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>n</mi>\n </mrow>\n </mrow>\n <annotation> $n$</annotation>\n </semantics></math>, is it possible to find an order <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>n</mi>\n </mrow>\n </mrow>\n <annotation> $n$</annotation>\n </semantics></math> latin square with <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>k</mi>\n </mrow>\n </mrow>\n <annotation> $k$</annotation>\n </semantics></math> pairwise disjoint subsquares of orders <math>\n <semantics>\n <mrow>\n \n <mrow>\n <msub>\n <mi>h</mi>\n \n <mn>1</mn>\n </msub>\n \n <mo>,</mo>\n \n <mi>…</mi>\n \n <mo>,</mo>\n \n <msub>\n <mi>h</mi>\n \n <mi>k</mi>\n </msub>\n </mrow>\n </mrow>\n <annotation> ${h}_{1},{\\rm{\\ldots }},{h}_{k}$</annotation>\n </semantics></math>? This question was posed by Fuchs and has been answered for all partitions with <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>k</mi>\n \n <mo>≤</mo>\n \n <mn>4</mn>\n </mrow>\n </mrow>\n <annotation> $k\\le 4$</annotation>\n </semantics></math>. In this paper, we answer the question in the case <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>k</mi>\n \n <mo>=</mo>\n \n <mn>5</mn>\n </mrow>\n </mrow>\n <annotation> $k=5$</annotation>\n </semantics></math> and expand on results for special cases of this, such as when the largest part is at most three times the smallest part.","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"33 2","pages":"39-57"},"PeriodicalIF":0.5000,"publicationDate":"2024-10-16","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.21960","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

Abstract

Given an integer partition $(h_{1} h_{2} \dots h_{k})$ of $n$ , is it possible to find an order $n$ latin square with $k$ pairwise disjoint subsquares of orders $h_{1}, \dots, h_{k}$ ? This question was posed by Fuchs and has been answered for all partitions with $k \leq 4$ . In this paper, we answer the question in the case $k = 5$ and expand on results for special cases of this, such as when the largest part is at most three times the smallest part.

查看原文本刊更多论文

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Combinatorial Designs 数学-数学

CiteScore

1.60

自引率

14.30%

发文量

审稿时长

>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.