✦ LIBER ✦

The representation of permutations by trees

✍ Scribed by P. Bhattacharya

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 361 KB
Volume: 28
Category: Article
ISSN: 0898-1221
DOI: 10.1016/0898-1221(94)00178-2

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Representation of permutations, combinat

Representation of permutations, combinations and dihedral elements as trees

✍ B.J. Arnow 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 162 KB

Permutations and combinations of n objects as well as the elements of the dihedral group of order 2n (i.e. flips and rotation of an n-gun) are represented as nodes of trees. The algorithms for generating the nodes and traversing the trees are illustrated using flowcharts and specific walk-throughs f

Representations of hypergroups by genera

Representations of hypergroups by generalized permutations

✍ Thomas Vougiouklis 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 539 KB

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

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

Parallel realization of permutations ove

Parallel realization of permutations over trees

✍ Maurice Tchuente 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 391 KB

Let G = (X, E) be a finite connected (undirected) graph; a permutation (T over X is said to tie compatible with G when every vertex x different from U(X) is adjacent to U(X); 1(G) denotes the minimum k such that every permutation over X can be decomposed into a product of k permutations compatible w

Permutation representations of loops

✍ Jonathan D.H. Smith 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 142 KB