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

Representations of hypergroups by generalized permutations

โœ Scribed by Thomas Vougiouklis

Publisher
Springer
Year
1992
Tongue
English
Weight
539 KB
Volume
29
Category
Article
ISSN
0002-5240

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The representation of permutations by tr
The representation of permutations by trees
โœ P. Bhattacharya ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 361 KB

Representation of permutations and combinations of N elements in lexicographical order by elements of a tree are considered. An algorithm for generating the nodes is presented and some examples are given. The algorithm could be implemented in any programming language that allows for recursive calls.

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

Permutation representations of loops
Permutation representations of loops
โœ Jonathan D.H. Smith ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 142 KB
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