scholarly journals Revisiting Pattern Avoidance and Quasisymmetric Functions

2020 ◽  
Vol 24 (2) ◽  
pp. 337-361 ◽  
Author(s):  
Jonathan S. Bloom ◽  
Bruce E. Sagan
2020 ◽  
Vol 3 (2) ◽  
pp. 365-388 ◽  
Author(s):  
Zachary Hamaker ◽  
Brendan Pawlowski ◽  
Bruce E. Sagan

2021 ◽  
Vol 866 ◽  
pp. 56-69
Author(s):  
James D. Currie ◽  
Lucas Mol
Keyword(s):  

2017 ◽  
Vol 69 (1) ◽  
pp. 21-53 ◽  
Author(s):  
Darij Grinberg

AbstractThe dual immaculate functions are a basis of the ring QSym of quasisymmetric functions and form one of the most natural analogues of the Schur functions. The dual immaculate function corresponding to a composition is a weighted generating function for immaculate tableaux in the same way as a Schur function is for semistandard Young tableaux; an immaculate tableau is defined similarly to a semistandard Young tableau, but the shape is a composition rather than a partition, and only the first column is required to strictly increase (whereas the other columns can be arbitrary, but each row has to weakly increase). Dual immaculate functions were introduced by Berg, Bergeron, Saliola, Serrano, and Zabrocki in arXiv:1208.5191, and have since been found to possess numerous nontrivial properties.In this note, we prove a conjecture of M. Zabrocki that provides an alternative construction for the dual immaculate functions in terms of certain “vertex operators”. The proof uses a dendriform structure on the ring QSym; we discuss the relation of this structure to known dendriformstructures on the combinatorial Hopf algebras FQSym andWQSym.


10.37236/1958 ◽  
2005 ◽  
Vol 12 (1) ◽  
Author(s):  
T. Kyle Petersen

In the context of generating functions for $P$-partitions, we revisit three flavors of quasisymmetric functions: Gessel's quasisymmetric functions, Chow's type B quasisymmetric functions, and Poirier's signed quasisymmetric functions. In each case we use the inner coproduct to give a combinatorial description (counting pairs of permutations) to the multiplication in: Solomon's type A descent algebra, Solomon's type B descent algebra, and the Mantaci-Reutenauer algebra, respectively. The presentation is brief and elementary, our main results coming as consequences of $P$-partition theorems already in the literature.


10.37236/8171 ◽  
2019 ◽  
Vol 26 (3) ◽  
Author(s):  
Shyam Sivasathya Narayanan
Keyword(s):  

This paper analyzes relations between pattern avoidance of certain permutations and graphs on staircase grids and boundary grids, and proves two conjectures posed by Bean, Tannock, and Ulfarsson (2015). More specifically, this paper enumerates a certain family of staircase encodings and proves that the downcore graph, a certain graph established on the boundary grid, is pure if and only if the permutation corresponding to the boundary grid avoids the classical patterns 123 and 2143.  


10.37236/468 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Matt Szczesny

Let ${\cal CRF}_S$ denote the category of $S$-colored rooted forests, and H$_{{\cal CRF}_S}$ denote its Ringel-Hall algebra as introduced by Kremnizer and Szczesny. We construct a homomorphism from a $K^+_0({\cal CRF}_S)$–graded version of the Hopf algebra of noncommutative symmetric functions to H$_{{\cal CRF}_S}$. Dualizing, we obtain a homomorphism from the Connes-Kreimer Hopf algebra to a $K^+_0({\cal CRF}_S)$–graded version of the algebra of quasisymmetric functions. This homomorphism is a refinement of one considered by W. Zhao.


Sign in / Sign up

Export Citation Format

Share Document