Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao zbMATH Openarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article
Data sources: zbMATH Open
Proceedings of the American Mathematical Society
Article . 1992 . Peer-reviewed
Data sources: Crossref
versions View all 2 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

A Characterization of Suzuki's Simple Groups

A characterization of Suzuki's simple groups
Authors: Shi, Wujie;

A Characterization of Suzuki's Simple Groups

Abstract

Let \(G\) be a finite group. By definition, \(\pi_ e(G)\) is the set of all orders of the elements in \(G\). In the paper under review the Suzuki groups \(Sz(2^{2n+1})\) are characterized by their sets of orders. Theorem 2. \(G\) is isomorphic to \(Sz(2^{2n+1})\) for some \(n\geq 1\) if and only if \(\pi_ e(G)\) consists of 2, 4, all factors of \((2^{2n+1}-1)\), \((2^{2n+1}-2^{n+1}+1)\), and \((2^{2n+1}+2^{n+1}+1)\). Clearly, in such a group the centralizer of each involution is a 2-group, therefore the author applies the Suzuki classification of CIT-groups.

Keywords

Suzuki groups, orders of elements, Finite simple groups and their classification, Simple groups: alternating groups and groups of Lie type, CIT-groups, Arithmetic and combinatorial problems involving abstract finite groups, centralizer of involution

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    1
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
1
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!