Results 231 to 240 of about 15,173 (265)

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
openaire   +1 more source

Note on a consequence for affine groups of the classification theorem for finite simple groups

Geometriae Dedicata, 1983
exaly   +3 more sources

The Classification of the Finite Simple Groups

The Mathematical Intelligencer, 1980
This article on the classification of finite simple groups is directed towards a broad audience. The author poses some natural questions connected with finite groups and in particular with finite simple groups. He explains in a lucid way why these questions have particular answers.
openaire   +3 more sources

V.7 The Classification of Finite Simple Groups

2010
exaly   +2 more sources

Steiner triple systems with doubly transitive automorphism groups: A corollary to the classification theorem for finite simple groups [PDF]

Journal of Combinatorial Theory - Series A, 1984
Assuming that the classification theorem for finite simple groups is complete, a conjecture of M. Hall (Proc. Sympos. Pure Math. 6 (1962), 47–66; and in “Proceedings of the International Conference on Theory of Groups”, pp.
J D Key
exaly   +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   +1 more source

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   +1 more source

Classification of maximal subgroups of odd index in finite simple classical groups

Proceedings of the Steklov Institute of Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A NEW CLASSIFICATION OF FINITE SIMPLE GROUPS

The Mathematical Foundation of Informatics, 2005
WUJIE SHI, SEYMOUR LIPSCHUTZ
openaire   +1 more source

The Classification of the Finite Simple Groups

1994
Daniel Gorenstein, Richard Lyons, Ronald Solomon   +2 more
openaire   +1 more source