Papers
Topics
Authors
Recent
Search
2000 character limit reached

q-Narayana Numbers: Combinatorial & Algebraic Insights

Updated 20 January 2026
  • q-Narayana numbers are q-analogues that refine classical Narayana and Catalan numbers by encoding extra combinatorial statistics.
  • They arise in diverse areas including lattice path enumeration, representation theory, and algebraic geometry with explicit formulas and recurrences.
  • Their properties—q-γ-positivity, palindromy, and unimodality—forge links to Hilbert series and symmetric functions, inspiring ongoing research.

The qq-Narayana numbers are a central class of qq-analogues refining the qq-Catalan numbers, interpolating between classical Catalan and Narayana sequences and their generalizations to higher types and parameterizations. They occur in enumerative combinatorics (especially lattice path and noncrossing partition statistics), symmetric functions, representation theory, and algebraic geometry. The qq-Narayana numbers admit multiple parameterizations, possess rich algebraic properties (including qq-γ\gamma-positivity, palindromy, and unimodality), satisfy convolution identities generalizing those of Kreweras and Le Jen-Shoo, and carry deep connections with cluster algebras, Hilbert series, and various combinatorial models.

1. Definitions and Explicit Formulas

The qq-Narayana numbers have various definitions, depending on the context and type. The standard type-A qq-Narayana numbers, denoted Nq(n,k)N_q(n,k), are given by

Nq(n,k)=1[n]q(nk)q(nk1)qN_q(n,k) = \frac{1}{[n]_q} \binom{n}{k}_q \binom{n}{k-1}_q

where qq0 and qq1 is the qq2-binomial coefficient (Guo et al., 2017, Reiner et al., 2016).

A more general qq3-analogue, the qq4–qq5–Narayana numbers, is defined for qq6, qq7: qq8 also expressible in qq9-Pochhammer notation (Rodelet--Causse et al., 14 May 2025):

qq0

These specialize at qq1 to type-B numbers of the form qq2, e.g., qq3 for the minimal nilpotent orbit case (Jia, 2023, Reiner et al., 2016).

Alternative formulations, such as the Hoggatt-type formula

qq4

are commonly used in the Dyck path model (Cigler, 13 Jan 2026).

For types qq5, qq6, and qq7 relative to Weyl groups (and at appropriate generalized parameters), Reiner and Sommers (Reiner et al., 2016) provide:

  • Type Aqq8, qq9: \

qq0

  • Types Bqq1, Cqq2, qq3: \

qq4

2. Combinatorial and Representation-Theoretic Interpretations

At qq5, the (classical) Narayana numbers enumerate Dyck paths by number of peaks, noncrossing partitions by number of blocks, plane partitions in bounding boxes, and other combinatorial objects.

For general qq6, qq7 refines the qq8-Catalan number by recording additional statistics (typically, area, major index, or other weight) on Dyck paths. The qq9–qq0–Narayana numbers refine the qq1–super Catalan numbers by the number of nonzero blocks in type-B noncrossing partitions, with qq2 yielding type-B Narayana numbers corresponding to noncrossing partitions of signed sets (Rodelet--Causse et al., 14 May 2025).

A specific combinatorial model arises from parallelogram polyominoes, where

qq3

with statistics "area", "bounce", and qq4 giving rise to the "bi-statistics" qq5-analogue and connections to diagonal harmonics and symmetric functions (Aval et al., 2013).

From a representation-theoretic perspective, the numerators of the qq6-Hilbert series of highest-weight coordinate rings (e.g., Grassmannians or minimal nilpotent orbits) are precisely qq7-Narayana polynomials (Jia, 2023). For example, in type-A,

qq8

with each qq9 encoding the graded multiplicity of γ\gamma0-weight spaces in Plücker coordinate rings.

For γ\gamma1, γ\gamma2 counts symmetric Dyck paths by valleys (Cigler, 13 Jan 2026).

3. Generating Functions, Recurrences, and γ\gamma3-Positivity

For fixed γ\gamma4, the γ\gamma5-γ\gamma6-Narayana polynomials are

γ\gamma7

These admit a γ\gamma8-γ\gamma9-expansion: qq0 where qq1 is the qq2-super Catalan number (Rodelet--Causse et al., 14 May 2025). This expansion demonstrates qq3-qq4-positivity, palindromy, and unimodality in qq5.

For type-A qq6-Narayana numbers, an explicit recurrence is: qq7 with boundary conditions qq8, qq9 (Jia, 2023).

For type-B: qq0 with the generating function qq1 (Jia, 2023).

A bivariate generating function for the area- and bounce-refined qq2-Narayana numbers in the parallelogram polyomino model exhibits symmetry in qq3 and qq4 (Aval et al., 2013).

4. Convolution Identities and Symmetric Functions

Key convolution identities include the qq5-Kreweras and qq6-Le Jen-Shoo (Riordan-type) identities (Rodelet--Causse et al., 14 May 2025):

  • qq7-Kreweras: qq8
  • qq9-Le Jen-Shoo: Nq(n,k)N_q(n,k)0

