Search arXivSearch

arXiv · 2504.04729

On primitive prime divisors of the orders of Suzuki-Ree groups (corrected version)

Abstract

There is a well-known factorization of the number $2^{2m}+1$, with $m$ odd, related to the orders of tori of simple Suzuki groups: $2^{2m}+1$ is a product of $a=2^m+2^{(m+1)/2}+1$ and $b=2^m-2^{(m+1)/2}+1$. By the Bang-Zsigmondy theorem, there is a primitive prime divisor of $2^{4m}-1$, that is, a prime $r$ that divides $2^{4m}-1$ and does not divide $2^i-1$ for any $i<4m$. It is easy to see that $r$ divides $2^{2m}+1$, and so it divides one of the numbers $a$ and $b$. The main objective of this paper is to show that for every $m>5$, each of $a$ and $b$ is divisible by some primitive prime divisor of $2^{4m}-1$. Also we prove similar results for primitive prime divisors related to the simple Ree groups. As an application, we find the independence and 2-independence numbers of the prime graphs of almost simple Suzuki-Ree groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Maria Grechkoseeva. 2025-04-07. On primitive prime divisors of the orders of Suzuki-Ree groups (corrected version). https://arxiv.org/abs/2504.04729

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR