中文
相关论文

相关论文: A proof of the $\frac{n!}{2}$ conjecture for hook …

200 篇论文

This work studies the remarkable relationships that hold among certain m-tuples of the Garsia-Haiman modules $ {\bf M}_\mu$ and corresponding elements of the Macdonald basis. We recall that ${\bf M}_\mu$ is defined for a partition $\mu\part…

组合数学 · 数学 2007-05-23 F. Bergeron , G. Garsia

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…

组合数学 · 数学 2009-05-15 Sami Assaf , Adriano Garsia

We prove a conjecture of Okada giving an exact formula for a certain statistic for hook-lengths of partitions: \frac{1}{n!} \sum_{\lambda \vdash n} f_{\lambda}^2 \sum_{u \in \lambda} \prod_{i=1}^{r}(h_u^2 - i^2) = \frac{1}{2(r+1)^2}…

组合数学 · 数学 2012-01-17 Greta Panova

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…

组合数学 · 数学 2021-09-08 Jaeseong Oh

Several bases of the Garsia-Haiman modules for hook shapes are given, as well as combinatorial decomposition rules for these modules. These bases and rules extend the classical ones for the coinvariant algebra of type $A$. We also give a…

表示论 · 数学 2007-05-23 Ron M. Adin , Jeffrey B. Remmel , Yuval Roichman

We initiate the study of the Macdonald intersection polynomials $\operatorname{I}_{\mu^{(1)},\dots,\mu^{(k)}}[X;q,t]$, which are indexed by $k$-tuples of partitions $\mu^{(1)},\dots,\mu^{(k)}$. These polynomials are conjectured to be equal…

组合数学 · 数学 2025-09-03 Donghyun Kim , Seung Jin Lee , Jaeseong Oh

We prove a Macdonald polynomial analogue of the celebrated Nekrasov-Okounkov hook-length formula from the theory of random partitions. As an application we obtain a proof of one of the main conjectures of Hausel and Rodriguez-Villegas from…

组合数学 · 数学 2018-08-07 Eric M. Rains , S. Ole Warnaar

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…

代数几何 · 数学 2011-09-16 Geir Ellingsrud , Stein Arild Strømme

Haglund's conjecture states that $\dfrac{\langle J_{\lambda}(q,q^k),s_\mu \rangle}{(1-q)^{|\lambda|}} \in \mathbb{Z}_{\geq 0}[q]$ for all partitions $\lambda,\mu$ and all non-negative integers $k$, where $J_{\lambda}$ is the integral form…

组合数学 · 数学 2022-06-10 Aritra Bhattacharya

The purpose of this paper is to find a new way to prove the $n!$ conjecture for particular partitions. The idea is to construct a monomial and explicit basis for the space $M_{\mu}$. We succeed completely for hook-shaped partitions, i.e.,…

组合数学 · 数学 2007-11-07 Jean-Christophe Aval

We relate the n! conjecture (by Garsia and Haiman) to the geometry of principal nilpotent pairs, and state a conjecture generalizing the n! conjecture to arbitrary semisimple algebraic groups. We also show, using Borel's fixed point…

代数几何 · 数学 2007-05-23 Shrawan Kumar , Jesper Funch Thomsen

We introduce the Macdonald piece polynomial $\operatorname{I}_{\mu,\lambda,k}[X;q,t]$, which is a vast generalization of the Macdonald intersection polynomial in the science fiction conjecture by Bergeron and Garsia. We demonstrate a…

组合数学 · 数学 2024-09-04 Donghyun Kim , Jaeseong Oh

The permutation matrices form a subgroup of $\text{GL}_n(\mathbb{C})$ that is isomorphic to the symmetric group $S_n$. Let $r_{\mu\lambda}$ denote the multiplicity of the irreducible representation $V_\mu$ of $S_n$, corresponding to a…

组合数学 · 数学 2025-12-18 Sridhar P. Narayanan

We generalize multivariate hook product formulae for $P$-partitions. We use Macdonald symmetric functions to prove a $(q,t)$-deformation of Gansner's hook product formula for the generating functions of reverse (shifted) plane partitions.…

组合数学 · 数学 2010-02-16 Soichi Okada

We study the isospectral Hilbert scheme X_n, defined as the reduced fiber product of C^2n with the Hilbert scheme H_n of points in the plane, over the symmetric power S^n C^2. We prove that X_n is normal, Cohen-Macaulay, and Gorenstein, and…

代数几何 · 数学 2007-05-23 Mark Haiman

The modified Macdonald polynomials introduced by Garsia and Haiman (1996) have many remarkable combinatorial properties. One such class of properties involves applying the $\nabla$ operator of Bergeron and Garsia (1999) to basic symmetric…

组合数学 · 数学 2018-04-18 Emily Sergel

Using the combinatorial formula for the transformed Macdonald polynomials of Haglund, Haiman, and Loehr, we investigate the combinatorics of the symmetry relation $\widetilde{H}_\mu(\mathbf{x};q,t) =…

组合数学 · 数学 2015-05-27 Maria Monks Gillespie

We make progress towards understanding the structure of Littlewood-Richardson coefficients $g_{\lambda,\mu}^{\nu}$ for products of Jack symmetric functions. Building on recent results of the second author, we are able to prove new cases of…

组合数学 · 数学 2023-09-29 Per Alexandersson , Ryan Mickler

A classical result of MacMahon states that inversion number and major index have the same distribution over permutations of a given multiset. In this work we prove a strengthening of this theorem originally conjectured by Haglund. Our…

组合数学 · 数学 2015-08-26 Andrew Timothy Wilson

We prove a combinatorial formula for the Macdonald polynomial H_mu(x;q,t) which had been conjectured by the first author. Corollaries to our main theorem include the expansion of H_mu(x;q,t) in terms of LLT polynomials, a new proof of the…

组合数学 · 数学 2009-11-10 J. Haglund , M. Haiman , N. Loehr
‹ 上一页 1 2 3 10 下一页 ›