[Paper Review] Nonlinear differential equation for Korobov numbers

Dae San Kim, Taekyun Kim+2 more|arXiv (Cornell University)|Apr 15, 2016

advanced mathematical theories8 references3 citations

TL;DR

This paper derives nonlinear differential equations for the generating functions of Korobov numbers and Frobenius-Euler numbers using recursive coefficient systems. The key contribution is an explicit formula for the $n$th derivative of $1/\log(1+t)$, obtained as a limiting case of the Korobov generating function, enabling new computational tools for special functions and number-theoretic polynomials.

ABSTRACT

In this paper, we present nonlinear differential equations for the generating functions for the Korobov numbers and for the Frobenuius-Euler numbers. As an application, we find an explicit expression for the nth derivative of 1/ log(1 + t).

Motivation & Objective

• To establish a nonlinear differential equation satisfied by the generating function of Korobov numbers $K_n(\lambda)$.
• To derive a corresponding nonlinear differential equation for the generating function of Frobenius-Euler numbers $H_n(\mu)$.
• To apply these differential equations to obtain an explicit expression for the $n$th derivative of $1/\log(1+t)$.
• To generalize the recurrence structure of coefficients in the differential expansions using falling factorial-like products.

Proposed method

• Define $F(t) = \frac{1}{(1+t)^\lambda - 1}$ as the generating function for Korobov numbers and derive its $N$th derivative via recursive coefficient relations.
• Establish a recurrence for coefficients $a_{i-1}(N)$: $a_{i-1}(N+1) = (N + i\lambda)a_{i-1}(N) + \lambda(i-1)a_{i-2}(N)$, with initial conditions $a_0(0) = 1/\lambda$.
• Use the limit $\lambda \to 0$ to connect $\lambda F(t)$ to $1/\log(1+t)$, transforming the differential equation into a formula for $\frac{d^N}{dt^N} \frac{1}{\log(1+t)}$.
• Apply analogous methods to the Frobenius-Euler generating function $F(t) = \frac{1}{(1+\lambda t)^{1/\lambda} - \mu}$, deriving a similar recurrence for coefficients $b_{i-1}(N)$.
• Take the limit $\lambda \to 0$ in the Frobenius-Euler case to obtain a differential equation for $F(t) = \frac{1}{e^t - \mu}$, yielding a recurrence for $b_{i-1}(N;\mu)$.
• Use the recurrence $b_{j}(N;\mu) = j\mu \sum_{i=0}^{N-j} (j+1)^i b_{j-1}(N-i-1;\mu)$ to compute coefficients in the final differential equation.

Experimental results

Research questions

• RQ1 What nonlinear differential equation does the generating function of Korobov numbers satisfy?
• RQ2 How can the $n$th derivative of $1/\log(1+t)$ be explicitly computed using the Korobov generating function?
• RQ3 What is the structure of the coefficient recurrence for the $N$th derivative of the Frobenius-Euler generating function?
• RQ4 How do the differential equations for Korobov and Frobenius-Euler numbers behave under the limit $\lambda \to 0$?
• RQ5 Can the recurrence for the coefficients in the differential expansion be expressed in closed form?

Key findings

• The $N$th derivative of the Korobov generating function $F(t) = \frac{1}{(1+t)^\lambda - 1}$ satisfies $F^{(N)} = \frac{(-1)^N \lambda}{(1+t)^N} \sum_{i=1}^{N+1} a_{i-1}(N) F^i$, with coefficients $a_{i-1}(N)$ defined recursively.
• The limit $\lambda \to 0$ yields $\frac{d^N}{dt^N} \frac{1}{\log(1+t)} = \frac{(-1)^N}{(1+t)^N} \sum_{i=2}^{N+1} \lim_{\lambda \to 0} \lambda^{2-i} a_{i-1}(N;\lambda) \frac{1}{\log^i(1+t)}$, where the limit is expressed via harmonic numbers.
• The coefficient $a_0(N)$ is given by $a_0(N) = (N + \lambda - 1)_{N-1}$, and $a_{N+1}(N) = \lambda^N (N+1)!$.
• For the Frobenius-Euler case, the $N$th derivative of $F(t) = \frac{1}{(1+\lambda t)^{1/\lambda} - \mu}$ satisfies $F^{(N)} = \frac{(-1)^N}{(1+\lambda t)^N} \sum_{i=1}^{N+1} b_{i-1}(N) F^i$, with coefficients $b_{i-1}(N)$ defined by a recurrence involving $\mu$ and $\lambda$.
• In the limit $\lambda \to 0$, the differential equation for $F(t) = \frac{1}{e^t - \mu}$ is derived, with coefficients $b_{j}(N;\mu)$ satisfying $b_j(N;\mu) = j\mu \sum_{i=0}^{N-j} (j+1)^i b_{j-1}(N-i-1;\mu)$.
• The coefficients $b_0(N;\mu) = 1$ and $b_N(N;\mu) = \mu^N N!$ are confirmed via induction on $N$.