Abstract Harmonic Analysis: Structure and Analysis, Vol.2 by Edwin Hewitt, Kenneth A. Ross

By Edwin Hewitt, Kenneth A. Ross

This ebook is a continuation of vol. I (Grundlehren vol. a hundred and fifteen, additionally to be had in softcover), and incorporates a distinctive therapy of a few very important components of harmonic research on compact and in the community compact abelian teams. From the stories: "This paintings goals at giving a monographic presentation of summary harmonic research, way more entire and finished than any booklet already current at the subject...in reference to each challenge handled the publication bargains a many-sided outlook and leads as much as latest advancements. Carefull cognizance can be given to the historical past of the topic, and there's an in depth bibliography...the reviewer believes that for a few years to come back this can stay the classical presentation of summary harmonic analysis." Publicationes Mathematicae

Show description

Read Online or Download Abstract Harmonic Analysis: Structure and Analysis, Vol.2 PDF

Similar symmetry and group books

Extra info for Abstract Harmonic Analysis: Structure and Analysis, Vol.2

Example text

An ) acts on the set {(i, x) : x ∈ Z4 } as four fixed points if ai = 0; as two 2-cycles if ai = 2; or as one 4-cycle if ai = 1 or ai = 3. More generally, let C be any subgroup of the direct product A1 × A2 × · · · × An , where A1 , . . , An are groups of order q. Then C acts on the set ni=1 Ai (disjoint union) in the obvious way. The cycle index of the corresponding permutation group is a kind of generalised symmetrised weight enumerator of C, a multivariate polynomial which counts the number of codewords whose projection onto Ai has order mi , where m1 , .

A similar reduction theorem, due to Aschbacher, for irreducible linear groups shows that we can further reduce to the case where the centre Z(H) of H consists of scalar transformations and H/Z(H) is almost simple. Typically we now require properties about the irreducible projective representations of almost simple groups. (b) If G is diagonal, then its properties can usually be derived from routine properties of simple groups. (c) In the case where G is almost simple, we need to know about primitive permutation actions (equivalently, maximal subgroups) of almost simple groups.

The orbits are precisely the connected components of this graph. Moreover, for each point in the orbit of α, we can find a witness, an element of G (in the form of a word in the generators S) mapping α to β. These witnesses form a set X of coset representatives for Gα in G. Next, a lemma of Schreier shows that, if generators of a group and coset representatives for a subgroup are known, then generators for the subgroup can be computed. Now we apply this procedure recursively until the group is trivial.

Download PDF sample

Rated 4.98 of 5 – based on 10 votes