In mathematics and especially in algebraic combinatorics, the Stanley symmetric functions are a family of symmetric functions introduced by 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.)
The Stanley symmetric function Fw is homogeneous with degree equal to the number of inversions of w. Unlike other nice families of symmetric functions, the Stanley symmetric functions have many linear dependencies and so do not form a basis of the ring of symmetric functions. When a Stanley symmetric function is expanded in the basis of Schur functions, the coefficients are all non-negative integers.
The Stanley symmetric functions have the property that they are the stable limit of Schubert polynomials
where we treat both sides as formal power series, and take the limit coefficientwise.
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.
In algebra and in particular in algebraic combinatorics, the ring of symmetric functions is a specific limit of the rings of symmetric polynomials in n indeterminates, as n goes to infinity. This ring serves as universal structure in which relations between symmetric polynomials can be expressed in a way independent of the number n of indeterminates (but its elements are neither polynomials nor functions). Among other things, this ring plays an important role in the representation theory of the symmetric group.
We prove an identity relating the permanent of a rank 2 matrix and the determinants of its Hadamard powers. When viewed in the right way, the resulting formula looks strikingly similar to an identity of Carlitz and Levine, suggesting the possibility that t ...
Piezoelectric actuators (PEAs) have been widely used in nano-positioning applications for their high resolution of displacement. However, hysteresis, which is an inherent property of ferroelectric PEAs has been shown to significantly degrade the system per ...
Principal component analysis (PCA) finds the best linear representation of data and is an indispensable tool in many learning and inference tasks. Classically, principal components of a dataset are interpreted as the directions that preserve most of its "e ...