ON INVOLUTIONS AND INDICATORS OF FINITE ORTHOGONAL GROUPS

We study the numbers of involutions and their relation to Frobenius–Schur indicators in the groups $\text{SO}^{\pm }(n,q)$ and $\unicode[STIX]{x1D6FA}^{\pm }(n,q)$ . Our point of view for this study comes from two motivations. The first is the conjecture that a finite simple group $G$ is strongly re...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of the Australian Mathematical Society (2001) 2018-12, Vol.105 (3), p.380-416
Hauptverfasser: TAYLOR, GREGORY K., VINROOT, C. RYAN
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We study the numbers of involutions and their relation to Frobenius–Schur indicators in the groups $\text{SO}^{\pm }(n,q)$ and $\unicode[STIX]{x1D6FA}^{\pm }(n,q)$ . Our point of view for this study comes from two motivations. The first is the conjecture that a finite simple group $G$ is strongly real (all elements are conjugate to their inverses by an involution) if and only if it is totally orthogonal (all Frobenius–Schur indicators are 1), and we observe this holds for all finite simple groups $G$ other than the groups $\unicode[STIX]{x1D6FA}^{\pm }(4m,q)$ with $q$ even. We prove computationally that for small $m$ this statement indeed holds for these groups by equating their character degree sums with the number of involutions. We also prove a result on a certain twisted indicator for the groups $\text{SO}^{\pm }(4m+2,q)$ with $q$ odd. Our second motivation is to continue the work of Fulman, Guralnick, and Stanton on generating functions and asymptotics for involutions in classical groups. We extend their work by finding generating functions for the numbers of involutions in $\text{SO}^{\pm }(n,q)$ and $\unicode[STIX]{x1D6FA}^{\pm }(n,q)$ for all $q$ , and we use these to compute the asymptotic behavior for the number of involutions in these groups when $q$ is fixed and $n$ grows.
ISSN:1446-7887
1446-8107
DOI:10.1017/S144678871800006X