Search arXivSearch

arXiv · 1007.0994

Skew quasisymmetric Schur functions and noncommutative Schur functions

Abstract

Recently a new basis for the Hopf algebra of quasisymmetric functions $QSym$, called quasisymmetric Schur functions, has been introduced by Haglund, Luoto, Mason, van Willigenburg. In this paper we extend the definition of quasisymmetric Schur functions to introduce skew quasisymmetric Schur functions. These functions include both classical skew Schur functions and quasisymmetric Schur functions as examples, and give rise to a new poset $\mathcal{L}_C$ that is analogous to Young's lattice. We also introduce a new basis for the Hopf algebra of noncommutative symmetric functions $NSym$. This basis of $NSym$ is dual to the basis of quasisymmetric Schur functions and its elements are the pre-image of the Schur functions under the forgetful map $χ: NSym \rightarrow Sym$. We prove that the multiplicative structure constants of the noncommutative Schur functions, equivalently the coefficients of the skew quasisymmetric Schur functions when expanded in the quasisymmetric Schur basis, are nonnegative integers, satisfying a Littlewood-Richardson rule analogue that reduces to the classical Littlewood-Richardson rule under $χ$. As an application we show that the morphism of algebras from the algebra of Poirier-Reutenauer to $Sym$ factors through $NSym$. We also extend the definition of Schur functions in noncommuting variables of Rosas-Sagan in the algebra $NCSym$ to define quasisymmetric Schur functions in the algebra $NCQSym$. We prove these latter functions refine the former and their properties, and project onto quasisymmetric Schur functions under the forgetful map. Lastly, we show that by suitably labeling $\mathcal{L}_C$, skew quasisymmetric Schur functions arise in the theory of Pieri operators on posets.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christine Bessenrodt, Kurt Luoto, Stephanie van Willigenburg. 2012-07-22. Skew quasisymmetric Schur functions and noncommutative Schur functions. https://doi.org/10.1016/j.aim.2010.12.015

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO