A linear bound for (n)

DOI10.1006/JABR.1995.1370zbMATH Open0859.20014OpenAlexW2042192787MaRDI QIDQ1906641FDOQ1906641

Authors: Thomas Michael Keller 

Publication date: 17 February 1997

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jabr.1995.1370

Recommendations

• On the asymptotic behaviour of \(\rho(n)\)
• scientific article
• scientific article; zbMATH DE number 872074
• On Huppert's \(\rho\)-\(\sigma\) conjecture
• Solvable groups with a small number of prime divisors in the element orders

zbMATH Keywords

finite solvable groupsarithmetic conditions on element ordersnumbers of prime divisors

Mathematics Subject Classification ID

Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Asymptotic results on counting functions for algebraic and topological structures (11N45)

Cited In (14)

• Results related to Huppert's $\rho$-$\sigma$ conjecture
• Title not available (Why is that?)
• New bounds for numbers of primes in element orders of finite groups
• Co-degree graphs and order elements
• On the prime divisors of element orders
• Prime Factors of Character Degrees of Solvable Groups
• A linear bound on the dimension in Green-Ruzsa's theorem
• ON ANALOGUES OF HUPPERT’S CONJECTURE
• A characterization of the prime graphs of solvable groups.
• Huppert's conjecture for character codegrees
• On the asymptotic behaviour of \(\rho(n)\)
• The analog of Huppert's conjecture on character codegrees
• Solvable groups with a small number of prime divisors in the element orders
• On the number of different prime divisors of element orders

This page was built for publication: A linear bound for \(\rho(n)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1906641)