Download A Characterization of Alternating Groups by Mazurov V.D. PDF

By Mazurov V.D.

Show description

Read Online or Download A Characterization of Alternating Groups PDF

Similar symmetry and group books

Fermionic Functional Integrals and the Renormalization Group

The Renormalization team is the identify given to a strategy for studying the qualitative behaviour of a category of actual platforms through iterating a map at the vector area of interactions for the category. In a regular non-rigorous program of this method one assumes, in response to one's actual instinct, that just a yes ♀nite dimensional subspace (usually of size 3 or much less) is necessary.

The Primitive Soluble Permutation Groups of Degree less than 256

This monograph addresses the matter of describing all primitive soluble permutation teams of a given measure, with specific connection with these levels below 256. the speculation is gifted intimately and in a brand new manner utilizing sleek terminology. an outline is got for the primitive soluble permutation teams of prime-squared measure and a partial description received for prime-cubed measure.

Theorie der Transformationsgruppen

This paintings has been chosen via students as being culturally vital, and is a part of the information base of civilization as we all know it. This paintings was once reproduced from the unique artifact, and is still as actual to the unique paintings as attainable. for that reason, you'll find the unique copyright references, library stamps (as almost all these works were housed in our most vital libraries round the world), and different notations within the paintings.

Extra info for A Characterization of Alternating Groups

Example text

The valency of the vertex x is the cardinality of its star. A morphism p W X ! Y is called locally injective if the restriction of p to the star of any vertex of X is injective. A graph X is called oriented if in each pair of its mutually inverse edges fe; eg N one edge is chosen. This edge is called positively oriented and the other is called negatively oriented. The set of all positively (negatively) oriented edges is denoted 1 1 (respectively X 1 ). The set XC is called an orientation of the graph X .

The set of all positively (negatively) oriented edges is denoted 1 1 (respectively X 1 ). The set XC is called an orientation of the graph X . by XC Graphs can be drawn as objects consisting of points and lines which connect some of these points. The lines correspond to pairs of inverse edges. Positively oriented edges will be drawn as lines with arrows. n 2 Z, n > 1/ and C1 . ei / D i C 1 (the addition is modulo n). ei / D i C 1 (Figure 3). eiC1 /, i D 1; : : : ; n 1. en / are the beginning and the end of l.

N; m/-code, where m D dim C . The automorphism group of a linear code C Â F n is the group of all linear transformations of the vector space F n permuting the standard8 basis vectors ei , i D 1; : : : ; n; and preserving the subspace C . c1 ; : : : ; cn / 2 C; ci D 0 iD0 lying in F nC1 . 2) Let k > 1, n D 2k 1. n; n k/code C D fu 2 F n j uH D 0g, where H is a matrix of size n k whose rows are all nonzero vectors of the space F k written in some order. From this it follows that the weight of any nonzero word from C is at least 3, and hence C is an 1-code.

Download PDF sample

Rated 4.14 of 5 – based on 40 votes