๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On a permutation representation of the Janko group

โœ Scribed by Donald Livingstone

Publisher
Elsevier Science
Year
1967
Tongue
English
Weight
626 KB
Volume
6
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Representation of Permutation Groups by
Representation of Permutation Groups by Coloured Graphs
โœ Ulrike Baumann ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 432 KB

## 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

On the Movement of a Permutation Group
On the Movement of a Permutation Group
โœ Peter M. Neumann; Cheryl E. Praeger ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 56 KB
Quasi-permutation Representations of the
Quasi-permutation Representations of the Group GL2(q)
โœ M.R Darafsheh; M Ghorbany; A Daneshkhah; H Behravesh ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 195 KB

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

A Representation of Even Permutations
A Representation of Even Permutations
โœ L. Cangelmi; P. Cellini ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 80 KB

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 permutatio