arXiv 0905.23332009-05-14math.COmath.RT

A kicking basis for the two-column Garsia-Haiman modules

Sami Assaf, Adriano Garsia

备注：: 14 pages, 7 figures, to appear in DMTCS as part of the conference proceedings for FPSAC 2009

英文摘要：

In the early 1990s, Garsia and Haiman conjectured that the dimension of the Garsia-Haiman module is n!, and they showed that the resolution of this conjecture implies the Macdonald Positivity Conjecture. Haiman proved these conjectures in 2001 using algebraic geometry, but the question remains to find an explicit basis for the module which would give a simple proof of the dimension. Using the theory of Orbit Harmonics developed by Garsia and Haiman, we present a "kicking basis" for Garsia-Haiman modules indexed by a partition with at most two columns.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Hook模的Garsia-Haiman模的组合学

The Combinatorics of the Garsia-Haiman Modules for Hook Shapes

给出了钩形的Garsia-Haiman模的几种基，以及这些模的组合分解规则。这些基和规则推广了$A$型共不变代数的经典基和规则。我们还给出了Garsia-Haiman模到下降表示的分解。

2007-03-11math.COmath.RT

空心型Garsia-Haiman模的Bitableaux基

Bitableaux bases for Garsia-Haiman modules of hollow type

Garsia-Haiman模是以X_n={x_1，x_2，.，x_n}和Y_n=y_1，y_2，.，y_n}，其中I是由初等对称多项式e_j（X_n）生成的理想，其中1 <= j <= n.构造了中空型Garsia-Haiman模的一个bitableaux基。这个基础上的应用表示论和其他相关的多项式空间被认为是。

2006-10-03math.CO

A proof of the $\frac{n!}{2}$ conjecture for hook shapes

A well-known representation-theoretic model for the transformed Macdonald polynomial $\widetilde{H}_μ(Z;t,q)$, where $μ$ is an integer partition, is given by the Garsia-Haiman module $\mathcal{H}_μ$. We study the $\frac{n!}{k}$ conjecture of Bergeron and Garsia, which concerns the behavior of certain $k$-tuples of Garsia-Haiman modules under intersection. In the special case that $μ$ has hook shape, we use a basis for $\mathcal{H}_μ$ due to Adin, Remmel, and Roichman to resolve the $\frac{n!}{2}$ conjecture by constructing an explicit basis for the intersection of two Garsia-Haiman modules.

2022-10-21math.COmath.RT

Combinatorics of certain higher $q,t$-Catalan polynomials: chains, joint symmetry, and the Garsia-Haiman formula

The higher $q,t$-Catalan polynomial $C^{(m)}_n(q,t)$ can be defined combinatorially as a weighted sum of lattice paths contained in certain triangles, or algebraically as a complicated sum of rational functions indexed by partitions of $n$. This paper proves the equivalence of the two definitions for all $m\geq 1$ and all $n\leq 4$. We also give a bijective proof of the joint symmetry property $C^{(m)}_n(q,t)=C^{(m)}_n(t,q)$ for all $m\geq 1$ and all $n\leq 4$. The proof is based on a general approach for proving joint symmetry that dissects a collection of objects into chains, and then passes…

2013-06-22math.CO

The Delta Conjecture

We conjecture two combinatorial interpretations for the symmetric function $Δ_{e_k} e_n$, where $Δ_f$ is an eigenoperator for the modified Macdonald polynomials defined by Bergeron, Garsia, Haiman, and Tesler. Both interpretations can be seen as generalizations of the Shuffle Conjecture of Haglund, Haiman, Remmel, Loehr, and Ulyanov, which was proved recently by Carlsson and Mellit. We show how previous work of the third author on Tesler matrices and ordered set partitions can be used to verify several cases of our conjectures. Furthermore, we use a reciprocity identity and LLT polynomials to …

2017-09-06math.CO

Macdonald polynomials and cyclic sieving

The Garsia--Haiman module is a bigraded $\mathfrak{S}_n$-module whose Frobenius image is a Macdonald polynomial. The method of orbit harmonics promotes an $\mathfrak{S}_n$-set $X$ to a graded polynomial ring. The orbit harmonics can be applied to prove cyclic sieving phenomena which is a notion that encapsulates the fixed-point structure of finite cyclic group action on a finite set. By applying this idea to the Garsia--Haiman module, we provide cyclic sieving results regarding the enumeration of matrices that are invariant under certain cyclic row and column rotation and translation of entrie…

2021-09-07math.CO

更多相关论文收起更多论文

关于融合积与 N!/k-猜想

On fusion product and N!/k-conjecture

University of Haifa（海法大学）；Yanqi Lake Beijing Institute of Mathematical Sciences And Applications (BIMSA)（北京雁栖湖应用数学研究院）

