Rahul Sharma (Editor)

Quasisymmetric function

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit
Quasisymmetric function

In algebra and in particular in algebraic combinatorics, a quasisymmetric function is any element in the ring of quasisymmetric functions which is in turn a subring of the formal power series ring with a countable number of variables. This ring generalizes the ring of symmetric functions. This ring can be realized as a specific limit of the rings of quasisymmetric polynomials in n variables, as n goes to infinity. This ring serves as universal structure in which relations between quasisymmetric polynomials can be expressed in a way independent of the number n of variables (but its elements are neither polynomials nor functions).

Contents

Definitions

The ring of quasisymmetric functions, denoted QSym, can be defined over any commutative ring R such as the integers. Quasisymmetric functions are power series of bounded degree in variables x 1 , x 2 , x 3 , … with coefficients in R, which are shift invariant in the sense that the coefficient of the monomial x 1 α 1 x 2 α 2 ⋯ x k α k is equal to the coefficient of the monomial x i 1 α 1 x i 2 α 2 ⋯ x i k α k for any strictly increasing sequence of positive integers i 1 < i 2 < ⋯ < i k indexing the variables and any positive integer sequence ( α 1 , α 2 , … , α k ) of exponents. Much of the study of quasisymmetric functions is based on that of symmetric functions.

A quasisymmetric function in finitely many variables is a quasisymmetric polynomial. Both symmetric and quasisymmetric polynomials may be characterized in terms of actions of the symmetric group S n on a polynomial ring in n variables x 1 , … , x n . One such action of S n permutes variables, changing a polynomial p ( x 1 , … , x n ) by iteratively swapping pairs ( x i , x i + 1 ) of variables having consecutive indices. Those polynomials unchanged by all such swaps form the subring of symmetric polynomials. A second action of S n conditionally permutes variables, changing a polynomial p ( x 1 , … , x n ) by swapping pairs ( x i , x i + 1 ) of variables except in monomials containing both variables. Those polynomials unchanged by all such conditional swaps form the subring of quasisymmetric polynomials. One quasisymmetric function in four variables is the polynomial

x 1 2 x 2 x 3 + x 1 2 x 2 x 4 + x 1 2 x 3 x 4 + x 2 2 x 3 x 4 .

The simplest symmetric function containing all of these monomials is

x 1 2 x 2 x 3 + x 1 2 x 2 x 4 + x 1 2 x 3 x 4 + x 2 2 x 3 x 4 + x 1 x 2 2 x 3 + x 1 x 2 2 x 4 + x 1 x 3 2 x 4 + x 2 x 3 2 x 4 + x 1 x 2 x 3 2 + x 1 x 2 x 4 2 + x 1 x 3 x 4 2 + x 2 x 3 x 4 2 .

Important bases

QSym is a graded R-algebra, decomposing as

QSym = ⨁ n ≥ 0 QSym n ,

where QSym n is the R -span of all quasisymmetric functions that are homogeneous of degree n . Two natural bases for QSym n are the monomial basis { M α } and the fundamental basis { F α } indexed by compositions α = ( α 1 , α 2 , … , α k ) of n , denoted α ⊨ n . The monomial basis consists of M 0 = 1 and all formal power series

M α = ∑ i 1 < i 2 < ⋯ < i k x i 1 α 1 x i 2 α 2 ⋯ x i k α k .

The fundamental basis consists F 0 = 1 and all formal power series

F α = ∑ α ⪰ β M β ,

where α ⪰ β means we can obtain α by adding together adjacent parts of β , for example, (3,2,4,2)  ⪰  (3,1,1,1,2,1,2). Thus, when the ring R is the ring of rational numbers, one has

QSym n = span Q ⁡ { M α ∣ α ⊨ n } = span Q ⁡ { F α ∣ α ⊨ n } .

Then one can define the algebra of symmetric functions Λ = Λ 0 ⊕ Λ 1 ⊕ ⋯ as the subalgebra of QSym spanned by the monomial symmetric functions m 0 = 1 and all formal power series m λ = ∑ M α , where the sum is over all compositions α which rearrange to the partition λ . Moreover, we have Λ n = Λ ∩ QSym n . For example, F ( 1 , 2 ) = M ( 1 , 2 ) + M ( 1 , 1 , 1 ) and m ( 2 , 1 ) = M ( 2 , 1 ) + M ( 1 , 2 ) .

Other important bases for quasisymmetric functions include the basis of quasisymmetric Schur functions, and bases related to enumeration in matroids.

Applications

Quasisymmetric functions have been applied in enumerative combinatorics, symmetric function theory, representation theory, and number theory. Applications of quasisymmetric functions include enumeration of P-partitions, permutations, tableaux, chains of posets, reduced decompositions in finite Coxeter groups (via Stanley symmetric functions), and parking functions. In symmetric function theory and representation theory, applications include the study of Schubert polynomials, Macdonald polynomials, Hecke algebras, and Kazhdan–Lusztig polynomials. Often quasisymmetric functions provide a powerful bridge between combinatorial structures and symmetric functions.

As a graded Hopf algebra, the dual of the ring of quasisymmetric functions is the ring of noncommutative symmetric functions. Every symmetric function is also a quasisymmetric function, and hence the ring of symmetric functions is a subalgebra of the ring of quasisymmetric functions.

The ring of quasisymmetric functions is the terminal object in category of graded Hopf algebras with a single character. Hence any such Hopf algebra has a morphism to the ring of quasisymmetric functions.

One example of this is the peak algebra.

The Malvenuto–Reutenauer algebra is a Hopf algebra based on permutations that relates the rings of symmetric functions, quasisymmetric functions, and noncommutative symmetric functions, (denoted Sym, QSym, and NSym respectively), as depicted the following commutative diagram. The duality between QSym and NSym mentioned above is reflected in the main diagonal of this diagram.

Many related Hopf algebras were constructed from Hopf monoids in the category of species by Aguiar and Majahan .

One can also construct the ring of quasisymmetric functions in noncommuting variables.

References

Quasisymmetric function Wikipedia
(Text) CC BY-SA