REVIEW 5 cited by
Maximal subgroups of almost simple groups with socle PSL(2,q)
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Maximal subgroups of almost simple groups with socle PSL(2,q)
read the original abstract
We determine all maximal subgroups of the almost simple groups with socle $T=\PSL(2,q)$, that is, of all groups $G$ such that $\PSL(2,q)\leqslant G\leqslant\PGammaL(2,q)$, with $q\geq 4$.
Forward citations
Cited by 5 Pith papers
-
On two questions from the Kourovka Notebook concerning maximal subgroups
Non-simple non-solvable finite groups whose maximal subgroups are all non-abelian simple or p-nilpotent (p odd) are p-nilpotent, resolving Kourovka Problems 19.57 and 19.58, with a complete p=2 classification.
-
Characterizing Finite Groups via Subgroup Perfect Codes
Finite groups satisfy |Δ(G)| ≥ |π(G)| except for three families, with complete classifications of the equality and near-equality cases plus all insoluble groups with |Δ(G)| ≤ 6.
-
Characterizing Finite Groups via Subgroup Perfect Codes
Finite groups satisfy |Δ(G)| ≥ |π(G)| except for three families; the paper classifies all G with |Δ(G)| = |π(G)| or |Δ(G)| = |π(G)| + 1 and all insoluble G with |Δ(G)| ≤ 6.
-
Locally dihedral block designs and primitive groups with dihedral point stabilizers
The paper classifies primitive groups with dihedral point stabilizers and shows that for symmetric designs with dihedral or abelian local action, point and block stabilizers are conjugate in G, with G either imprimiti...
-
A Paper on Calculating the Height and Relational Complexity of the Primitive Actions of $ PSL_{2} (q) $ and $ PGL_{2} (q) $
Height and relational complexity are computed exactly for all primitive actions of PSL(2,q) and PGL(2,q) for q ≥ 11, with the S4-action relational complexity narrowed to 3 or 4 and conjectured for PGL(2,p).
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.