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).
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 with coefficients in R, which are shift invariant in the sense that the coefficient of the monomial is equal to the coefficient of the monomial for any strictly increasing sequence of positive integers indexing the variables and any positive integer sequence of exponents. [1] 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 on a polynomial ring in variables . One such action of permutes variables, changing a polynomial by iteratively swapping pairs of variables having consecutive indices. Those polynomials unchanged by all such swaps form the subring of symmetric polynomials. A second action of conditionally permutes variables, changing a polynomial by swapping pairs of variables except in monomials containing both variables. [2] [3] Those polynomials unchanged by all such conditional swaps form the subring of quasisymmetric polynomials. One quasisymmetric function in four variables is the polynomial
The simplest symmetric function containing these monomials is
QSym is a graded R-algebra, decomposing as
where is the -span of all quasisymmetric functions that are homogeneous of degree . Two natural bases for are the monomial basis and the fundamental basis indexed by compositions of , denoted . The monomial basis consists of and all formal power series
The fundamental basis consists and all formal power series
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 is the ring of rational numbers, one has
Then one can define the algebra of symmetric functions as the subalgebra of QSym spanned by the monomial symmetric functions and all formal power series where the sum is over all compositions which rearrange to the integer partition . Moreover, we have . For example, and
Other important bases for quasisymmetric functions include the basis of quasisymmetric Schur functions, [4] the "type I" and "type II" quasisymmetric power sums, [5] and bases related to enumeration in matroids. [6] [7]
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, [8] [9] permutations, [10] [11] [12] [13] tableaux, [14] chains of posets, [14] [15] reduced decompositions in finite Coxeter groups (via Stanley symmetric functions), [14] and parking functions. [16] In symmetric function theory and representation theory, applications include the study of Schubert polynomials, [17] [18] Macdonald polynomials, [19] Hecke algebras, [20] and Kazhdan–Lusztig polynomials. [21] 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. [22] Hence any such Hopf algebra has a morphism to the ring of quasisymmetric functions.
One example of this is the peak algebra. [23]
The Malvenuto–Reutenauer algebra [24] 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. [25]
One can also construct the ring of quasisymmetric functions in noncommuting variables. [3] [26]
In commutative algebra, the prime spectrum of a commutative ring R is the set of all prime ideals of R, and is usually denoted by ; in algebraic geometry it is simultaneously a topological space equipped with the sheaf of rings .
In mathematics, a formal series is an infinite sum that is considered independently from any notion of convergence, and can be manipulated with the usual algebraic operations on series.
In mathematics, Hilbert's Nullstellensatz is a theorem that establishes a fundamental relationship between geometry and algebra. This relationship is the basis of algebraic geometry. It relates algebraic sets to ideals in polynomial rings over algebraically closed fields. This relationship was discovered by David Hilbert, who proved the Nullstellensatz in his second major paper on invariant theory in 1893.
In mathematics, a differential operator is an operator defined as a function of the differentiation operator. It is helpful, as a matter of notation first, to consider differentiation as an abstract operation that accepts a function and returns another function.
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. Among other things, this ring plays an important role in the representation theory of the symmetric group.
In mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring formed from the set of polynomials in one or more indeterminates with coefficients in another ring, often a field.
In combinatorial mathematics, the necklace polynomial, or Moreau's necklace-counting function, introduced by C. Moreau, counts the number of distinct necklaces of n colored beads chosen out of α available colors, arranged in a cycle. Unlike the usual problem of graph coloring, the necklaces are assumed to be aperiodic, and counted up to rotation, but without flipping over. This counting function also describes the dimensions in a free Lie algebra and the number of irreducible polynomials over a finite field.
In mathematics, the Tor functors are the derived functors of the tensor product of modules over a ring. Along with the Ext functor, Tor is one of the central concepts of homological algebra, in which ideas from algebraic topology are used to construct invariants of algebraic structures. The homology of groups, Lie algebras, and associative algebras can all be defined in terms of Tor. The name comes from a relation between the first Tor group Tor1 and the torsion subgroup of an abelian group.
In mathematics, a symmetric polynomial is a polynomial P(X1, X2, ..., Xn) in n variables, such that if any of the variables are interchanged, one obtains the same polynomial. Formally, P is a symmetric polynomial if for any permutation σ of the subscripts 1, 2, ..., n one has P(Xσ(1), Xσ(2), ..., Xσ(n)) = P(X1, X2, ..., Xn).
In mathematics, the resultant of two polynomials is a polynomial expression of their coefficients that is equal to zero if and only if the polynomials have a common root, or, equivalently, a common factor. In some older texts, the resultant is also called the eliminant.
In mathematics, Schur polynomials, named after Issai Schur, are certain symmetric polynomials in n variables, indexed by partitions, that generalize the elementary symmetric polynomials and the complete homogeneous symmetric polynomials. In representation theory they are the characters of polynomial irreducible representations of the general linear groups. The Schur polynomials form a linear basis for the space of all symmetric polynomials. Any product of Schur polynomials can be written as a linear combination of Schur polynomials with non-negative integral coefficients; the values of these coefficients is given combinatorially by the Littlewood–Richardson rule. More generally, skew Schur polynomials are associated with pairs of partitions and have similar properties to Schur polynomials.
In mathematics, Macdonald polynomialsPλ(x; t,q) are a family of orthogonal symmetric polynomials in several variables, introduced by Macdonald in 1987. He later introduced a non-symmetric generalization in 1995. Macdonald originally associated his polynomials with weights λ of finite root systems and used just one variable t, but later realized that it is more natural to associate them with affine root systems rather than finite root systems, in which case the variable t can be replaced by several different variables t=(t1,...,tk), one for each of the k orbits of roots in the affine root system. The Macdonald polynomials are polynomials in n variables x=(x1,...,xn), where n is the rank of the affine root system. They generalize many other families of orthogonal polynomials, such as Jack polynomials and Hall–Littlewood polynomials and Askey–Wilson polynomials, which in turn include most of the named 1-variable orthogonal polynomials as special cases. Koornwinder polynomials are Macdonald polynomials of certain non-reduced root systems. They have deep relationships with affine Hecke algebras and Hilbert schemes, which were used to prove several conjectures made by Macdonald about them.
In linear algebra, the computation of the permanent of a matrix is a problem that is thought to be more difficult than the computation of the determinant of a matrix despite the apparent similarity of the definitions.
In mathematics, the Kostka number is a non-negative integer that is equal to the number of semistandard Young tableaux of shape and weight . They were introduced by the mathematician Carl Kostka in his study of symmetric functions.
In mathematics, a Stanley–Reisner ring, or face ring, is a quotient of a polynomial algebra over a field by a square-free monomial ideal. Such ideals are described more geometrically in terms of finite simplicial complexes. The Stanley–Reisner ring construction is a basic tool within algebraic combinatorics and combinatorial commutative algebra. Its properties were investigated by Richard Stanley, Melvin Hochster, and Gerald Reisner in the early 1970s.
In mathematics, the Newton polytope is an integral polytope associated with a multivariate polynomial. It can be used to analyze the polynomial's behavior when specific variables are considered negligible relative to the others. Specifically, given a vector of variables and a finite family of pairwise distinct vectors from each encoding the exponents within a monomial, consider the multivariate polynomial
In mathematics, Schubert polynomials are generalizations of Schur polynomials that represent cohomology classes of Schubert cycles in flag varieties. They were introduced by Lascoux & Schützenberger (1982) and are named after Hermann Schubert.
In abstract algebra, a monomial ideal is an ideal generated by monomials in a multivariate polynomial ring over a field.
Plethystic substitution is a shorthand notation for a common kind of substitution in the algebra of symmetric functions and that of symmetric polynomials. It is essentially basic substitution of variables, but allows for a change in the number of variables used.
In mathematics, the plethystic exponential is a certain operator defined on (formal) power series which, like the usual exponential function, translates addition into multiplication. This exponential operator appears naturally in the theory of symmetric functions, as a concise relation between the generating series for elementary, complete and power sums homogeneous symmetric polynomials in many variables. Its name comes from the operation called plethysm, defined in the context of so-called lambda rings.