Related papers: The nonsymmetric shuffle theorem
Heckman and Opdam introduced a non-symmetric analogue of Jack polynomials using Cherednik operators. In this paper, we derive a simple recursion formula for these polynomials and formulas relating the symmetric Jack polynomials with the…
Extending the elementary and complete homogeneous symmetric functions, we introduce the truncated homogeneous symmetric function $h_{\lambda}^{\dd}$ in $(\ref{THSF})$ for any integer partition $\lambda$, and show that the transition matrix…
Given a locally finite graded set A and a commutative, associative operation on A that adds degrees, we construct a commutative multiplication * on the set of noncommutative polynomials in A which we call a quasi-shuffle product; it can be…
The quasisymmetic Macdonald polynomials $G_{\gamma}(X; q, t)$ were recently introduced by the first and second authors with Haglund, Mason, and Williams in [3] to refine the symmetric Macdonald polynomials $P_{\lambda}(X; q, t)$ with the…
It is known that differences of symmetric functions corresponding to various bases are nonnegative on the nonnegative orthant exactly when the partitions defining them are comparable in dominance order. The only exception is the case of…
The Haglund--Haiman--Loehr theorem provides the following combinatorial formula for the modified Macdonald polynomials: $$\tilde{H}_{\mu}(X;q,t)=\sum_{\sigma: \mu\rightarrow \mathbb{P}}x^{\sigma}t^{maj(\sigma)}q^{inv(\sigma)}.$$ Inspired by…
We use a Dyck path model for unit-interval graphs to study the chromatic quasisymmetric functions introduced by Shareshian and Wachs, as well as vertical strip --- in particular, unicellular LLT polynomials. We show that there are parallel…
We prove a formula for the image of a skew Schur polynomial $s_{\lambda/\mu}\left( x_{1}, x_{2}, \ldots, x_{N}\right) $ under the differential operator $\nabla:= \dfrac{\partial}{\partial x_{1}} +\dfrac{\partial}{\partial…
Haglund, Luoto, Mason, and van Willigenburg introduced a basis for quasisymmetric functions called the quasisymmetric Schur function basis, generated combinatorially through fillings of composition diagrams in much the same way as Schur…
We define a number of related combinatorial objects, each of which possesses a surprising symmetry. We include several applications such as a combinatorial explanation for certain fixed points of the involution $\omega$ on the ring of…
We investigate quasisymmetric functions coming from combinatorial Hopf monoids. We show that these invariants arise naturally in Ehrhart theory, and that some of their specializations are Hilbert functions for relative simplicial complexes.…
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…
The polynomial relationship between elementary symmetric functions (Cauchy enumeration formula) is formulated via a ``raising operator" and Fock space construction. A simple graphical proof of this relation is proposed. The new operator…
In this paper we introduce doubly symmetric functions, arising from the equivalence of particular linear combinations of Schur functions and hook Schur functions. We study algebraic and combinatorial aspects of doubly symmetric functions,…
In recent work, the authors used an order lowering operator $\nabla$, introduced by Stanley, to prove the strong Sperner property for the weak Bruhat order on the symmetric group. Hamaker, Pechenik, Speyer, and Weigandt interpreted $\nabla$…
The symmetric group acts on polynomial differential forms on $\mathbb{R}^{n}$ through its action by permuting the coordinates. In this paper the $S_{n}% $-invariants are shown to be freely generated by the elementary symmetric polynomials…
Solutions to Laplace's equation are called harmonic functions. Harmonic functions arise in many applications, such as physics and the theory of stochastic processes. Of interest classically are harmonic polynomials, which have a simple…
This article gives a combinatorial proof of a plethystic generalization of the Murnaghan--Nakayama rule. The main result expresses the product of a Schur function with the plethysm $p_r \circ h_n$ as an integral linear combination of Schur…
The deep interconnection between linear algebra and graph theory allows one to interpret classical matrix invariants through combinatorial structures. To each square matrix A over a commutative ring K, one can associate a weighted directed…
We introduce a quasisymmetric refinement of Stanley's chromatic symmetric function. We derive refinements of both Gasharov's Schur-basis expansion of the chromatic symmetric function and Chow's expansion in Gessel's basis of fundamental…