Elements Powering to Strong Involutions in Finite Classical Groups of Odd Characteristic: Order 1/log n and a Log-Periodic Asymptotic

Let G be a finite n-dimensional classical group over a field of odd order q, and let Q be the set of elements g of even order whose involution g^(|g|/2) has a fixed space of dimension in [n/3, 2n/3). Lübeck, Niemeyer and Praeger proved |Q|/|G| ≥ c/log n, and Praeger, with Lübeck and Niemeyer, asked at Oberwolfach in 2011 for the asymptotic value of |Q|/|G|, in particular whether |Q|/|G| = O(1/log n) (printed as O(log n), evidently a misprint). For the groups X of the table of Lübeck, Niemeyer and Praeger and for Sp_2m(q), SO_2m+1(q) and SO±_2m(q) we prove |Q|/|X| ≤ C/log n with absolute constants (C = 100 for GL_n(q) and GU_n(q); 45 for Sp_2m(q), GSp_2m(q), SO_2m+1(q), GO_2m+1(q); 80 for SO±_2m(q), GO±_2m(q)^0), uniformly in q; with their lower bound, |Q|/|H| = Θ(1/log n) for every H between the groups S ≤ X of a line of the table, the upper constant carrying a factor at most q + 1 for the other H, among them SL_n(q) and SU_n(q). For the eight groups listed we also prove (log n)|Q|/|X| = Φ(log₂ log n) + o(1) uniformly in q, where Φ(u) = (log 2/3) Σ_{k∈Z} 2^(u−k) exp(−2^(u−k)/3) is 1-periodic with mean 1, not constant, and within 10⁻⁵ of 1. Thus |Q|/|X| is 1/log n up to a factor that tends to within 10⁻⁵ of 1, while (log n)|Q|/|X| has no limit. The set Q depends only on semisimple parts, and the torus formula of Niemeyer and Praeger reduces the problem to random permutations, signed for the symplectic and orthogonal groups, whose cycles carry independent 2-adic levels; what is added here is a level-by-level upper bound, the torus model for the groups of similitudes, and the asymptotic analysis of the levels. The full orthogonal groups O±_2m(q) are not covered; for SL_n(q), SU_n(q) and the groups strictly between S and X only the order of magnitude is proved, and for Ω only the upper bound; the convergence is slow, and the numerical values are evidence only. This is an unrefereed note. Unrefereed preprint released for independent mathematical scrutiny. Publication on Zenodo does not constitute peer review. AI-assisted tools supported research, computation, proof development, and manuscript preparation. The author remains responsible for all claims and the final text. Corpus identifier: OWR-11129-006 (Praeger, with Lübeck and Niemeyer, problem session, Oberwolfach Report 37/2011, Computational Group Theory, pp. 2154–2155).