Table of Contents
Fetching ...

Equivariant quasisymmetry and noncrossing partitions

Nantel Bergeron, Lucas Gagnon, Philippe Nadeau, Hunter Spink, Vasu Tewari

TL;DR

This work defines equivariant quasisymmetry for polynomials in two variable families, introducing the ring EQSym$_n$ and the double fundamental polynomials ${\mathfrak{F}_c}$ that specialize to ordinary fundamental quasisymmetric polynomials when the equivariant variables vanish. It then develops double forest polynomials ${\mathfrak{P}_F}(\mathbf{x};\mathbf{t})$, proves their existence and that they form a $\mathbb{Z}[\mathbf{t}]$-basis for $\mathbb{Z}[\mathbf{t}][\mathbf{x}]$, and establishes a subword (vine) model for their computation. A central theme is the evaluation of these polynomials at noncrossing partitions; a forest-to-noncrossing bijection ${\operatorname{ForToNC}}$ is constructed and shown to yield AJS–Billey-type formulas with a triangular, noncrossing structure that implies Graham-positivity of expansions and products. The paper introduces monoid structures (the Thompson/\star monoids and marked variants) to organize coefficient extraction via $\star$-compositions, culminating in a robust framework for positive combinatorics of equivariant quasisymmetric polynomials and their Schubert-forest expansions. The authors further outline a geometric program via a quasisymmetric flag variety to geometrize these invariants, indicating broad implications for toric and cohomological combinatorics beyond the symmetric case.

Abstract

We introduce a definition of ``equivariant quasisymmetry'' for polynomials in two sets of variables. Using this definition we define quasisymmetric generalizations of the theory of double Schur and double Schubert polynomials that we call double fundamental polynomials and double forest polynomials, where the subset of ``noncrossing partitions'' plays the role of $S_n$. In subsequent work we will show this combinatorics is governed by a new geometric construction we call the ``quasisymmetric flag variety'' which plays the same role for equivariant quasisymmetry as the usual flag variety plays in the classical story.

Equivariant quasisymmetry and noncrossing partitions

TL;DR

This work defines equivariant quasisymmetry for polynomials in two variable families, introducing the ring EQSym and the double fundamental polynomials that specialize to ordinary fundamental quasisymmetric polynomials when the equivariant variables vanish. It then develops double forest polynomials , proves their existence and that they form a -basis for , and establishes a subword (vine) model for their computation. A central theme is the evaluation of these polynomials at noncrossing partitions; a forest-to-noncrossing bijection is constructed and shown to yield AJS–Billey-type formulas with a triangular, noncrossing structure that implies Graham-positivity of expansions and products. The paper introduces monoid structures (the Thompson/\star monoids and marked variants) to organize coefficient extraction via -compositions, culminating in a robust framework for positive combinatorics of equivariant quasisymmetric polynomials and their Schubert-forest expansions. The authors further outline a geometric program via a quasisymmetric flag variety to geometrize these invariants, indicating broad implications for toric and cohomological combinatorics beyond the symmetric case.

Abstract

We introduce a definition of ``equivariant quasisymmetry'' for polynomials in two sets of variables. Using this definition we define quasisymmetric generalizations of the theory of double Schur and double Schubert polynomials that we call double fundamental polynomials and double forest polynomials, where the subset of ``noncrossing partitions'' plays the role of . In subsequent work we will show this combinatorics is governed by a new geometric construction we call the ``quasisymmetric flag variety'' which plays the same role for equivariant quasisymmetry as the usual flag variety plays in the classical story.

Paper Structure

This paper contains 38 sections, 50 theorems, 177 equations, 21 figures.

Key Result

Theorem A

Double forest polynomials $\mathfrak{P}_{F}(\textbf{x};\textbf{t})$ exist, and are computed by a subword model that is graphically represented by certain vine diagrams.

Figures (21)

  • Figure 1: Applying ${\mathsf{E}_{i}}$ operations for the forest $F$ with code $c(F)=(2,0,1,0,\ldots)$
  • Figure 2: An indexed forest $F$ and its associated Sylvester words
  • Figure 3: A zigzag forest in ${{\mathsf{ZigZag}_{6}}}$
  • Figure 4: The $i$th elementary forest
  • Figure 5: A nested indexed forest and the noncrossing partition obtained from its support
  • ...and 16 more figures

Theorems & Definitions (135)

  • Theorem A: \ref{['thm:ForestDesiderata']}, \ref{['sec:subword_models']}
  • Remark 1.1
  • Theorem B: \ref{['sec:evaluations']}
  • Theorem C: \ref{['thm:schubertexpandpos']}, \ref{['thm:forestmultpos']}
  • Definition 2.1
  • Theorem 2.2
  • proof
  • Example 2.3
  • Definition 3.1
  • Remark 3.2
  • ...and 125 more