Search

We describe a combinatorial formula for the coefficients when the dual immaculate quasisymmetric functions are decomposed into Young quasisymmetric Schur functions. We prove this using an analogue of Schensted insertion. Using this result, we give necessary and sufficient conditions for a dual immaculate quasisymmetric function to be symmetric. Moreover, we show that the product of a Schur function and a dual immaculate quasisymmetric function expands positively in the Young quasisymmetric Schur basis. We also discuss the decomposition of the Young noncommutative Schur functions into the immaculate functions. Finally, we provide a Remmel-Whitney-style rule to generate the coefficients of the decomposition of the dual immaculates into the Young quasisymmetric Schurs algorithmically and an analogous rule for the decomposition of the dual bases., Comment: 34 pages, 14 figures

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 combinatorial Hopf algebra of noncommutative symmetric functions, appearances of quasisymmetric functions within the theory of Macdonald polynomials, and analogues of symmetric functions. Topics include the significance of quasisymmetric functions in representation theory (such as representations of the 0-Hecke algebra), recently discovered bases (including analogues of well-studied symmetric function bases), and applications to open problems in symmetric function theory.

Mason and Remmel introduced a basis for quasisymmetric functions known as the row-strict quasisymmetric Schur functions. This basis is generated combinatorially by fillings of composition diagrams that are analogous to the row-strict tableaux that generate Schur functions. We introduce a modification known as Young row-strict quasisymmetric Schur functions, which are generated by row-strict Young composition fillings. After discussing basic combinatorial properties of these functions, we define a skew Young row-strict quasisymmetric Schur function using the Hopf algebra of quasisymmetric functions and then prove this is equivalent to a combinatorial description. We also provide a decomposition of the skew Young row-strict quasisymmetric Schur functions into a sum of Gessel's fundamental quasisymmetric functions and prove a multiplication rule for the product of a Young row-strict quasisymmetric Schur function and a Schur function., Comment: 30 pages, 18 figures, updated from journal article version to incorporate variables in Theorem 12

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 way. We examine the combinatorics of the quasisymmetric hook Schur functions, providing a relationship to Gessel's fundamental quasisymmetric functions and an analogue of the Robinson-Schensted-Knuth algorithm. We also prove that the multiplication of quasisymmetric hook Schur functions with hook Schur functions behaves the same as the multiplication of quasisymmetric Schur functions with Schur functions., 27 pages, 14 figures

A Scramble Squares puzzle is made up of nine square pieces such that each edge of each piece contains half of an image. A solution to the puzzle is obtained when the pieces are arranged in a [math] grid so that the adjacent edges of different pieces together make up a complete image. We describe a graph-theoretical approach to solving Scramble Squares puzzles and a method for decreasing randomness in the backtracking solution algorithm.

We introduce a generalization of the Robinson–Schensted–Knuth insertion algorithm for semi-standard augmented fillings whose basement is an arbitrary permutation σ∈S n . If σ is the identity, then our insertion algorithm reduces to the insertion algorithm introduced by the second author (Semin. Lothar. Comb. 57:B57e, 2006) for semi-standard augmented fillings and if σ is the reverse of the identity, then our insertion algorithm reduces to the original Robinson–Schensted–Knuth row insertion algorithm. We use our generalized insertion algorithm to obtain new decompositions of the Schur functions into nonsymmetric elements called generalized Demazure atoms (which become Demazure atoms when σ is the identity). Other applications include Pieri rules for multiplying a generalized Demazure atom by a complete homogeneous symmetric function or an elementary symmetric function, a generalization of Knuth’s correspondence between matrices of non-negative integers and pairs of tableaux, and a version of evacuation for composition tableaux whose basement is an arbitrary permutation σ.

In the prequel to this paper, we showed how results of Mason involving a new combinatorial formula for polynomials that are now known as Demazure atoms (characters of quotients of Demazure modules, called standard bases by Lascoux and Schutzenberger) could be used to dene a new basis for the ring of quasisymmetric functions we call \Quasisymmetric Schur functions" (QS functions for short). In this paper we develop the combinatorics of these polynomials futher, by showing that the product of a Schur function and a Demazure atom has a positive expansion in terms of Demazure atoms. We use these techniques, together with the fact that both a QS function and a Demazure character have explicit expressions as a positive sum of atoms, to obtain the expansion of a product of a Schur function with a QS function (Demazure character) as a positive sum of QS functions (Demazure characters). Our formula for the coecients in the expansion of a product of a Demazure character and a Schur function into Demazure characters is similar to known results and includes in particular the famous Littlewood-Richardson rule for the expansion of a product of Schur functions in terms of the Schur basis. A composition (weak composition) with n parts is a sequence of n positive (nonnegative) integers, respectively. A partition is a composition whose parts are monotone nonincreasing. If is a weak composition, composition, or partition, we let '( ) denote the number of parts of . Throughout this article is a weak composition with '( ) = n while and denote compositions and partitions, respectively, with '( ) n, '( ) n. The polynomials in this paper (Schur functions, Demazure atoms and characters, QS functions) depend on a

