Stanley symmetric function
http://dbpedia.org/resource/Stanley_symmetric_function an entity of type: Abstraction100002137
In mathematics and especially in algebraic combinatorics, the Stanley symmetric functions are a family of symmetric functions introduced by Richard Stanley in his study of the symmetric group of permutations. reduced decompositions. (Here denotes the binomial coefficient n(n − 1)/2 and ! denotes the factorial.)
rdf:langString
rdf:langString
Stanley symmetric function
xsd:integer
31980740
xsd:integer
1112372655
rdf:langString
Richard P. Stanley
rdf:langString
Richard
rdf:langString
Stanley
xsd:integer
1984
rdf:langString
In mathematics and especially in algebraic combinatorics, the Stanley symmetric functions are a family of symmetric functions introduced by Richard Stanley in his study of the symmetric group of permutations. Formally, the Stanley symmetric function Fw(x1, x2, ...) indexed by a permutation w is defined as a sum of certain fundamental quasisymmetric functions. Each summand corresponds to a reduced decomposition of w, that is, to a way of writing w as a product of a minimal possible number of adjacent transpositions. They were introduced in the course of Stanley's enumeration of the reduced decompositions of permutations, and in particular his proof that the permutation w0 = n(n − 1)...21 (written here in one-line notation) has exactly reduced decompositions. (Here denotes the binomial coefficient n(n − 1)/2 and ! denotes the factorial.)
xsd:nonNegativeInteger
2570