English
Related papers

Related papers: A new `dinv' arising from the two part case of the…

200 papers

Recent results have placed the classical shuffle conjecture of Haglund et al. in a broader context of an infinite family of conjectures about parking functions in any rectangular lattice. The combinatorial side of the new conjectures has…

Combinatorics · Mathematics 2014-08-01 Angela Hicks , Emily Leven

We prove here that the polynomial <nabla(C_p(1)), e_a h_b h_c> q, t-enumerates, by the statistics dinv and area, the parking functions whose supporting Dyck path touches the main diagonal according to the composition p of size a + b + c and…

Combinatorics · Mathematics 2013-05-10 Adriano M. Garsia , Guoce Xin , Mike Zabrocki

The original Shuffle Conjecture of Haglund et al. has a symmetric function side and a combinatorial side. The symmetric function side may be simply expressed as $<\nabla e_n, h_{\mu}>$ where \nabla is the Macdonald polynomial eigen-operator…

Combinatorics · Mathematics 2013-04-29 Angela Hicks , Emily Leven

The shuffle conjecture expresses a relationship between parking functions, diagonal harmonics, and the Bergeron-Garsia $\nabla$ operator. Recent conjectures about a family of modified Hall-Littlewood operators made by Haglund, Morse, and…

Combinatorics · Mathematics 2012-10-10 Angela Hicks

We introduce a new approach to the enumeration of rational slope parking functions with respect to the area and a generalized dinv statistics, and relate the combinatorics of parking functions to that of affine permutations. We relate our…

Combinatorics · Mathematics 2016-09-30 Eugene Gorsky , Mikhail Mazin , Monica Vazirani

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…

Combinatorics · Mathematics 2018-04-18 Emily Sergel

In (Duane, Garsia, Zabrocki 2013) the authors introduced a new dinv statistic, denoted ndinv, on the two part case of the shuffle conjecture (Haglund et al. 2005) in order to prove a compositional refinement. Though in (Hicks, Kim 2013) a…

Combinatorics · Mathematics 2022-06-06 Michele D'Adderio , Alessandro Iraci

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…

Combinatorics · Mathematics 2016-03-02 Emily Sergel Leven

We prove that the combinatorial side of the "Rational Shuffle Conjecture" provides a Schur-positive symmetric polynomial. Furthermore, we prove that the contribution of a given rational Dyck path can be computed as a certain skew LLT…

Combinatorics · Mathematics 2016-03-15 Eugene Gorsky , Mikhail Mazin

We introduce a $q,t$-enumeration of Dyck paths which are forced to touch the main diagonal at specific points and forbidden to touch elsewhere and conjecture that it describes the action of the Macdonald theory $\nabla$ operator applied to…

Combinatorics · Mathematics 2011-06-27 James Haglund , Jennifer Morse , Mike Zabrocki

We consider the inversion enumerator I_n(q), which counts labeled trees or, equivalently, parking functions. This polynomial has a natural extension to generalized parking functions. Substituting q = -1 into this generalized polynomial…

Combinatorics · Mathematics 2008-06-04 Denis Chebikin , Alexander Postnikov

In this paper, we obtain a q-exponential generating function for inversions on parking functions via symmetric function theory and also through a direct bijection to rooted labeled forests. We then apply these techniques to unit interval…

The shuffle conjecture of Haglund et al. expresses the symmetric function $\nabla e_n$ as a sum over labeled Dyck paths. Here $\nabla$ is an operator on symmetric functions defined in terms of its diagonal action on the basis of modified…

Combinatorics · Mathematics 2025-09-30 Jonah Blasiak , Mark Haiman , Jennifer Morse , Anna Pun , George H. Seelinger

We introduce area, bounce and dinv statistics on decorated parallelogram polyominoes, and prove that some of their q,t-enumerators match $\langle \Delta_{h_m} e_{n+1}, s_{k+1,1^{n-k}} \rangle$, extending in this way the work in (Aval et al.…

Combinatorics · Mathematics 2017-11-13 Michele D'Adderio , Alessandro Iraci

In the early 2000's the first and second named authors worked for a period of six years in an attempt of proving the Compositional Shuffle Conjecture [1]. Their approach was based on the discovery that all the Combinatorial properties…

Combinatorics · Mathematics 2018-06-11 Adriano Garsia , Angela Hicks , Guoce Xin

We introduce area, bounce and dinv statistics on decorated parallelogram polyominoes, and prove that some of their q,t-enumerators match $\langle \Delta_{h_m} e_{n+1},s_{k+1,1^{n-k}}\rangle$, extending in this way the work in (Aval et al.…

Combinatorics · Mathematics 2017-12-27 Michele D'Adderio , Alessandro Iraci

The aim of this work is to extend to a general $S_m\times S_n$-module context the Grossman-Bizley paradigm that allows the enumeration of Dyck paths in a $m\times n$-rectangle. We obtain an explicit formula for the the "bi-Frobenius"…

Combinatorics · Mathematics 2015-03-16 Jean-Christophe Aval , François Bergeron

In this paper, we formulate a rational analog of the fall Delta theorem and the Delta square conjecture. We find a new dinv statistic on fall-decorated paths on a $(m+k) \times (n+k)$ rectangle that simultaneously extends the previously…

Combinatorics · Mathematics 2025-08-29 Alessandro Iraci , Roberto Pagaria , Giovanni Paolini

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…

Combinatorics · Mathematics 2022-06-10 Aritra Bhattacharya

A pair $(G,K)$ of a group and its subgroup is called a Gelfand pair if the induced trivial representation of $K$ on $G$ is multiplicity free. Let $(a_j)$ be a sequence of positive integers of length $n$, and let $(b_i)$ be its…

Combinatorics · Mathematics 2010-09-28 Kürşat Aker , Mahir Bilen Can
‹ Prev 1 2 3 10 Next ›