单词、置换和有限群的不可解长度

IF 0.6 2区 数学 Q3 MATHEMATICS
Alexander Bors, A. Shalev
{"title":"单词、置换和有限群的不可解长度","authors":"Alexander Bors, A. Shalev","doi":"10.4171/JCA/51","DOIUrl":null,"url":null,"abstract":"We study the impact of certain identities and probabilistic identities on the structure of finite groups. More specifically, let $w$ be a nontrivial word in $d$ distinct variables and let $G$ be a finite group for which the word map $w_G:G^d\\rightarrow G$ has a fiber of size at least $\\rho|G|^d$ for some fixed $\\rho>0$. We show that, for certain words $w$, this implies that $G$ has a normal solvable subgroup of index bounded above in terms of $w$ and $\\rho$. We also show that, for a larger family of words $w$, this implies that the nonsolvable length of $G$ is bounded above in terms of $w$ and $\\rho$, thus providing evidence in favor of a conjecture of Larsen. Along the way we obtain results of some independent interest, showing roughly that most elements of large finite permutation groups have large support.","PeriodicalId":48483,"journal":{"name":"Journal of Combinatorial Algebra","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2019-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Words, permutations, and the nonsolvable length of a finite group\",\"authors\":\"Alexander Bors, A. Shalev\",\"doi\":\"10.4171/JCA/51\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the impact of certain identities and probabilistic identities on the structure of finite groups. More specifically, let $w$ be a nontrivial word in $d$ distinct variables and let $G$ be a finite group for which the word map $w_G:G^d\\\\rightarrow G$ has a fiber of size at least $\\\\rho|G|^d$ for some fixed $\\\\rho>0$. We show that, for certain words $w$, this implies that $G$ has a normal solvable subgroup of index bounded above in terms of $w$ and $\\\\rho$. We also show that, for a larger family of words $w$, this implies that the nonsolvable length of $G$ is bounded above in terms of $w$ and $\\\\rho$, thus providing evidence in favor of a conjecture of Larsen. Along the way we obtain results of some independent interest, showing roughly that most elements of large finite permutation groups have large support.\",\"PeriodicalId\":48483,\"journal\":{\"name\":\"Journal of Combinatorial Algebra\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2019-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Algebra\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.4171/JCA/51\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Algebra","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.4171/JCA/51","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 3

摘要

研究了某些恒等式和概率恒等式对有限群结构的影响。更具体地说,设$w$为$d$不同变量中的一个非平凡单词,设$G$为一个有限组,其中对于某个固定的$\rho>0$,单词映射$w_G:G^d\rightarrow G$的纤维大小至少为$\rho|G|^d$。我们表明,对于某些单词$w$,这意味着$G$有一个正常可解的子群,该子群在$w$和$\rho$方面有界。我们还表明,对于更大的单词族$w$,这意味着$G$的不可解长度在$w$和$\rho$方面有界,从而为Larsen的猜想提供了证据。在此过程中,我们获得了一些独立的结果,大致表明大型有限置换群的大多数元素具有很大的支持度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Words, permutations, and the nonsolvable length of a finite group
We study the impact of certain identities and probabilistic identities on the structure of finite groups. More specifically, let $w$ be a nontrivial word in $d$ distinct variables and let $G$ be a finite group for which the word map $w_G:G^d\rightarrow G$ has a fiber of size at least $\rho|G|^d$ for some fixed $\rho>0$. We show that, for certain words $w$, this implies that $G$ has a normal solvable subgroup of index bounded above in terms of $w$ and $\rho$. We also show that, for a larger family of words $w$, this implies that the nonsolvable length of $G$ is bounded above in terms of $w$ and $\rho$, thus providing evidence in favor of a conjecture of Larsen. Along the way we obtain results of some independent interest, showing roughly that most elements of large finite permutation groups have large support.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.20
自引率
0.00%
发文量
9
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信