Orders of simple groups and the Bateman--Horn Conjecture
Author(s):
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
We use the Bateman--Horn Conjecture from number theory to give strong evidence of a positive answer to Peter Neumann's question, whether there are infinitely many simple groups of order a product of six primes. (Those with fewer than six were classified by Burnside, Frobenius and H\"older in the 1890s.) The groups satisfying this condition are ${\rm PSL}_2(8)$, ${\rm PSL}_2(9)$ and ${\rm PSL}_2(p)$ for primes $p$ such that $p^2-1$ is a product of six primes. The conjecture suggests that there are infinitely many such primes $p$, by providing heuristic estimates for their distribution which agree closely with evidence from computer searches. We also briefly discuss the applications of this conjecture to other problems in group theory, such as the classifications of permutation groups and of linear groups of prime degree, the structure of the power graph of a finite simple group, the construction of highly symmetric block designs, and the possible existence of infinitely many K$n$ groups for each $n\ge 5$.
Keywords:
Language:
English
Published:
International Journal of Group Theory, Volume:13 Issue: 3, Sep 2024
Pages:
257 to 269
magiran.com/p2662933
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 1,390,000ريال میتوانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
- حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران میشود.
- پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانههای چاپی و دیجیتال را به کاربر نمیدهد.
In order to view content subscription is required
Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!