These identities generalize classical convolution theorems to the Nq(n,k)N_q(n,k)1-Narayana setting, with proofs utilizing Nq(n,k)N_q(n,k)2-hypergeometric summations (Nq(n,k)N_q(n,k)3) and Nq(n,k)N_q(n,k)4-Vandermonde techniques.

The Nq(n,k)N_q(n,k)5-Narayana polynomials are also expressible as moments of Nq(n,k)N_q(n,k)6-Fibonacci polynomials, linking them to continued fractions, inversion relations, and Hankel determinants (Cigler, 2016).

In the symmetric-function framework, the Nq(n,k)N_q(n,k)7-Narayana polynomials correspond to inner products involving the nabla operator and complete symmetric functions: Nq(n,k)N_q(n,k)8 giving a connection to bigraded Frobenius characteristics of diagonal harmonics (Aval et al., 2013).

5. Integrality, Positivity, and Specializations

The Nq(n,k)N_q(n,k)9-Narayana numbers are polynomials in Nq(n,k)=1[n]q(nk)q(nk1)qN_q(n,k) = \frac{1}{[n]_q} \binom{n}{k}_q \binom{n}{k-1}_q0; negative powers of Nq(n,k)=1[n]q(nk)q(nk1)qN_q(n,k) = \frac{1}{[n]_q} \binom{n}{k}_q \binom{n}{k-1}_q1 cancel via known Nq(n,k)=1[n]q(nk)q(nk1)qN_q(n,k) = \frac{1}{[n]_q} \binom{n}{k}_q \binom{n}{k-1}_q2-Vandermonde and expansion formulas (Rodelet--Causse et al., 14 May 2025). In all established expansions, coefficients are nonnegative integers.

Specializations produce various classical and combinatorial quantities:

  • At Nq(n,k)=1[n]q(nk)q(nk1)qN_q(n,k) = \frac{1}{[n]_q} \binom{n}{k}_q \binom{n}{k-1}_q3, ordinary Narayana numbers and Catalan numbers are recovered.
  • At Nq(n,k)=1[n]q(nk)q(nk1)qN_q(n,k) = \frac{1}{[n]_q} \binom{n}{k}_q \binom{n}{k-1}_q4, Nq(n,k)=1[n]q(nk)q(nk1)qN_q(n,k) = \frac{1}{[n]_q} \binom{n}{k}_q \binom{n}{k-1}_q5 counts symmetric Dyck paths with Nq(n,k)=1[n]q(nk)q(nk1)qN_q(n,k) = \frac{1}{[n]_q} \binom{n}{k}_q \binom{n}{k-1}_q6 valleys (Cigler, 13 Jan 2026).
  • The Nq(n,k)=1[n]q(nk)q(nk1)qN_q(n,k) = \frac{1}{[n]_q} \binom{n}{k}_q \binom{n}{k-1}_q7 specialization retrieves Nq(n,k)=1[n]q(nk)q(nk1)qN_q(n,k) = \frac{1}{[n]_q} \binom{n}{k}_q \binom{n}{k-1}_q8-Catalan numbers: Nq(n,k)=1[n]q(nk)q(nk1)qN_q(n,k) = \frac{1}{[n]_q} \binom{n}{k}_q \binom{n}{k-1}_q9
  • At qq00, qq01 provides qq02-refinements for ballot and Catalan numbers in polyomino and lattice-path models (Aval et al., 2013).

6. Advanced Examples and Open Problems

Recent research advances include:

  • The relation of qq03-Narayana numerators to Hilbert series numerators for Grassmannians and minimal nilpotent adjoint orbits; in type-B, qq04 encodes the qq05-enumeration of Grassmannian Schubert cells and appears in cluster-algebraic contexts (Jia, 2023).
  • The cyclic sieving phenomenon for qq06-Narayana and qq07-Kreweras polynomials under the action of cyclic groups, with evaluations at roots of unity counting fixed points in rotational symmetry classes (Reiner et al., 2016).
  • Alternating sum congruences: for all positive integers qq08 and qq09, sums of powers of qq10-Narayana numbers modulo qq11-Catalan are always divisible by qq12, a result with no known direct combinatorial proof (Guo et al., 2017).

Open problems remain, such as:

  • Producing closed-form product formulas for the qq13-Narayana polynomials in the parallelogram polyomino model (Aval et al., 2013).
  • Providing a bijective or representation-theoretic explanation for cluster/catalan coincidences in high types and orbits (Jia, 2023).
  • Establishing combinatorial interpretations for the full range of qq14-Narayana statistics, especially for general convolution identities and specializations at roots of unity.

7. Comparative Table: Main Definitions

Family Formula Reference
Standard (type-A) qq15 (Guo et al., 2017)
Hoggatt (Dyck, peaks) qq16 (Cigler, 13 Jan 2026)
qq17–qq18–Narayana qq19 (Rodelet--Causse et al., 14 May 2025)
Type-B qq20 (Jia, 2023)
qq21-Narayana (polyomino) qq22 (Aval et al., 2013)

The structure, recurrence, and combinatorial context of the qq23-Narayana numbers make them a deep, unifying object in algebraic combinatorics and its interactions with representation theory and algebraic geometry. Their many refinements, generalizations, and associated open problems continue to attract significant research attention.

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to q-Narayana Numbers.