Editing Permutation (section)

==Further reading==
* {{citation|first=Norman L.|last=Biggs|title=Discrete Mathematics|edition=2nd|year=2002|publisher=Oxford University Press|isbn=978-0-19-850717-8}}
* {{citation | last1=Foata | first1=Dominique | last2=Schutzenberger | first2=Marcel-Paul | title=Théorie Géométrique des Polynômes Eulériens | publisher=Springer-Verlag | location=Berlin, Heidelberg | series=Lecture Notes in Mathematics | volume=138 | year=1970 | isbn=978-3-540-04927-2 | url=http://irma.math.unistra.fr/~foata/paper/pub14.html}}. The link is to a freely available retyped (LaTeX'ed) and revised version of the text originally published by Springer-Verlag.
* {{citation|first=Donald|last=Knuth|series=The Art of Computer Programming|volume=3|title=Sorting and Searching|edition=Second|publisher=Addison–Wesley|year=1998|isbn=978-0-201-89685-5|ref=none}}. Section 5.1: Combinatorial Properties of Permutations, pp.&nbsp;11–72.
* {{cite journal|first1=Robert|last1=Sedgewick|doi=10.1145/356689.356692|journal=ACM Computing Surveys|year=1977|volume=9|issue=2|pages=137–164|title=Permutation generation methods|s2cid=12139332|doi-access=free}}
* {{cite journal|first1=Kobayashi|last1=Masato|journal=Order|year=2011|volume=1|pages=131–137|title=Enumeration of bigrassmannian permutations below a permutation in Bruhat order}}