zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Finding Sylow normalizers in polynomial time. (English) Zbl 0731.20005
Let G be a subgroup of $S\sb n$, the symmetric group on n points. In continuation of his previous articles on polynomial-time algorithms for finding Sylow p-subgroups of G the author shows in the present paper that there exists also a polynomial-time algorithm for given prime p which finds the normalizer $N\sb G(P)$ of a Sylow p-subgroup P of G. This is done by polynomial-time reducing the problem to an algorithm called SIMPLENORMALIZER. It deals with simple factors of G, also in polynomial time. In particular, in the case where G is solvable the author generalizes this result to Hall $\pi$-subgroups for a set of primes $\pi$.
Reviewer: I.Janiszczak (Essen)

20B40Computational methods (permutation groups)
20D20Sylow subgroups of finite groups, Sylow properties, $\pi$-groups, $\pi$-structure
20B35Subgroups of symmetric groups
68Q25Analysis of algorithms and problem complexity
Full Text: DOI