Revisiting the number of simple K₄-groups

2013/07/30 by Shaohua Zhang, Zhang, Shaohua, Wujie Shi +1
Computer Science · Mathematics · #11D45 #11D61 #20D05 #Analytic Number Theory Research #Digital Image Processing Techniques #FOS: Mathematics #I.7.2 #Mathematical Dynamics and Fractals #Number Theory (math.NT) #acm:11D45 #acm:11D61 #acm:20D05 #math.NT #msc:11D45 #msc:11D61 #msc:20D05

paper · pdf · doi:10.48550/arxiv.1307.8079

9 pages

arxiv created 2013/07/30 · openalex publication_date 2013/07/30 · arxiv updated 2013/07/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, by solving Diophantine equations involving simple K₄-groups, we will try to point out that it is not easy to prove the infinitude of simple K₄-groups. This problem goes far beyond what is known about Dickson's conjecture at present.

Related

• A counterexample for the conjecture of finite simple groups
• Constructing solvable groups with derived length four and four character degrees
• On some conjectures related to finite nonabelian simple groups
• Finite Permutation Groups and Finite Simple Groups
• On Quillen's conjecture for p-solvable groups