Characterizing Pyramidal Hadamard Designs With the Largest Number of Fixed Points

IF 0.8 4区 数学 Q3 MATHEMATICS
Journal of Combinatorial Designs Pub Date : 2026-10-12 Epub Date: 2026-09-10 DOI:10.1002/jcd.70036
Tommaso Traetta
{"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>&lt;</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>&gt;</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}
引用次数: 0

Abstract

A symmetric ( v , k , λ ) -design is said to be f -pyramidal, with f < v − 1 , under the action of a group G if G acts as an automorphism group fixing f points and acting sharply transitively on the remaining ones. We show that, necessarily, f ≤ v − 2 ( k − λ ) . In particular, for a Hadamard design with parameters ( v , k , λ ) = ( 4 m − 1 , 2 m − 1 , m − 1 ) , for some m ∈ N , it follows that f ≤ 2 m − 1 . Recently, working on the complement design, the family P of Hadamard ( 4 m − 1 , 2 m − 1 , m − 1 ) -designs admitting an abelian ( 2 m − 1 ) -pyramidal automorphism group G has been completely determined in the case m = 2 k > 1 . In this paper, we generalize that result by showing that P coincides with the family of Hadamard ( 4 m − 1 , 2 m − 1 , m − 1 ) -designs admitting a ( 2 m − 1 ) -pyramidal automorphism group, without assuming either that the group is abelian or that m is a power of 2.

具有最大不动点数的金字塔形阿达玛设计的特征
最近,在补体设计的工作中,Hadamard家族P(4米−1、2 m−1、M−1)-允许阿贝尔(2 m−1)-锥体自同构群在m = 2k的情况下,G已经完全确定&gt; 1;在本文中,我们通过证明P与Hadamard(4)族重合来推广这一结果M−1,2 M−1,M−1)-允许a (2 m−1)-锥体自同构群;不用假设这个群是阿贝尔的也不用假设m是2的幂。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.60
自引率
14.30%
发文量
55
审稿时长
>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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书