关于交替群的编码度特征

IF 0.6 4区 数学 Q3 MATHEMATICS Bulletin of the Australian Mathematical Society Pub Date : 2024-01-26 DOI:10.1017/s0004972723001429
MALLORY DOLORFINO, LUKE MARTIN, ZACHARY SLONIM, YUXUAN SUN, YONG YANG
{"title":"关于交替群的编码度特征","authors":"MALLORY DOLORFINO, LUKE MARTIN, ZACHARY SLONIM, YUXUAN SUN, YONG YANG","doi":"10.1017/s0004972723001429","DOIUrl":null,"url":null,"abstract":"Let <jats:italic>G</jats:italic> be a finite group and <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0004972723001429_inline1.png\" /> <jats:tex-math> $\\mathrm {Irr}(G)$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> the set of all irreducible complex characters of <jats:italic>G</jats:italic>. Define the codegree of <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0004972723001429_inline2.png\" /> <jats:tex-math> $\\chi \\in \\mathrm {Irr}(G)$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> as <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0004972723001429_inline3.png\" /> <jats:tex-math> $\\mathrm {cod}(\\chi ):={|G:\\mathrm {ker}(\\chi ) |}/{\\chi (1)}$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> and let <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0004972723001429_inline4.png\" /> <jats:tex-math> $\\mathrm {cod}(G):=\\{\\mathrm {cod}(\\chi ) \\mid \\chi \\in \\mathrm {Irr}(G)\\}$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> be the codegree set of <jats:italic>G</jats:italic>. Let <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0004972723001429_inline5.png\" /> <jats:tex-math> $\\mathrm {A}_n$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> be an alternating group of degree <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0004972723001429_inline6.png\" /> <jats:tex-math> $n \\ge 5$ </jats:tex-math> </jats:alternatives> </jats:inline-formula>. We show that <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0004972723001429_inline7.png\" /> <jats:tex-math> $\\mathrm {A}_n$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> is determined up to isomorphism by <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0004972723001429_inline8.png\" /> <jats:tex-math> $\\operatorname {cod}(\\mathrm {A}_n)$ </jats:tex-math> </jats:alternatives> </jats:inline-formula>.","PeriodicalId":50720,"journal":{"name":"Bulletin of the Australian Mathematical Society","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2024-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"ON THE CHARACTERISATION OF ALTERNATING GROUPS BY CODEGREES\",\"authors\":\"MALLORY DOLORFINO, LUKE MARTIN, ZACHARY SLONIM, YUXUAN SUN, YONG YANG\",\"doi\":\"10.1017/s0004972723001429\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let <jats:italic>G</jats:italic> be a finite group and <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" mime-subtype=\\\"png\\\" xlink:href=\\\"S0004972723001429_inline1.png\\\" /> <jats:tex-math> $\\\\mathrm {Irr}(G)$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> the set of all irreducible complex characters of <jats:italic>G</jats:italic>. Define the codegree of <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" mime-subtype=\\\"png\\\" xlink:href=\\\"S0004972723001429_inline2.png\\\" /> <jats:tex-math> $\\\\chi \\\\in \\\\mathrm {Irr}(G)$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> as <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" mime-subtype=\\\"png\\\" xlink:href=\\\"S0004972723001429_inline3.png\\\" /> <jats:tex-math> $\\\\mathrm {cod}(\\\\chi ):={|G:\\\\mathrm {ker}(\\\\chi ) |}/{\\\\chi (1)}$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> and let <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" mime-subtype=\\\"png\\\" xlink:href=\\\"S0004972723001429_inline4.png\\\" /> <jats:tex-math> $\\\\mathrm {cod}(G):=\\\\{\\\\mathrm {cod}(\\\\chi ) \\\\mid \\\\chi \\\\in \\\\mathrm {Irr}(G)\\\\}$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> be the codegree set of <jats:italic>G</jats:italic>. Let <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" mime-subtype=\\\"png\\\" xlink:href=\\\"S0004972723001429_inline5.png\\\" /> <jats:tex-math> $\\\\mathrm {A}_n$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> be an alternating group of degree <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" mime-subtype=\\\"png\\\" xlink:href=\\\"S0004972723001429_inline6.png\\\" /> <jats:tex-math> $n \\\\ge 5$ </jats:tex-math> </jats:alternatives> </jats:inline-formula>. We show that <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" mime-subtype=\\\"png\\\" xlink:href=\\\"S0004972723001429_inline7.png\\\" /> <jats:tex-math> $\\\\mathrm {A}_n$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> is determined up to isomorphism by <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" mime-subtype=\\\"png\\\" xlink:href=\\\"S0004972723001429_inline8.png\\\" /> <jats:tex-math> $\\\\operatorname {cod}(\\\\mathrm {A}_n)$ </jats:tex-math> </jats:alternatives> </jats:inline-formula>.\",\"PeriodicalId\":50720,\"journal\":{\"name\":\"Bulletin of the Australian Mathematical Society\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-01-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bulletin of the Australian Mathematical Society\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1017/s0004972723001429\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of the Australian Mathematical Society","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1017/s0004972723001429","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

让 G 是一个有限群,$\mathrm {Irrr}(G)$ 是 G 所有不可还原复字符的集合。定义 $\chi 在 \mathrm {Irr}(G)$ 中的codegree为 $\mathrm {cod}(\chi ):={|G:|}/{\chi (1)}$ 并且让 $\mathrm {cod}(G):=\{mathrm {cod}(\chi ) \mid \chi \in \mathrm {Irrr}(G)\}$ 是 G 的codegree集合。让 $\mathrm {A}_n$ 是一个度数为 $n\ge 5$ 的交替群。我们证明 $\mathrm {A}_n$ 是由 $\operatorname {cod}(\mathrm {A}_n)$ 同构决定的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
ON THE CHARACTERISATION OF ALTERNATING GROUPS BY CODEGREES
Let G be a finite group and $\mathrm {Irr}(G)$ the set of all irreducible complex characters of G. Define the codegree of $\chi \in \mathrm {Irr}(G)$ as $\mathrm {cod}(\chi ):={|G:\mathrm {ker}(\chi ) |}/{\chi (1)}$ and let $\mathrm {cod}(G):=\{\mathrm {cod}(\chi ) \mid \chi \in \mathrm {Irr}(G)\}$ be the codegree set of G. Let $\mathrm {A}_n$ be an alternating group of degree $n \ge 5$ . We show that $\mathrm {A}_n$ is determined up to isomorphism by $\operatorname {cod}(\mathrm {A}_n)$ .
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.20
自引率
14.30%
发文量
149
审稿时长
4-8 weeks
期刊介绍: Bulletin of the Australian Mathematical Society aims at quick publication of original research in all branches of mathematics. Papers are accepted only after peer review but editorial decisions on acceptance or otherwise are taken quickly, normally within a month of receipt of the paper. The Bulletin concentrates on presenting new and interesting results in a clear and attractive way. Published Bi-monthly Published for the Australian Mathematical Society
期刊最新文献
EXTREMAL GRAPHS FOR DEGREE SUMS AND DOMINATING CYCLES GRAPHS WITH SEMITOTAL DOMINATION NUMBER HALF THEIR ORDER INEQUALITIES AND UNIFORM ASYMPTOTIC FORMULAE FOR SPT-CRANK OF PARTITIONS MONOGENIC EVEN QUARTIC TRINOMIALS ON A CONJECTURE ON SHIFTED PRIMES WITH LARGE PRIME FACTORS, II
×
引用
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