English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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 $ $ where \nabla is the Macdonald polynomial eigen-operator of Bergeron and Garsia and $h_\mu$ is the homogeneous basis indexed by $\mu=(\mu_1,\mu_2,...,\mu_k)$ partitions of n. The combinatorial side q,t-enumerates a family of Parking Functions whose reading word is a shuffle of k successive segments of 1,2,3,...,n of respective lengths $\mu_1,\mu_2,...,\mu_k$. It can be shown that for t=1/q the symmetric function side reduces to a product of q-binomial coefficients and powers of q. This reduction suggests a surprising combinatorial refinement of the general Shuffle Conjecture. Here we prove this refinement for k=2 and t=1/q. The resulting formula gives a q-analogue of the well studied Narayana numbers.

A refinement of the Shuffle Conjecture with cars of two sizes and $t=1/q$