dbo:abstract
|
- 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.) (en)
|
dbo:wikiPageExternalLink
| |
dbo:wikiPageID
| |
dbo:wikiPageLength
|
- 2570 (xsd:nonNegativeInteger)
|
dbo:wikiPageRevisionID
| |
dbo:wikiPageWikiLink
| |
dbp:authorlink
| |
dbp:first
| |
dbp:last
| |
dbp:wikiPageUsesTemplate
| |
dbp:year
| |
dcterms:subject
| |
rdf:type
| |
rdfs:comment
|
- 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.) (en)
|
rdfs:label
|
- Stanley symmetric function (en)
|
owl:sameAs
| |
prov:wasDerivedFrom
| |
foaf:isPrimaryTopicOf
| |
is dbo:wikiPageRedirects
of | |
is dbo:wikiPageWikiLink
of | |
is foaf:primaryTopic
of | |