QSym over Sym has a stable basis

@article{Lauve2011QSymOS,
  title={QSym over Sym has a stable basis},
  author={Aaron Lauve and Sarah K. Mason},
  journal={J. Comb. Theory, Ser. A},
  year={2011},
  volume={118},
  pages={1661-1673}
}

Figures from this paper

Quasisymmetric (k, l)-Hook Schur Functions
We introduce a quasisymmetric generalization of Berele and Regev’s hook Schur functions and prove that these new quasisymmetric hook Schur functions decompose the hook Schur functions in a natural
An Introduction to Quasisymmetric Schur Functions: Hopf Algebras, Quasisymmetric Functions, and Young Composition Tableaux
An Introduction to Quasisymmetric Schur Functions is aimed at researchers and graduate students in algebraic combinatorics. The goal of this monograph is twofold. The first goal is to provide a
Row-strict Quasisymmetric Schur Functions, Characterizations of Demazure Atoms, and Permuted Basement Nonsymmetric Macdonald Polynomials
We give a Littlewood-Richardson type rule for expanding the product of a row-strict quasisymmetric Schur function and a symmetric Schur function in terms of row-strict quasisymmetric Schur functions.
Cyclic quasi-symmetric functions
The ring of cyclic quasi-symmetric functions and its non-Escher subring are introduced in this paper. A natural basis consists of fundamental cyclic quasi-symmetric functions; for the non-Escher
Multiplicity Free Schur, Skew Schur, and Quasisymmetric Schur Functions
In this paper we classify all Schur functions and skew Schur functions that are multiplicity free when expanded in the basis of fundamental quasisymmetric functions, termed F-multiplicity free.
Recent Trends in Quasisymmetric Functions
  • Sarah K. Mason
  • Mathematics
    Association for Women in Mathematics Series
  • 2019
This article serves as an introduction to several recent developments in the study of quasisymmetric functions. The focus of this survey is on connections between quasisymmetric functions and the
A Littlewood-Richardson type rule for row-strict quasisymmetric Schur functions
We establish several properties of an algorithm defined by Mason and Remmel (2010) which inserts a positive integer into a row-strict composition tableau. These properties lead to a
...
...

References

SHOWING 1-10 OF 30 REFERENCES
Qsym over Sym is free
Combinatorial methods in the theory of Cohen-Macaulay rings
Duality between Quasi-Symmetrical Functions and the Solomon Descent Algebra
Abstract The ring QSym of quasi-symmetric functions is naturally the dual of the Solomon descent algebra. The product and the two coproducts of the first (extending those of the symmetric functions)
Symmetric Functions, Noncommutative Symmetric Functions and Quasisymmetric Functions II
Abstract Like its precursor this paper is concerned with the Hopf algebra of noncommutative symmetric functions and its graded dual, the Hopf algebra of quasisymmetric functions. It complements and
Quasisymmetric Schur functions
Symmetric functions
Our aim is to alternate elements of the general theory with significant examples. We deal now with synmietric functions. In this chapter we will develop some of the very basic theorems on symmetric
Symmetric functions and Hall polynomials
I. Symmetric functions II. Hall polynomials III. HallLittlewood symmetric functions IV. The characters of GLn over a finite field V. The Hecke ring of GLn over a finite field VI. Symmetric functions
Combinatorial $B_n$-analogues of Schubert polynomials
Combinatorial $B_n$-analogues of Schubert polynomials and corresponding symmetric functions are constructed from an exponential solution of the $B_n$-Yang-Baxter equation that involves the nilCoxeter
...
...