Search arXivSearch

arXiv · 2512.12603

Hankel determinants for convolution powers of Narayana polynomials

Abstract

We prove and generalize a conjecture of Johann Cigler on the Hankel determinants of convolution powers of Narayana polynomials. Our method follows a "guess-and-prove" strategy, relying on established techniques involving Hankel continued fractions. While the final forms of our theorems are given by simple closed expressions, the proofs require us to formulate and manage extremely large and intricate explicit expressions at intermediate stages. Most of the technically involved and lengthy formal verifications are carried out using a symbolic computation program, whose code is available on the author's personal webpage for independent verification. We emphasize that our program delivers rigorous symbolic proofs, rather than merely verifying the initial terms.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Guo-Niu Han. 2025-12-14. Hankel determinants for convolution powers of Narayana polynomials. https://arxiv.org/abs/2512.12603

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO