English
Related papers

Related papers: A descent basis for the Garsia-Procesi module

200 papers

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…

Combinatorics · Mathematics 2007-05-23 F. Bergeron , G. Garsia

We introduce higher Specht polynomials - analogs of Specht polynomials in higher degrees - in two sets of variables $x_1,\ldots,x_n$ and $y_1,\ldots,y_n$ under the diagonal action of the symmetric group $S_n$. This generalizes the classical…

Combinatorics · Mathematics 2024-02-09 Maria Gillespie

A recent breakthrough in the theory of (type A) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of a pair of statistics on fillings of Young diagrams. The…

Combinatorics · Mathematics 2010-05-31 Cristian Lenart

In this paper, a new calculus on sequences is defined. Also, the $\lambda$-derivative and the $\lambda$-integration are investigated. The fundamental theorem of $\lambda$-calculus is included. A suitable function basis for the…

Combinatorics · Mathematics 2025-07-01 Ronald Orozco López

Let $\tilde{\mathfrak g}$ be an affine Lie algebra of type $A_\ell^{(1)}$. Suppose we're given a $\mathbb Z$-gradation of the corresponding simple finite-dimensional Lie algebra ${\mathfrak g}={\mathfrak g}_{-1}\oplus{\mathfrak g}_0 \oplus…

Quantum Algebra · Mathematics 2008-07-23 Goran Trupčević

For $\Gamma$ a finite subgroup of $\mathrm{SL}_2(\mathbb{C})$ and $n \geq 1$, we study the fibers of the Procesi bundle over the $\Gamma$-fixed points of the Hilbert scheme of $n$ points in the plane. For each irreducible component of this…

Algebraic Geometry · Mathematics 2025-11-11 Gwyn Bellamy , Raphaël Paegelow

We consider quotients of the unit cube semigroup algebra by particular $\mathbb{Z}_r\wr S_n$-invariant ideals. Using Gr\"obner basis methods, we show that the resulting graded quotient algebra has a basis where each element is indexed by…

Combinatorics · Mathematics 2018-04-11 Benjamin Braun , McCabe Olsen

Browning and Vishe used the Hardy-Littlewood circle method to show the moduli space of rational curves on smooth hypersurfaces of low degree is irreducible and of the expected dimension. We reinterpret the circle method geometrically and…

Algebraic Geometry · Mathematics 2025-11-20 Matthew Hase-Liu

Using the action of the Yang-Baxter elements of the Hecke algebra on polynomials, we define two bases of polynomials in n variables. The Hall-Littlewood polynomials are a subfamily of one of them. For q=0, these bases specialize into the…

Combinatorics · Mathematics 2007-05-23 Francois Descouens , Alain Lascoux

We introduce explicit combinatorial interpretations for the coefficients in some of the transition matrices relating to skew Hall-Littlewood polynomials P_lambda/mu(x;t) and Hivert's quasisymmetric Hall-Littlewood polynomials G_gamma(x;t).…

Combinatorics · Mathematics 2013-06-20 Nicholas A. Loehr , Luis G. Serrano , Gregory S. Warrington

Asvin G and Andrew O'Desky recently introduced the graded algebra P$\Lambda$ of polysymmetric functions as a generalization of the algebra $\Lambda$ of symmetric functions. This article develops combinatorial formulas for some…

Combinatorics · Mathematics 2025-11-18 Aditya Khanna , Nicholas A. Loehr

Using Atiyah-Bott localization on the space of stable maps to the stack quotient $[\mathbb{P}^1/\mathbb{Z}_2]$, we find recursions that determine all Hodge integrals with descendent insertions at one marked point on the hyperelliptic locus…

Algebraic Geometry · Mathematics 2020-10-16 Adam Afandi

Nonmonotone gradient methods generally perform better than their monotone counterparts especially on unconstrained quadratic optimization. However, the known convergence rate of the monotone method is often much better than its nonmonotone…

Optimization and Control · Mathematics 2023-02-07 Xinrui Li , Yakui Huang

We give a direct proof of the equivalence between the Giambelli and Pieri type formulas for Hall-Littlewood functions using Young's raising operators, parallel to joint work with Buch and Kresch for the Schubert classes on isotropic…

Combinatorics · Mathematics 2013-09-10 Harry Tamvakis

We construct a family of moduli spaces, called generalized Lagrangian flag schemes, that are reducible Gorenstein (hence singular), and that admit well-behaved pushforward and pullback operations in Hermitian $K$-theory. These schemes arise…

Algebraic Geometry · Mathematics 2025-08-12 Tao Huang , Heng Xie

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…

Combinatorics · Mathematics 2009-05-15 Sami Assaf , Adriano Garsia

We give a direct geometric interpretation of the path model using galleries in the $1-$skeleton of the Bruhat-Tits building associated to a semi-simple algebraic group. This interpretation allows us to compute the coefficients of the…

Representation Theory · Mathematics 2011-04-08 Stéphane Gaussent , Peter Littelmann

The Bernstein operator $\mathbf{B}_n$ acts on a Schur function $S_\lambda$ by appending a part to the index, i.e., $\mathbf{B}_n S_\lambda=S_{(n,\lambda)}$. This provides a method of constructing the vertex operator representation of Schur…

Combinatorics · Mathematics 2025-11-04 John Graf

A one-parameter generalisation R_{\lambda}(X;b) of the symmetric Macdonald polynomials and interpolations Macdonald polynomials is studied from the point of view of branching rules. We establish a Pieri formula, evaluation symmetry,…

Combinatorics · Mathematics 2011-12-15 Alain Lascoux , S. Ole Warnaar

This work analyzes the solution trajectory of gradient-based algorithms via a novel basis function decomposition. We show that, although solution trajectories of gradient-based algorithms may vary depending on the learning task, they behave…

Machine Learning · Computer Science 2022-10-05 Jianhao Ma , Lingjun Guo , Salar Fattahi