Results 221 to 230 of about 310,948 (270)

Computational complexity and the classification of finite simple groups

24th Annual Symposium on Foundations of Computer Science (sfcs 1983), 1983
We address the graph isomorphism problem and related fundamental complexity problems of computational group theory. The main results are these: A1. A polynomial time algorithm to test simplicity and find composition factors of a given permutation group (COMP). A2.
László Babai, William M. Kantor, Eugene M. Luks   +2 more
openalex   +2 more sources

Symmetric graphs and the classification of the finite simple groups

, 1984
Some applications of the finite simple group classification to the study of symmetric graphs are discussed.
Cheryl E. Praeger
openalex   +3 more sources

Finite simple groups and their classification

Israel Journal of Mathematics, 1974
Daniel Gorenstein
openalex   +4 more sources

A NEW CLASSIFICATION OF FINITE SIMPLE GROUPS

The Mathematical Foundation of Informatics, 2005
Wujie Shi, Seymour Lipschutz
openalex   +3 more sources

Locally finite simple groups from the standpoint of the classification of finite simple groups

, 1996
V. V. Belyaev
openalex   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Normal subgroups ofSL 1,D and the classification of finite simple groups

Proceedings of the Indian Academy of Sciences - Section A, 1996
Let \(G\) be a simple simply connected algebraic group over an algebraic number field \(K\) and \(T\) the (finite) set of all nonarchimedean places \(v\) of \(K\) such that \(G\) is \(K_v\)-anisotropic. Define \(G(K,T)\) to be \(\prod_{v\in T}G(K_v)\) with the product topology if \(T\neq\emptyset\), and \(G(K,T)=\{e\}\) if \(T=\emptyset\). Let \(\delta\
Andrei S. Rapinchuk, Alexander Potapchik, Alexander Potapchik, Alexander Potapchik   +3 more
openaire   +2 more sources

The Classification of Finite Simple Groups

1983
My aim in this lecture will be to try to convince you that the classification of the finite simple groups is nearing its end. This is, of course, a presumptuous statement, since one does not normally announce theorems as "almost proved". But the classification of simple groups is unlike any other single theorem in the history of mathematics, since the ...
openaire   +2 more sources

Some Ideas in the Classification of the Finite Simple Groups

2004
Everything we report about is joint work with U. Meierfrankenfeld and B. Stellmacher. The key idea for the existing classification of the finite simple groups is due R. Brauer [Br],[BrFo]. He suggested to classify the finite simple groups by the centralizers of their involutions.
openaire   +2 more sources

Classification of maximal subgroups of odd index in finite simple classical groups [PDF]

Proceedings of the Steklov Institute of Mathematics, 2009
The classification of maximal subgroups of odd index in finite simple classical groups is obtained.
openaire   +1 more source

The Classification of the Finite Simple Groups, Number 9

2021
Inna Capdeboscq, Richard Lyons, Ronald Solomon, Daniel Gorenstein   +3 more
openaire   +1 more source