Intersection density of imprimitive groups of degree pq

IF 0.9 2区 数学 Q2 MATHEMATICS Journal of Combinatorial Theory Series A Pub Date : 2024-06-12 DOI:10.1016/j.jcta.2024.105922
Angelot Behajaina , Roghayeh Maleki , Andriaherimanana Sarobidy Razafimahatratra
{"title":"Intersection density of imprimitive groups of degree pq","authors":"Angelot Behajaina ,&nbsp;Roghayeh Maleki ,&nbsp;Andriaherimanana Sarobidy Razafimahatratra","doi":"10.1016/j.jcta.2024.105922","DOIUrl":null,"url":null,"abstract":"<div><p>A subset <span><math><mi>F</mi></math></span> of a finite transitive group <span><math><mi>G</mi><mo>≤</mo><mi>Sym</mi><mo>(</mo><mi>Ω</mi><mo>)</mo></math></span> is <em>intersecting</em> if any two elements of <span><math><mi>F</mi></math></span> agree on an element of Ω. The <em>intersection density</em> of <em>G</em> is the number<span><span><span><math><mi>ρ</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>=</mo><mi>max</mi><mo>⁡</mo><mrow><mo>{</mo><mrow><mo>|</mo><mi>F</mi><mo>|</mo></mrow><mo>/</mo><mo>|</mo><msub><mrow><mi>G</mi></mrow><mrow><mi>ω</mi></mrow></msub><mo>|</mo><mo>|</mo><mi>F</mi><mo>⊂</mo><mi>G</mi><mtext> is intersecting</mtext><mo>}</mo></mrow><mo>,</mo></math></span></span></span> where <span><math><mi>ω</mi><mo>∈</mo><mi>Ω</mi></math></span> and <span><math><msub><mrow><mi>G</mi></mrow><mrow><mi>ω</mi></mrow></msub></math></span> is the stabilizer of <em>ω</em> in <em>G</em>. It is known that if <span><math><mi>G</mi><mo>≤</mo><mi>Sym</mi><mo>(</mo><mi>Ω</mi><mo>)</mo></math></span> is an imprimitive group of degree a product of two odd primes <span><math><mi>p</mi><mo>&gt;</mo><mi>q</mi></math></span> admitting a block of size <em>p</em> or two complete block systems, whose blocks are of size <em>q</em>, then <span><math><mi>ρ</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>=</mo><mn>1</mn></math></span>.</p><p>In this paper, we analyze the intersection density of imprimitive groups of degree <em>pq</em> with a unique block system with blocks of size <em>q</em> based on the kernel of the induced action on blocks. For those whose kernels are non-trivial, it is proved that the intersection density is larger than 1 whenever there exists a cyclic code <em>C</em> with parameters <span><math><msub><mrow><mo>[</mo><mi>p</mi><mo>,</mo><mi>k</mi><mo>]</mo></mrow><mrow><mi>q</mi></mrow></msub></math></span> such that any codeword of <em>C</em> has weight at most <span><math><mi>p</mi><mo>−</mo><mn>1</mn></math></span>, and under some additional conditions on the cyclic code, it is a proper rational number. For those that are quasiprimitive, we reduce the cases to almost simple groups containing <span><math><mi>Alt</mi><mo>(</mo><mn>5</mn><mo>)</mo></math></span> or a projective special linear group. We give some examples where the latter has intersection density equal to 1, under some restrictions on <em>p</em> and <em>q</em>.</p></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"208 ","pages":"Article 105922"},"PeriodicalIF":0.9000,"publicationDate":"2024-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S009731652400061X/pdfft?md5=4600ca58b59525e76de9f361f9c870b7&pid=1-s2.0-S009731652400061X-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series A","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S009731652400061X","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

A subset F of a finite transitive group GSym(Ω) is intersecting if any two elements of F agree on an element of Ω. The intersection density of G is the numberρ(G)=max{|F|/|Gω||FG is intersecting}, where ωΩ and Gω is the stabilizer of ω in G. It is known that if GSym(Ω) is an imprimitive group of degree a product of two odd primes p>q admitting a block of size p or two complete block systems, whose blocks are of size q, then ρ(G)=1.

In this paper, we analyze the intersection density of imprimitive groups of degree pq with a unique block system with blocks of size q based on the kernel of the induced action on blocks. For those whose kernels are non-trivial, it is proved that the intersection density is larger than 1 whenever there exists a cyclic code C with parameters [p,k]q such that any codeword of C has weight at most p1, and under some additional conditions on the cyclic code, it is a proper rational number. For those that are quasiprimitive, we reduce the cases to almost simple groups containing Alt(5) or a projective special linear group. We give some examples where the latter has intersection density equal to 1, under some restrictions on p and q.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
pq 度冒号群的交集密度
有限传递群 G≤Sym(Ω) 的一个子集 F,如果 F 的任意两个元素与 Ω 的一个元素一致,则该子集 F 是相交的。G 的相交密度为ρ(G)=max{|F|/|Gω||F⊂G 是相交的},其中 ω∈Ω 和 Gω 是 ω 在 G 中的稳定子。众所周知,如果 G≤Sym(Ω) 是一个阶数为两个奇数素数 p>q 的乘积的冒元群,其中容纳一个大小为 p 的块或两个完整的块系统,其块的大小为 q,则 ρ(G)=1...... 在本文中,我们根据块上诱导作用的内核,分析了阶数为 pq 的冒元群与具有大小为 q 的块的唯一块系统的交集密度。对于那些内核是非琐碎的,只要存在一个参数为 [p,k]q 的循环码 C,使得 C 的任何码元的权重至多为 p-1,并且在循环码的一些附加条件下,它是一个适当的有理数,那么就证明交集密度大于 1。对于那些准三元组,我们将其简化为包含 Alt(5) 或投影特殊线性群的几乎简单群。我们给出了一些例子,在 p 和 q 的某些限制条件下,后者的交集密度等于 1。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.90
自引率
9.10%
发文量
94
审稿时长
12 months
期刊介绍: The Journal of Combinatorial Theory publishes original mathematical research concerned with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series A is concerned primarily with structures, designs, and applications of combinatorics and is a valuable tool for mathematicians and computer scientists.
期刊最新文献
Dominance complexes, neighborhood complexes and combinatorial Alexander duals Upper bounds for the number of substructures in finite geometries from the container method The vector space generated by permutations of a trade or a design Editorial Board Some conjectures of Ballantine and Merca on truncated sums and the minimal excludant in congruences classes
×
引用
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