Table of Contents
Fetching ...

A descent basis for the Garsia-Procesi module

Erik Carlsson, Raymond Chou

Abstract

We assign to each Young diagram $λ$ a subset $\mathcal{B}_{λ'}$ of the collection of Garsia-Stanton descent monomials, and prove that it determines a basis of the Garsia-Procesi module $R_λ$, whose graded character is the Hall-Littlewood polynomial $\tilde{H}_λ[X;t]$. This basis is a major index analogue of the basis $\mathcal{B}_λ\subset R_λ$ defined by certain recursions in due to Garsia and Procesi, in the same way that the descent basis is related to the Artin basis of the coinvariant algebra $R_n$, which in fact corresponds to the case when $λ=1^n$. By anti-symmetrizing a subset of this basis with respect to the corresponding Young subgroup under the Springer action, we obtain a basis in the parabolic case, as well as a corresponding formula for the expansion of $\tilde{H}_λ[X;t]$. Despite a similar appearance, it does not appear obvious how to connect these formulas appear to the specialization of the modified Macdonald formula of Haglund, Haiman and Loehr at $q=0$.

A descent basis for the Garsia-Procesi module

Abstract

We assign to each Young diagram a subset of the collection of Garsia-Stanton descent monomials, and prove that it determines a basis of the Garsia-Procesi module , whose graded character is the Hall-Littlewood polynomial . This basis is a major index analogue of the basis defined by certain recursions in due to Garsia and Procesi, in the same way that the descent basis is related to the Artin basis of the coinvariant algebra , which in fact corresponds to the case when . By anti-symmetrizing a subset of this basis with respect to the corresponding Young subgroup under the Springer action, we obtain a basis in the parabolic case, as well as a corresponding formula for the expansion of . Despite a similar appearance, it does not appear obvious how to connect these formulas appear to the specialization of the modified Macdonald formula of Haglund, Haiman and Loehr at .
Paper Structure (8 sections, 5 theorems, 39 equations)

This paper contains 8 sections, 5 theorems, 39 equations.

Key Result

Theorem 2.2

We have

Theorems & Definitions (10)

  • Example 2.1
  • Theorem 2.2: The Shuffle Theorem carlsson2018proof
  • Lemma 2.3
  • Example 2.4
  • Theorem 2.5: Compositional Shuffle Theorem carlsson2018proof
  • Corollary 2.6
  • proof
  • Example 2.7
  • Proposition 2.8
  • Definition 2.9