Some remarks about q-Narayana polynomials for q=-1

This paper investigates and compares the properties of q-Narayana polynomials specifically at the values $q=-1$ and $q=1$.

The Gist

Imagine you are an architect designing a city of "Mathematical Paths." In this city, there are two famous types of roads: Narayana Roads and q-Narayana Roads.

This paper is like a detective story where the author, Johann Cigler, investigates what happens when we take a very specific, unusual setting for these roads: a world where the "temperature" or "parameter" $q$ is set to -1.

Here is the breakdown of the paper using simple analogies:

1. The Setting: The Two Types of Roads

• The Standard Roads ($q=1$): These are the famous Narayana polynomials. You can think of them as counting the number of ways to walk up a mountain and back down without ever going below sea level (these are called Dyck paths). The standard Narayana polynomials tell you how many of these paths have exactly $k$ "valleys" (dips in the road).
• The Special Roads ($q=-1$): The author asks, "What happens if we change the rules of the game so that $q = -1$?" This creates a new set of polynomials, which he calls $c_n(t)$. These are like the standard roads, but viewed through a funhouse mirror that flips signs and changes the counting logic.

2. The Discovery: A New Pattern

The author discovers that these new "Special Roads" ($c_n(t)$) aren't just random; they have a very specific, hidden structure.

• The "Symmetric" Secret: While the standard roads count all possible paths, the new roads at $q=-1$ turn out to count only the symmetric paths (paths that look the same if you fold them in half).
• The Recipe: The author finds a "recipe" to build these new roads. He shows that the new roads are actually a mix of two other famous types of roads:
  1. Type B Roads: A specific variation of mountain paths.
  2. Standard Roads: The original Narayana paths.
  • Analogy: It's like discovering that a new type of cake is actually just a specific ratio of vanilla cake and chocolate cake mixed together.

3. The Magic Mirror (Generating Functions)

In math, a "generating function" is like a master key or a machine that can spit out any number in a sequence if you turn the handle.

The author builds a machine for his new roads ($c_n(t)$). He notices something strange and beautiful:

• If you run the machine forward, you get one result.
• If you run the machine backward (or flip the signs), you get a result that is perfectly related to the original.
• Analogy: Imagine a kaleidoscope. If you look through it normally, you see a pattern. If you rotate it 180 degrees, the pattern shifts, but it's mathematically locked to the first one. The author proves that these new polynomials behave exactly like that kaleidoscope.

4. The "Hankel" Test (The Stability Check)

Finally, the author performs a "stress test" on these roads using something called Hankel determinants.

• Analogy: Imagine stacking blocks to build a tower. The "Hankel determinant" is a way of checking if the tower is stable or if it will collapse.
• For the standard roads, the tower is very stable and predictable.
• For the new roads ($q=-1$), the author proves that the tower is also stable, but it follows a slightly different, alternating pattern (like a tower that wobbles left, then right, then left, but never falls).

The Big Takeaway

The paper is essentially saying:

"We took a famous mathematical object (Narayana polynomials), turned the dial to -1, and found a new, beautiful object. This new object counts symmetric paths, can be built from known ingredients, and has a perfectly stable structure that mirrors the original object in a fascinating way."

It's a story about finding order and symmetry in a place where you might expect chaos, showing that even when you flip the signs in math, the underlying beauty remains.

Technical Summary

Here is a detailed technical summary of the paper "Some remarks about q-Narayana polynomials for $q = -1$" by Johann Cigler.

1. Problem Statement

The paper investigates the properties of $q$-Narayana polynomials, denoted as $C_n(t; q)$, specifically in the case where the parameter $q = -1$.

• Context: The standard Narayana polynomials $C_n(t)$ (corresponding to $q=1$) are well-studied combinatorial objects. They serve as the generating functions for the major index of Dyck paths with a specific number of valleys and are closely related to Catalan numbers.
• The Gap: While the properties of these polynomials for $q=1$ are well understood (including their Hankel determinants and generating functions), the behavior of these polynomials when $q = -1$ is less explored.
• Objective: The author aims to define the polynomials $c_n(t) = C_n(t; -1)$, derive their algebraic properties, establish their generating functions, and compare their structural characteristics (specifically Hankel determinants) with the classical case ($q=1$).

2. Methodology

The author employs a combination of combinatorial interpretation, algebraic manipulation, and generating function analysis.

