Anisotropic groups of type An and the commuting graph of finite simple groups
By Yoav Segev, Gary M. Seitz. 2002
72 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Discrete Mathematics and Combinatorics, Mathematical Physics
View Paper: https://www.semanticscholar.org/paper/08414ed227b6da8c4212b803a062f238925e75a2
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 Mathematical Physics
- Chris Parker
- G. L. Morgan
- A. Rapinchuk
- Yoav Segev
- Gary M. Seitz
- Timothy C. Burness
- Gopal Prasad
- L. Funar
Citations in the corpus
- The diameter of the commuting graph of a finite group with trivial centre (2013, methodology): “For the remaining groups we adapt and extend the arguments of Segev and Seitz [21] to the case where the commuting graph of G with F ∗(G) a simple group of Lie type in characteristic r is possibly disconnected.”
- Certain properties of the power graph associated with a finite group (2013, unknown): “In [34] and [35], Segev and Seitz apply the commuting graph ∆(G) := C(G,G \ {1}) of G, with G a nonabelian simple group, in order to prove the Margulis-Platonov conjecture on arithmetic groups.”
- Finite quotients of the multiplicative group of a finite dimensional division algebra are solvable (2002, methodology): “This conjecture was formulated in view of the results in [23], [26] and also the results with L.”
- On the noncommuting graph associated with a finite group (2005, background): “Many authors have studied C(G,X) for dierent choices of G and X. In [3] and [ 4 ], Segev and Seitz apply the commuting graph ( G) := C(G,X), with G a nonabelian simple group and X = G \ {1}, in order to prove the Margulis‐Platonov conjecture on arithmetic groups.”