A combinatorial proof of Jacobi's elliptic identity via alternating permutations
Abstract: We provide a unified combinatorial framework connecting Entringer numbers, Dumont-Viennot snakes, and elliptically weighted continued fractions, which gives a structural interpretation of the Jacobi elliptic identity \begin{equation} \mathrm{sn}'(u)=\mathrm{cn}(u)\,\mathrm{dn}(u), \end{equation} where $\mathrm{sn}$, $\mathrm{cn}$ and $\mathrm{dn}$ are the Jacobi elliptic functions. This framework allows the decomposition of weighted snakes corresponding to the derivative of $\mathrm{sn}$ into canonical $\mathrm{cn}$- and $\mathrm{dn}$-components, bridging classical combinatorics and elliptic function theory.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.