• Definition and Reduction: The paper starts by defining the $q$-Narayana polynomials using $q$-binomial coefficients. By setting $q = -1$, the author derives explicit formulas for the coefficients $v(n, k)$ of the resulting polynomials $c_n(t)$.
• Combinatorial Interpretation: The coefficients $v(n, k)$ are identified as the number of symmetric Dyck paths of semi-length $n$ with $k$ valleys. This connects the algebraic object to a specific subset of lattice paths.
• Recurrence Relations: The author establishes recurrence relations for $c_n(t)$ by comparing coefficients and utilizing known identities for symmetric Dyck paths.
• Generating Functions: The core of the methodology involves deriving functional equations for the generating functions of the sequence $c_n(t)$ and its shifted version. The author relates these new generating functions to the known generating function of the standard Narayana polynomials ($C(t, z)$) and Type B Narayana polynomials ($W_n(t)$).
• Continued Fractions and Hankel Determinants: To determine the Hankel determinants of the sequence, the author utilizes the theory of continued fractions. By expressing the generating functions as continued fractions, the author applies known theorems (referencing [2] and [3]) that link the coefficients of the continued fraction to the values of the Hankel determinants.

3. Key Contributions and Results

A. Explicit Formulas and Recurrences

The paper derives explicit expressions for the polynomials $c_n(t)$:

• Recurrence: For $n \geq 1$, the polynomials satisfy:
  $$c_{2n+1}(t) = (1+t)c_{2n}(t)$$
  $$c_{2n+2}(t) = (1+t)c_{2n+1}(t) - t C_{2n+1}(t)$$
  where $C_n(t)$ are the standard Narayana polynomials.
• Relation to Type B: The odd-indexed polynomials are explicitly related to Type B Narayana polynomials ($W_n(t)$) and standard Narayana polynomials:
  $$c_{2n+1}(t) = W_n(t) + n t C_n(t)$$

B. Generating Functions

The author derives closed-form expressions for the generating functions:

• Let $c(t, z) = \sum c_n(t) z^n$ and $g(t, z) = \sum c_{n+1}(t) z^n$.
• The paper establishes a functional identity linking the generating function of the $q=-1$ case to the standard case:
  $$c(t, z) c(-t, -z) = C(t, z^2)$$
  $$g(t, z) g(-t, -z) = G(t, z^2)$$
  where $G(t, z)$ is the generating function for the shifted standard Narayana polynomials. This symmetry is a significant structural finding.

C. Hankel Determinants

A major result of the paper is the calculation of the Hankel determinants for the sequence $c_n(t)$.

• Standard Case ($q=1$): The Hankel determinants of the Narayana polynomials $C_n(t)$ are known to be $t^{\binom{n}{2}}$.
• New Case ($q=-1$): The paper proves that the Hankel determinants for the sequence $c_n(t)$ are:
  $$\det(c_{i+j}(t))_{0 \leq i,j \leq n-1} = (-t)^{\binom{n}{2}}$$
  $$\det(c_{i+j+1}(t))_{0 \leq i,j \leq n-1} = (-1)^n t^{\binom{n}{2}}$$
  These results uniquely determine the sequence $c_n(t)$.

4. Significance

• Combinatorial Insight: The work provides a concrete combinatorial interpretation for $q=-1$ in the context of Narayana polynomials, linking them to symmetric Dyck paths. This enriches the understanding of how $q$-analogues behave at roots of unity.
• Structural Symmetry: The discovery that the product of the generating function at $(t, z)$ and $(-t, -z)$ yields the generating function of the standard Narayana polynomials (with $z^2$) reveals a deep symmetry between the $q=1$ and $q=-1$ cases.
• Determinant Evaluation: The explicit evaluation of the Hankel determinants for this specific sequence is a non-trivial result. In the theory of orthogonal polynomials and moment sequences, Hankel determinants often encode deep structural information. Showing that they differ from the $q=1$ case only by a sign factor $(-1)^{\binom{n}{2}}$ highlights a subtle but precise relationship between the two polynomial families.
• Methodological Utility: The paper demonstrates the power of using continued fractions to evaluate Hankel determinants for sequences defined by complex recurrence relations, offering a template for analyzing other $q$-analogues at specific values.

In summary, Johann Cigler's paper successfully characterizes the $q=-1$ specialization of Narayana polynomials, establishing their recurrence, generating functions, and determinant properties, while highlighting their elegant relationship to the classical $q=1$ case and symmetric lattice paths.