本文为当前李代数建立 Schur--Weyl 对偶，将 Garsia--Haiman 模表示为融合积，证明 Butler 猜想并给出 N!/k 猜想维数下界。

2026-10-07math.COmath.RT

A proof of the Delta Conjecture when $q=0$

In [The Delta Conjecture, Trans. Amer. Math. Soc., to appear] Haglund, Remmel, Wilson introduce a conjecture which gives a combinatorial prediction for the result of applying a certain operator to an elementary symmetric function. This operator, defined in terms of its action on the modified Macdonald basis, has played a role in work of Garsia and Haiman on diagonal harmonics, the Hilbert scheme, and Macdonald polynomials [A. M. Garsia and M. Haiman. A remarkable $q,t$-Catalan sequence and $q$-Lagrange inversion, J. Algebraic Combin. 5 (1996), 191--244], [M. Haiman, Vanishing theorems and char…

2017-10-19math.CO

A proof of the Square Paths Conjecture

The modified Macdonald polynomials, introduced by Garsia and Haiman (1996), have many astounding combinatorial properties. One such class of properties involves applying the related $\nabla$ operator of Bergeron and Garsia (1999) to basic symmetric functions. The first discovery of this type was the (recently proven) Shuffle Conjecture of Haglund, Haiman, Loehr, Remmel, and Ulyanov (2005), which relates the expression $\nabla e_n$ to parking functions. In (2007), Loehr and Warrington conjectured a similar expression for $\nabla p_n$ in terms of labeled square paths. In this paper, we extend Ha…

2016-03-01math.CO

Plethystic identities and mixed Hodge structures of character varieties

I demonstrate how certain identities for Macdonald's polynomials established by Garsia, Haiman and Tesler, together with the conjecture of Hausel, Letellier and Villegas imply explicit relations between mixed Hodge polynomials of different character varieties.

2016-03-01math.AGmath.COmath.RT

Garsia-Procesi 模块的一个下降基

A descent basis for the Garsia-Procesi module

本文为 Garsia-Procesi 模块 $R_λ$ 构造了一个基于 Garsia-Stanton 下降单项式的下降基，并通过 Springer 作用下的反对称化得到了抛物情形的基与多项式展开公式。

2024-03-24math.COmath.RT

非零高阶Specht多项式及三行与钩形Garsia-Procesi模的构造

Nonvanishing higher Specht polynomials and a construction for three row and hook shape Garsia--Procesi modules

UC San Diego（加州大学圣迭戈分校）；Colorado State University（科罗拉多州立大学）；University of Pennsylvania（宾夕法尼亚大学）

本文建立了高阶Specht多项式非零的一般判定理论，并证明了三行与钩形Garsia-Procesi模的猜想高阶Specht基，推广了经典Specht构造。

2026-09-14math.CO

Another proof of the $n!$ conjecture

The "n! conjecture" of Garsia and Haiman has inspired mathematicians for nearly two decades, even after Haiman published a proof in 2001. Kumar and Funch Thomsen proved in 2003 that in order to prove the conjecture for all partitions, it suffices to prove it for the so-called "staircase partitions" $(k,k-1,...,2,1)$ for each $k>1$. In the present paper we give a construction of a specially designed two-dimensional family of length-$n$ subschemes of the plane, and use that to prove the $n!$ conjecture for staircase partitions. Together with the result of Kumar and Funch Thomsen, this provides a…

2011-09-15math.AGmath.CO

Colorful combinatorics and Macdonald polynomials

The non-negative integer cocharge statistic on words was introduced in the 1970's by Lascoux and Schützenberger to combinatorially characterize the Hall-Littlewood polynomials. Cocharge has since been used to explain phenomena ranging from the graded decomposition of Garsia-Procesi modules to the cohomology structure of the Grassman variety. Although its application to contemporary variations of these problems had been deemed intractable, we prove that the two-parameter, symmetric Macdonald polynomials are generating functions of a distinguished family of colored words. Cocharge adorns one par…

2017-10-02math.CO

科幻猜想与Loehr--Warrington公式的推广

Extending the science fiction and the Loehr--Warrington formula

本文通过引入Macdonald分段多项式，统一并推广了科幻猜想中的相交多项式与Loehr--Warrington公式，从而证明Loehr--Warrington猜想并拓展Macdonald正性。

2024-09-02math.COmath.RT

nabla算子在两列修正Hall-Littlewood多项式上的Schur正性

Schur positivity of the nabla operator on two-column modified Hall--Littlewood polynomials

Scuola Normale Superiore（意大利高等师范学院）

本文研究了在nabla算子作用下，由两列划分索引的修正Hall-Littlewood多项式的Schur正性，解决了Bergeron等人提出的两个猜想，并证明这些结果可以推广到任意次幂nabla^k。

2026-10-23math.CO