Abstract
This chapter is concerned with how to make a list of all permutations of a given finite sequence s by means of transposition instructions. This means to list without repetitions every element of the set C1 of all sequences which can be made by permuting the terms of s, and to do so by means of a program, whose instructions have to be taken from the set C2 of transpositions. Each element of C2 depends on a particular element of C1, which it converts into a new one by transposing two adjacent terms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1979 D. Reidel Publishing Company, Dordrecht, Holland
About this chapter
Cite this chapter
Sellers, P.H. (1979). Transpositions. In: Combinatorial Complexes. Mathematics and Its Applications, vol 2. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-9463-8_5
Download citation
DOI: https://doi.org/10.1007/978-94-009-9463-8_5
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-009-9465-2
Online ISBN: 978-94-009-9463-8
eBook Packages: Springer Book Archive