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]
^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.
^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.
^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.
defined from the Stirling numbers, which are in turn named after 18th-century Scottish mathematician James Stirling. Stirlingpermutations may be used to...
be expressed as a summation involving double factorials. Stirlingpermutations, permutations of the multiset of numbers 1, 1, 2, 2, ..., k, k in which...
combinatorics, Stirling numbers of the first kind arise in the study of permutations. In particular, the Stirling numbers of the first kind count permutations according...
In mathematics, a permutation of a set can mean one of two different things: an arrangement of its members in a sequence or linear order, or the act or...
In mathematics, Stirling numbers arise in a variety of analytic and combinatorial problems. They are named after James Stirling, who introduced them in...
In mathematics, particularly in combinatorics, a Stirling number of the second kind (or Stirling partition number) is the number of ways to partition...
combinatorial mathematics, an alternating permutation (or zigzag permutation) of the set {1, 2, 3, ..., n} is a permutation (arrangement) of those numbers so...
construct circuits for integer multiplication. Stirlingpermutation, a different type of permutation of the same multiset Knuth (2008); Gardner (1978)...
concerning two finite sets, which include the classical problems of counting permutations, combinations, multisets, and partitions either of a set or of a number...
combinatorial classes (shown without additional markers) are permutations (for unsigned Stirling numbers of the first kind): P = SET ( CYC ( Z ) ) , {\displaystyle...
postulate Sierpinski triangle Star of David theorem Stirling number Stirling transform Stirling's approximation Subfactorial Table of Newtonian series...
The statistics of random permutations, such as the cycle structure of a random permutation are of fundamental importance in the analysis of algorithms...
paths (sets of transpositions) that connect two vertices (permutations). Two permutations connected by an edge differ in only two places (one transposition)...
sum of Stirling numbers of the second kind B n = ∑ k = 0 n { n k } . {\displaystyle B_{n}=\sum _{k=0}^{n}\left\{{n \atop k}\right\}.} The Stirling number...
{n}{k}}={\frac {n!}{k!(n-k)!}}.} The Stirling numbers of the first kind sum to the factorials, and count the permutations of n {\displaystyle n} grouped into...
Professor Colin McLaurin of the McLaurin series, James Stirling famous for Stirlingpermutations who had proved the correctness of Newton's classification...
way to encode each possible permutation of a sequence of n numbers. It is an instance of a scheme for numbering permutations and is an example of an inversion...
Stirling numbers of the first kind (see below). When the variable x is a positive integer, the number (x)n is equal to the number of n-permutations from...
race was then discontinued until 1938, when it took place on a shorter permutation of the circuit known as Circuito del Parco or Anello dei Viali. Tazio...
for all such expressions. The unsigned Stirling number of the first kind, s(k, j) counts the number of permutations of k elements with exactly j disjoint...
of permutations of the numbers 1 to n {\textstyle n} in which exactly k {\textstyle k} elements are greater than the previous element (permutations with...
corresponding fractions. The greatest common divisor (gcd) between any cyclic permutation of an m-digit integer and 10m − 1 is constant. Expressed as a formula...
Global Information