## Abstract The topic of this paper is representing permutation groups by connected graphs with proper edge colourings. Every connected graph __G__ with a proper edge colouring ฯ determines a group __A~c~__(__G__, ฯ) of graph automorphisms which preserve the colours of the edges. We characterize pe
A Representation of Even Permutations
โ Scribed by L. Cangelmi; P. Cellini
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 80 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
โฆ Synopsis
We give a combinatorial proof of the formula giving the number of representations of an even permutation ฯ in S n as a product of an n-cycle by an (n -2)-cycle, such a number being (nฯ(ฯ ))(n -3)!, where ฯ(ฯ ) is the number of fixed points of ฯ . This proof relies on the fact that any odd permutation in S n is the product of an n-cycle by an (n -1)-cycle in exactly 2(n -2)! different ways.
๐ SIMILAR VOLUMES
A subgroup H of a group G is core-free if H contains no non-trivial normal subgroup of G, or equivalently the transitive permutation representation of G on the cosets of H is faithful. We study the obstacles to a group having large core-free subgroups. We call a subgroup D a ''dedekind'' subgroup of
We characterize the point stabilizers and kernels of finitary permutation representations of infinite transitive groups of finitary permutations. Moreover, the number of such representations is determined.
A square matrix over the complex field with non-negative integral trace is called a quasi-permutation matrix. For a finite group G the minimal degree of a faithful ลฝ . permutation representation of G is denoted by p G . The minimal degree of a faithful representation of G by quasi-permutation matric
We consider permutations of a multiset which do not contain certain ordered patterns of length 3. For each possible set of patterns we provide a structural description of the permutations avoiding those patterns, and in many cases a complete enumeration of such permutations according to the underlyi