Weighted P-partitions enumerator

To an extended generalized permutohedron we associate the weighted integer points enumerator, whose principal specialization is the f-polynomial. In the case of poset cones it refines Gessel's P-partitions enumerator. We show that this enumerator is a quasisymmetric function obtained by universal morphism from the Hopf algebra of posets.

A Symmetric Function of Increasing Forests

For an indifference graph G, we define a symmetric function of increasing spanning forests of G. We prove that this symmetric function satisfies certain linear relations, which are also satisfied by the chromatic quasisymmetric function and unicellular $\textrm {LLT}$ polynomials. As a consequence, we give a combinatorial interpretation of the coefficients of the $\textrm {LLT}$ polynomial in the elementary basis (up to a factor of a power of $(q-1)$ ), strengthening the description given in [4].

Integer points enumerator of hypergraphic polytopes

For a hypergraphic polytope there is a weighted quasisymmetric function which enumerates positive integer points in its normal fan and determines its f-polynomial. This quasisymmetric function invariant of hypergraphs extends the Stanley chromatic symmetric function of simple graphs. We consider a certain combinatorial Hopf algebra of hypergraphs and show that universal morphism to quasisymmetric functions coincides with this enumerator function. We calculate the f-polynomial of uniform hypergraphic polytopes.

Schur-positivity via products of grid classes

International audience Characterizing sets of permutations whose associated quasisymmetric function is symmetric and Schur- positive is a long-standing problem in algebraic combinatorics. In this paper we present a general method to construct Schur-positive sets and multisets, based on geometric grid classes and the product operation. Our approach produces many new instances of Schur-positive sets, and provides a broad framework that explains the existence of known such sets that until now were sporadic cases.

P-Partitions and Quasisymmetric Power Sums

The $(P, \omega )$-partition generating function of a labeled poset $(P, \omega )$ is a quasisymmetric function enumerating certain order-preserving maps from $P$ to ${\mathbb{Z}}^+$. We study the expansion of this generating function in the recently introduced type 1 quasisymmetric power sum basis $\{\psi _{\alpha }\}$. Using this expansion, we show that connected, naturally labeled posets have irreducible $P$-partition generating functions. We also show that series-parallel posets are uniquely determined by their partition generating functions. We conclude by giving a combinatorial interpretation for the coefficients of the $\psi _{\alpha }$-expansion of the $(P, \omega )$-partition generating function akin to the Murnaghan–Nakayama rule.

Double Posets and the Antipode of QSym

A quasisymmetric function is assigned to every double poset (that is, every finite set endowed with two partial orders) and any weight function on its ground set. This generalizes well-known objects such as monomial and fundamental quasisymmetric functions, (skew) Schur functions, dual immaculate functions, and quasisymmetric $\left(P, \omega\right)$-partition enumerators. We prove a formula for the antipode of this function that holds under certain conditions (which are satisfied when the second order of the double poset is total, but also in some other cases); this restates (in a way that to us seems more natural) a result by Malvenuto and Reutenauer, but our proof is new and self-contained. We generalize it further to an even more comprehensive setting, where a group acts on the double poset by automorphisms.

Power Sum Expansion of Chromatic Quasisymmetric Functions

The chromatic quasisymmetric function of a graph was introduced by Shareshian and Wachs as a refinement of Stanley's chromatic symmetric function. An explicit combinatorial formula, conjectured by Shareshian and Wachs, expressing the chromatic quasisymmetric function of the incomparability graph of a natural unit interval order in terms of power sum symmetric functions, is proven. The proof uses a formula of Roichman for the irreducible characters of the symmetric group.

$0$-Hecke algebra action on the Stanley-Reisner ring of the Boolean algebra

International audience We define an action of the $0$-Hecke algebra of type A on the Stanley-Reisner ring of the Boolean algebra. By studying this action we obtain a family of multivariate noncommutative symmetric functions, which specialize to the noncommutative Hall-Littlewood symmetric functions and their $(q,t)$-analogues introduced by Bergeron and Zabrocki. We also obtain multivariate quasisymmetric function identities, which specialize to a result of Garsia and Gessel on the generating function of the joint distribution of five permutation statistics. Nous définissons une action de l’algèbre de Hecke-$0$ de type A sur l’anneau Stanley-Reisner de l’algèbre de Boole. En étudiant cette action, on obtient une famille de fonctions symétriques non commutatives multivariées, qui se spécialisent pour les non commutatives fonctions de Hall-Littlewood symétriques et leur $(q,t)$-analogues introduits par Bergeron et Zabrocki. Nous obtenons également des identités de fonction quasisymmetrique multivariées, qui se spécialisent à la suite de Garsia et Gessel sur la fonction génératrice de la distribution conjointe de cinq statistiques de permutation.

Dual Equivalence Graphs Revisited

International audience In 2007 Sami Assaf introduced dual equivalence graphs as a method for demonstrating that a quasisymmetric function is Schur positive. The method involves the creation of a graph whose vertices are weighted by Ira Gessel's fundamental quasisymmetric functions so that the sum of the weights of a connected component is a single Schur function. In this paper, we improve on Assaf's axiomatization of such graphs, giving locally testable criteria that are more easily verified by computers. We then demonstrate the utility of this result by giving explicit Schur expansions for a family of Lascoux-Leclerc-Thibon polynomials. This family properly contains the previously known case of polynomials indexed by two skew shapes, as was described in a 1995 paper by Christophe Carré and Bernard Leclerc. As an immediate corollary, we gain an explicit Schur expansion for a family of modified Macdonald polynomials in terms of Yamanouchi words. This family includes all polynomials indexed by shapes with less than four cells in the first row and strictly less than three cells in the second row, a slight improvement over the known two column case described in 2005 by James Haglund, Mark Haiman, and Nick Loehr.

A Quasisymmetric Function Generalization of the Chromatic Symmetric Function

The chromatic symmetric function $X_G$ of a graph $G$ was introduced by Stanley. In this paper we introduce a quasisymmetric generalization $X^k_G$ called the $k$-chromatic quasisymmetric function of $G$ and show that it is positive in the fundamental basis for the quasisymmetric functions. Following the specialization of $X_G$ to $\chi_G(\lambda)$, the chromatic polynomial, we also define a generalization $\chi^k_G(\lambda)$ and show that evaluations of this polynomial for negative values generalize a theorem of Stanley relating acyclic orientations to the chromatic polynomial.