下载PDF
{"title":"具有最大不动点数的金字塔形阿达玛设计的特征","authors":"Tommaso Traetta","doi":"10.1002/jcd.70036","DOIUrl":null,"url":null,"abstract":"<p>A symmetric <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>v</mi>\n \n <mo>,</mo>\n \n <mi>k</mi>\n \n <mo>,</mo>\n \n <mi>λ</mi>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n </semantics></math>-design is said to be <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>f</mi>\n </mrow>\n </mrow>\n </semantics></math>-pyramidal, with <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>f</mi>\n \n <mo><</mo>\n \n <mi>v</mi>\n \n <mo>−</mo>\n \n <mn>1</mn>\n </mrow>\n </mrow>\n </semantics></math>, under the action of a group <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>G</mi>\n </mrow>\n </mrow>\n </semantics></math> if <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>G</mi>\n </mrow>\n </mrow>\n </semantics></math> acts as an automorphism group fixing <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>f</mi>\n </mrow>\n </mrow>\n </semantics></math> points and acting sharply transitively on the remaining ones. We show that, necessarily, <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>f</mi>\n \n <mo>≤</mo>\n \n <mi>v</mi>\n \n <mo>−</mo>\n \n <mn>2</mn>\n \n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>k</mi>\n \n <mo>−</mo>\n \n <mi>λ</mi>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n </semantics></math>. In particular, for a Hadamard design with parameters <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>v</mi>\n \n <mo>,</mo>\n \n <mi>k</mi>\n \n <mo>,</mo>\n \n <mi>λ</mi>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n \n <mo>=</mo>\n \n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mn>4</mn>\n \n <mi>m</mi>\n \n <mo>−</mo>\n \n <mn>1</mn>\n \n <mo>,</mo>\n \n <mn>2</mn>\n \n <mi>m</mi>\n \n <mo>−</mo>\n \n <mn>1</mn>\n \n <mo>,</mo>\n \n <mi>m</mi>\n \n <mo>−</mo>\n \n <mn>1</mn>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n </semantics></math>, for some <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>m</mi>\n \n <mo>∈</mo>\n \n <mi>N</mi>\n </mrow>\n </mrow>\n </semantics></math>, it follows that <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>f</mi>\n \n <mo>≤</mo>\n \n <mn>2</mn>\n \n <mi>m</mi>\n \n <mo>−</mo>\n \n <mn>1</mn>\n </mrow>\n </mrow>\n </semantics></math>. Recently, working on the complement design, the family <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>P</mi>\n </mrow>\n </mrow>\n </semantics></math> of Hadamard <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mn>4</mn>\n \n <mi>m</mi>\n \n <mo>−</mo>\n \n <mn>1</mn>\n \n <mo>,</mo>\n \n <mn>2</mn>\n \n <mi>m</mi>\n \n <mo>−</mo>\n \n <mn>1</mn>\n \n <mo>,</mo>\n \n <mi>m</mi>\n \n <mo>−</mo>\n \n <mn>1</mn>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n </semantics></math>-designs admitting an abelian <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mn>2</mn>\n \n <mi>m</mi>\n \n <mo>−</mo>\n \n <mn>1</mn>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n </semantics></math>-pyramidal automorphism group <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>G</mi>\n </mrow>\n </mrow>\n </semantics></math> has been completely determined in the case <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>m</mi>\n \n <mo>=</mo>\n \n <msup>\n <mn>2</mn>\n \n <mi>k</mi>\n </msup>\n \n <mo>></mo>\n \n <mn>1</mn>\n </mrow>\n </mrow>\n </semantics></math>. In this paper, we generalize that result by showing that <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>P</mi>\n </mrow>\n </mrow>\n </semantics></math> coincides with the family of Hadamard <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mn>4</mn>\n \n <mi>m</mi>\n \n <mo>−</mo>\n \n <mn>1</mn>\n \n <mo>,</mo>\n \n <mn>2</mn>\n \n <mi>m</mi>\n \n <mo>−</mo>\n \n <mn>1</mn>\n \n <mo>,</mo>\n \n <mi>m</mi>\n \n <mo>−</mo>\n \n <mn>1</mn>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n </semantics></math>-designs admitting a <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mn>2</mn>\n \n <mi>m</mi>\n \n <mo>−</mo>\n \n <mn>1</mn>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n </semantics></math>-pyramidal automorphism group, without assuming either that the group is abelian or that <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>m</mi>\n </mrow>\n </mrow>\n </semantics></math> is a power of 2.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"34 12","pages":"569-573"},"PeriodicalIF":0.8000,"publicationDate":"2026-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.70036","citationCount":"0","resultStr":"{\"title\":\"Characterizing Pyramidal Hadamard Designs With the Largest Number of Fixed Points\",\"authors\":\"Tommaso Traetta\",\"doi\":\"10.1002/jcd.70036\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>A symmetric <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mrow>\\n <mo>(</mo>\\n \\n <mrow>\\n <mi>v</mi>\\n \\n <mo>,</mo>\\n \\n <mi>k</mi>\\n \\n <mo>,</mo>\\n \\n <mi>λ</mi>\\n </mrow>\\n \\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n </mrow>\\n </semantics></math>-design is said to be <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>f</mi>\\n </mrow>\\n </mrow>\\n </semantics></math>-pyramidal, with <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>f</mi>\\n \\n <mo><</mo>\\n \\n <mi>v</mi>\\n \\n <mo>−</mo>\\n \\n <mn>1</mn>\\n </mrow>\\n </mrow>\\n </semantics></math>, under the action of a group <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>G</mi>\\n </mrow>\\n </mrow>\\n </semantics></math> if <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>G</mi>\\n </mrow>\\n </mrow>\\n </semantics></math> acts as an automorphism group fixing <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>f</mi>\\n </mrow>\\n </mrow>\\n </semantics></math> points and acting sharply transitively on the remaining ones. We show that, necessarily, <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>f</mi>\\n \\n <mo>≤</mo>\\n \\n <mi>v</mi>\\n \\n <mo>−</mo>\\n \\n <mn>2</mn>\\n \\n <mrow>\\n <mo>(</mo>\\n \\n <mrow>\\n <mi>k</mi>\\n \\n <mo>−</mo>\\n \\n <mi>λ</mi>\\n </mrow>\\n \\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n </mrow>\\n </semantics></math>. In particular, for a Hadamard design with parameters <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mrow>\\n <mo>(</mo>\\n \\n <mrow>\\n <mi>v</mi>\\n \\n <mo>,</mo>\\n \\n <mi>k</mi>\\n \\n <mo>,</mo>\\n \\n <mi>λ</mi>\\n </mrow>\\n \\n <mo>)</mo>\\n </mrow>\\n \\n <mo>=</mo>\\n \\n <mrow>\\n <mo>(</mo>\\n \\n <mrow>\\n <mn>4</mn>\\n \\n <mi>m</mi>\\n \\n <mo>−</mo>\\n \\n <mn>1</mn>\\n \\n <mo>,</mo>\\n \\n <mn>2</mn>\\n \\n <mi>m</mi>\\n \\n <mo>−</mo>\\n \\n <mn>1</mn>\\n \\n <mo>,</mo>\\n \\n <mi>m</mi>\\n \\n <mo>−</mo>\\n \\n <mn>1</mn>\\n </mrow>\\n \\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n </mrow>\\n </semantics></math>, for some <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>m</mi>\\n \\n <mo>∈</mo>\\n \\n <mi>N</mi>\\n </mrow>\\n </mrow>\\n </semantics></math>, it follows that <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>f</mi>\\n \\n <mo>≤</mo>\\n \\n <mn>2</mn>\\n \\n <mi>m</mi>\\n \\n <mo>−</mo>\\n \\n <mn>1</mn>\\n </mrow>\\n </mrow>\\n </semantics></math>. Recently, working on the complement design, the family <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>P</mi>\\n </mrow>\\n </mrow>\\n </semantics></math> of Hadamard <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mrow>\\n <mo>(</mo>\\n \\n <mrow>\\n <mn>4</mn>\\n \\n <mi>m</mi>\\n \\n <mo>−</mo>\\n \\n <mn>1</mn>\\n \\n <mo>,</mo>\\n \\n <mn>2</mn>\\n \\n <mi>m</mi>\\n \\n <mo>−</mo>\\n \\n <mn>1</mn>\\n \\n <mo>,</mo>\\n \\n <mi>m</mi>\\n \\n <mo>−</mo>\\n \\n <mn>1</mn>\\n </mrow>\\n \\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n </mrow>\\n </semantics></math>-designs admitting an abelian <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mrow>\\n <mo>(</mo>\\n \\n <mrow>\\n <mn>2</mn>\\n \\n <mi>m</mi>\\n \\n <mo>−</mo>\\n \\n <mn>1</mn>\\n </mrow>\\n \\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n </mrow>\\n </semantics></math>-pyramidal automorphism group <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>G</mi>\\n </mrow>\\n </mrow>\\n </semantics></math> has been completely determined in the case <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>m</mi>\\n \\n <mo>=</mo>\\n \\n <msup>\\n <mn>2</mn>\\n \\n <mi>k</mi>\\n </msup>\\n \\n <mo>></mo>\\n \\n <mn>1</mn>\\n </mrow>\\n </mrow>\\n </semantics></math>. In this paper, we generalize that result by showing that <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>P</mi>\\n </mrow>\\n </mrow>\\n </semantics></math> coincides with the family of Hadamard <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mrow>\\n <mo>(</mo>\\n \\n <mrow>\\n <mn>4</mn>\\n \\n <mi>m</mi>\\n \\n <mo>−</mo>\\n \\n <mn>1</mn>\\n \\n <mo>,</mo>\\n \\n <mn>2</mn>\\n \\n <mi>m</mi>\\n \\n <mo>−</mo>\\n \\n <mn>1</mn>\\n \\n <mo>,</mo>\\n \\n <mi>m</mi>\\n \\n <mo>−</mo>\\n \\n <mn>1</mn>\\n </mrow>\\n \\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n </mrow>\\n </semantics></math>-designs admitting a <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mrow>\\n <mo>(</mo>\\n \\n <mrow>\\n <mn>2</mn>\\n \\n <mi>m</mi>\\n \\n <mo>−</mo>\\n \\n <mn>1</mn>\\n </mrow>\\n \\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n </mrow>\\n </semantics></math>-pyramidal automorphism group, without assuming either that the group is abelian or that <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mi>m</mi>\\n </mrow>\\n </mrow>\\n </semantics></math> is a power of 2.</p>\",\"PeriodicalId\":15389,\"journal\":{\"name\":\"Journal of Combinatorial Designs\",\"volume\":\"34 12\",\"pages\":\"569-573\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2026-10-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.70036\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Designs\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jcd.70036\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2026/9/10 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Designs","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jcd.70036","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/9/10 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
引用
批量引用