On the Representation of Permutations as Products of Transpositions
✍ Scribed by Daniel Neuenschwander
- Book ID
- 113014067
- Publisher
- Birkhäuser-Verlag
- Year
- 2001
- Weight
- 36 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0013-6018
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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.
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