Search arXivSearch

arXiv · 2508.11877

Cassini-Catalan Determinants via Ramanujan's Theta Identity

Abstract

In this paper, we show that the classical Cassini and Catalan identities for Fibonacci numbers arise naturally from a single quadratic theta-function identity of Ramanujan. Expanding the identity $ψ(q)ψ(q^{3})=ψ(q^{4})φ(q^{6})+q\,φ(q^{2})ψ(q^{12})$ via the Jacobi triple product and equating coefficients yields the unified $q$-determinant $F_{n+r}(q)F_{n-r}(q)-F_{n}(q)^{2}=(-q)^{\,n-r}F_{r}(q)^{2}$, $n\ge r\ge 1$, where $ψ(q)$ and $φ(q)$ are Ramanujan's theta functions with $q$ a complex parameter in the unit disc $(\lvert q \rvert < 1)$ and $F_n(q)$ denotes the Carlitz $q$-Fibonacci polynomials. The radial limit $q\to1^{-}$ recovers Cassini's formula ($r=1$) and Catalan's one-parameter extension, while the same derivation with an auxiliary weight produces new partition-refined versions. The argument uses only standard $q$-series algebra (triple-product expansions, $q$-Pochhammer cancellations, and coefficient extraction), providing a transparent modular explanation of the alternating sign $(-1)^{\,n-r}$ in Catalan's identity through the level-6 provenance of $φ$ and $ψ$. Beyond unifying Cassini\textendash Catalan in a single framework, the method lifts seamlessly to higher-order recurrences, giving a template for Tribonacci-type determinants and suggesting congruence phenomena obtained from modular dissections and root-of-unity limits. The results place familiar Fibonacci determinants within Ramanujan's analytic landscape, indicate routes to combinatorial bijections that mirror the analytic cancellations, and connect with themes in modern $q$-series\textemdash ranging from colored partition identities to quantum-modular and exactly solvable models\textemdash thereby highlighting both the explanatory power and the ongoing relevance of Ramanujan's theta identities.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nagananda K G, Jong Sung Kim. 2025-08-16. Cassini-Catalan Determinants via Ramanujan's Theta Identity. https://arxiv.org/abs/2508.11877

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

KEEP EXPLORING

Related papers

Matching Complexes of Outerplanar Graphs

An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are subsets of disjoint edges of the graph. In this paper we prove that the matching complexes of outerplanar graphs are contractible or homotopy equivalent to a wedge of spheres. This extends known results about trees and polygonal line tilings.

math.CO

Awesome graph parameters

For a graph $G$, we denote by $α(G)$ the size of a maximum independent set and by $ω(G)$ the size of a maximum clique in $G$. Our paper lies on the edge of two lines of research, related to $α$ and $ω$, respectively. One of them studies $α$-variants of graph parameters, such as $α$-treewidth or $α$-degeneracy. The second line deals with graph classes where some parameters are bounded by a function of $ω(G)$. A famous example of this type is the family of $χ$-bounded classes, where the chromatic number $χ(G)$ is bounded by a function of $ω(G)$. A Ramsey-type argument implies that if the $α$-variant of a graph parameter $ρ$ is bounded by a constant in a hereditary class $\mathcal{G}$, then $ρ$ is bounded by a function of $ω$ in $\mathcal{G}$. If the reverse implication also holds, we say that $ρ$ is awesome. Otherwise, we say that $ρ$ is awful. In the present paper, we identify a number of awesome and awful graph parameters, derive some algorithmic applications of awesomeness, and propose a number of open problems related to these notions.

math.CO

Perfect matchings and $A_α$-spectral radius in 1-binding graphs

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. For $α\in[0,1)$, we use $A_α(G)$ and $ρ_α(G)$ to denote the $A_α$-matrix and the $A_α$-spectral radius of $G$, respectively. The binding number $\mbox{bind}(G)$ of $G$ is defined by $\mbox{bind}(G)=\min\left\{\frac{|N_G(X)|}{|X|}:\emptyset\neq X\subseteq V(G),N_G(X)\neq V(G)\right\}$. If $\mbox{bind}(G)\geq1$, then $G$ is called 1-binding. A perfect matching in $G$ is a set of nonadjacent edges covering every vertex of $G$. Tutte proved that a graph $G$ of even order has a perfect matching if and only if $o(G-S)\leq|S|$ holds for every $S\subseteq V(G)$ [W. Tutte, The factorization of linear graphs, J. Lond. Math. Soc. 22 (1947) 107--111]. In this paper, we use Tutte's result to prove that a connected 1-binding graph $G$ of even order $n$ with $n\geq n(α)$ has a perfect matching unless $G=K_1\vee(K_{n-5}\cup K_3\cup K_1)$ if $ρ_α(G)\geqρ_α(K_1\vee(K_{n-5}\cup K_3\cup K_1))$, where $n(α)$ is defined as follows: $n(α)=\max\{18,\frac{2+8α}{1-2α}\}$ if $α\in[0,\frac{1}{2})$, and $n(α)=18$ if $α=\frac{1}{2}$.

math.CO