Demazure characters of type A, which are equivalent to key polynomials, have been decomposed by Lascoux and Schutzenberger into standard bases. We prove that the resulting polynomials, which we call Demazure atoms, can be obtained from a certain specialization of nonsymmetric Macdonald polynomials. This combinatorial interpretation for Demazure atoms accelerates the computation of the right key associated to a semi-standard Young tableau. Utilizing a related construction, we provide a new combinatorial description of the key polynomials.

Haglund, Luoto, Mason, and van Willigenburg introduced a basis for quasisymmetric functions called the $\textit{quasisymmetric Schur function basis}$ which are generated combinatorially through fillings of composition diagrams in much the same way as Schur functions are generated through reverse column-strict tableaux. We introduce a new basis for quasisymmetric functions called the $\textit{row-strict quasisymmetric Schur function basis}$ which are generated combinatorially through fillings of composition diagrams in much the same way as Schur functions are generated through row-strict tableaux. We describe the relationship between this new basis and other known bases for quasisymmetric functions, as well as its relationship to Schur polynomials. We obtain a refinement of the omega transform operator as a result of these relationships., Haglund, Luoto, Mason, et van Willigenburg ont introduit une base pour les fonctions quasi-symétriques appelée $\textit{base des fonctions de Schur quasi-symétriques}$, qui sont construites en remplissant des diagrammes de compositions, d'une manière très semblable à la construction des fonctions de Schur à partir des tableaux "column-strict'' (ordre strict sur les colonnes). Nous introduisons une nouvelle base pour les fonctions quasi-symétriques appelée $\textit{base des fonctions de Schur quasi-symétriques "row-strict''}$, qui sont construites en remplissant des diagrammes de compositions, d'une manière très semblable à la construction des fonctions de Schur à partir des tableaux "row-strict'' (ordre strict sur les lignes). Nous décrivons la relation entre cette nouvelle base et d'autres bases connues pour les fonctions quasi-symétriques, ainsi que ses relations avec les polynômes de Schur. Nous obtenons un raffinement de l'opérateur oméga comme conséquence de ces relations.

We prove that the subset of quasisymmetric polynomials conjectured by Bergeron and Reutenauer to be a basis for the coinvariant space of quasisymmetric polynomials is indeed a basis. This provides the first constructive proof of the Garsia―Wallach result stating that quasisymmetric polynomials form a free module over symmetric polynomials and that the dimension of this module is $n!$., Nous prouvons que le sous-ensemble des polynômes quasisymétriques conjecturé par Bergeron et Reutenauer pour former une base pour l'espace coinvariant des polynômes quasisymétriques est en fait une base. Cela fournit la première preuve constructive du résultat de Garsia―Wallach indiquant que les polynômes quasisymétriques forment un module libre sur les polynômes symétriques et que la dimension de ce module est $n!$.

In the prequel to this paper, we showed how results of Mason involving a new combinatorial formula for polynomials that are now known as Demazure atoms (characters of quotients of Demazure modules, called standard bases by Lascoux and Schutzenberger) could be used to define a new basis for the ring of quasisymmetric functions we call Quasisymmetric Schur functions (QS functions for short). In this paper we develop the combinatorics of these polynomials futher, by showing that the product of a Schur function and a Demazure atom has a positive expansion in terms of Demazure atoms. As a by-product, using the fact that both a QS function and a Demazure character have explicit expressions as a positive sum of atoms, we obtain the expansion of a product of a Schur function with a QS function (Demazure character) as a positive sum of QS functions (Demazure characters). Our formula for the coefficients in the expansion of a product of a Demazure character and a Schur function into Demazure characters is similar to known results and includes in particular the famous Littlewood-Richardson rule for the expansion of a product of Schur functions in terms of the Schur basis., 16 pages; addressed referee comments; version as accepted by Transactions of the AMS

We introduce a new basis for quasisymmetric functions, which arise from a specialization of nonsymmetric Macdonald polynomials to standard bases, also known as Demazure atoms. Our new basis is called the basis of quasisymmetric Schur functions, since the basis elements refine Schur functions in a natural way. We derive expansions for quasisymmetric Schur functions in terms of monomial and fundamental quasisymmetric functions, which give rise to quasisymmetric refinements of Kostka numbers and standard (reverse) tableaux. From here we derive a Pieri rule for quasisymmetric Schur functions that naturally refines the Pieri rule for Schur functions. After surveying combinatorial formulas for Macdonald polynomials, including an expansion of Macdonald polynomials into fundamental quasisymmetric functions, we show how some of our results can be extended to include the $t$ parameter from Hall-Littlewood theory., Comment: 30 pages; references added; new subsections on transition matrices, how to include the $t$ parameter from Hall-Littlewood theory and further avenues; new survey of combinatorial formulas for Macdonald polynomials, including an expansion of Macdonald polynomials into fundamental quasisymmetric functions