New bounds for numbers of primes in element orders of finite groups
DOI10.1002/mana.202200484zbMath1530.20065arXiv2211.05837OpenAlexW4386714944MaRDI QIDQ6144873
Thomas Michael Keller, Timothy S. Trudgian, Chiara Bellotti
Publication date: 8 January 2024
Published in: Mathematische Nachrichten (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.05837
Ordinary representations and characters (20C15) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Arithmetic and combinatorial problems involving abstract finite groups (20D60) General structure theorems for groups (20E34) Distribution of primes (11N05)
Cites Work
- Unnamed Item
- The analog of Huppert's conjecture on character codegrees
- Explicit bounds for primes in arithmetic progressions
- Character theory of finite groups
- Solvable groups with a small number of prime divisors in the element orders
- On the asymptotic Taketa bound for A-groups
- On the asymptotic behaviour of \(\rho(n)\)
- Solvable groups with at most four prime divisors in the element orders
- A linear bound for \(\rho(n)\)
- Improving bounds on prime counting functions by partial verification of the Riemann hypothesis
- Approximate formulas for some functions of prime numbers
- Estimating $\pi (x)$ and related functions under partial RH assumptions
- Arithmetical Conditions on Element Orders and Group Structure
- An analytic method for bounding 𝜓(𝑥)
- ON ANALOGUES OF HUPPERT’S CONJECTURE
- Sharper bounds for the Chebyshev function 𝜃(𝑥)
- The Riemann hypothesis is true up to 3·1012
- A still sharper region where $\pi (x)-{\mathrm {li}}(x)$ is positive
- On the number of different prime divisors of element orders
- On recognition of direct powers of finite simple linear groups by spectrum
- Huppert's conjecture for character codegrees
- On the prime divisors of element orders
This page was built for publication: New bounds for numbers of primes in element orders of finite groups
