Recognition of Finite Simple Groups S4(q) by Their Element Orders
By V. Mazurov. 2002
94 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/65e2e2a2364aaed563db3e07843fd98a79b9e734
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Discrete Mathematics and Combinatorics
In Electrical and Electronic Engineering
Citations in the corpus
- Characterization of the finite simple groups by spectrum and order (2009, unknown): “(7) If L = D4(2) then G ' B3(2) or G ' D4(2) (see [26, 32]).”
- On the noncommuting graph associated with a finite group (2005, methodology): “The values for S, π1(S) and ni(S) for 2 ≤ i ≤ t(S) are the same as in Tables 1a–c of [7].”
- Noncyclic Graph of a Group (2007, background): “It is easy to see (e.g., from Table III in [5] or Tables 1a-1c in [ 12 ]) that there is a prime divisor p of |G| such that p − 1 divides |G| (I) and CG(g) = h gi for every element g ∈ G of order p. Since G ∼= H, |G| − 1 = |H| − |Cyc(H)|.”