In combinatorial mathematics, a Stirling permutation of order k is a permutation of the multiset 1, 1, 2, 2, ..., k, k (with two copies of each value from 1 to k) with the additional property that, for each value i appearing in the permutation, the values between the two copies of i are larger than i. For instance, the 15 Stirling permutations of order three are

1,1,2,2,3,3;   1,2,2,1,3,3;   2,2,1,1,3,3;
1,1,2,3,3,2;   1,2,2,3,3,1;   2,2,1,3,3,1;
1,1,3,3,2,2;   1,2,3,3,2,1;   2,2,3,3,1,1;
1,3,3,1,2,2;   1,3,3,2,2,1;   2,3,3,2,1,1;
3,3,1,1,2,2;   3,3,1,2,2,1;   3,3,2,2,1,1.

The number of Stirling permutations of order k is given by the double factorial (2k − 1)!!. Stirling permutations were introduced by Gessel & Stanley (1978) in order to show that certain numbers (the numbers of Stirling permutations with a fixed number of descents) are non-negative. They chose the name because of a connection to certain polynomials defined from the Stirling numbers, which are in turn named after 18th-century Scottish mathematician James Stirling.[1]

Construction of a Stirling permutation from an Euler tour of a plane tree with its edges labeled by construction order

Stirling permutations may be used to describe the sequences by which it is possible to construct a rooted plane tree with k edges by adding leaves one by one to the tree. For, if the edges are numbered by the order in which they were inserted, then the sequence of numbers in an Euler tour of the tree (formed by doubling the edges of the tree and traversing the children of each node in left to right order) is a Stirling permutation. Conversely every Stirling permutation describes a tree construction sequence, in which the next edge closer to the root from an edge labeled i is the one whose pair of values most closely surrounds the pair of i values in the permutation.[2]

Stirling permutations have been generalized to the permutations of a multiset with more than two copies of each value.[3] Researchers have also studied the number of Stirling permutations that avoid certain patterns.[4]

See also

References

  1. ↑ Gessel, Ira; Stanley, Richard P. (1978), "Stirling polynomials", Journal of Combinatorial Theory, Series A, 24 (1): 24–33, doi:10.1016/0097-3165(78)90042-0, MR 0462961.
  2. ↑ Janson, Svante (2008), "Plane recursive trees, Stirling permutations and an urn model", Fifth Colloquium on Mathematics and Computer Science, Discrete Math. Theor. Comput. Sci. Proc., AI, Assoc. Discrete Math. Theor. Comput. Sci., Nancy, pp. 541–547, arXiv:0803.1129, Bibcode:2008arXiv0803.1129J, MR 2508813.
  3. ↑ Klingsberg, Paul; Schmalzried, Cynthia (1990), "A family of constructive bijections involving Stirling permutations", Proceedings of the Twenty-First Southeastern Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, Florida, 1990), Congressus Numerantium, vol. 78, pp. 11–15, MR 1140465.
  4. ↑ Kuba, Markus; Panholzer, Alois (2012), "Enumeration formulæ for pattern restricted Stirling permutations", Discrete Mathematics, 312 (21): 3179–3194, doi:10.1016/j.disc.2012.07.011, MR 2957938.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.