Archive:Bessel moment polynomial
Template:Error:wrong namespace
| This article is being considered for deletion in accordance with Wikipedia's deletion policy. Please share your thoughts on the matter at this article's entry on the Articles for deletion page. Feel free to edit the article, but the article must not be blanked, and this notice must not be removed, until the discussion is closed. For more information, particularly on merging or moving the article during the discussion, read the Guide to deletion. |
In mathematics and quantum optics, Bessel moment polynomials are a family of polynomials that express the even moments of squared Bessel functions of the first kind. These polynomials arise naturally when computing number-operator moments and statistical properties, such as the Mandel Q parameter, for nonlinear coherent states.
Unlike odd moments, which yield combinations of Bessel functions, the even moments evaluate precisely to finite polynomial expressions in <math>u=x^2</math>. The first odd moments are
<math> \sum_{k=0}^{\infty}k\,J_k^2(2x)=2x^2\bigl[J_0^2(2x)+J_1^2(2x)\bigr]-xJ_0(2x)J_1(2x). </math>
and
<math> \sum_{k=0}^{\infty}k^{3}\,J_k^2(2x) =x^2\Bigl[(6x^2+1)J_0^2(2x)-2xJ_0(2x)J_1(2x)+(6x^2-1)J_1^2(2x)\Bigr] +\frac{2x^4}{3}\Bigl[J_0(2x)J_2(2x)+J_1(2x)J_3(2x)\Bigr].</math>
It is difficult—and often impossible—to find semi-infinite sums of Bessel functions in the literature[1]. Bessel moment polynomials provide analytic closed-form relations for such sums.
Definition
For a positive integer <math>n \ge 1</math>, the <math>n</math>-th Bessel moment polynomial <math>p_n(u)</math> is defined by the discrete sum of the squared Bessel functions of the first kind, <math>J_k(2x)</math>: <math>\mathcal{P}_n(x)=\sum_{k=0}^{\infty} k^{2n} J_k^2(2x)=p_n(u),\quad \text{where } u=x^2.</math>
Each <math>p_n(u)</math> is a polynomial in <math>u</math> of degree <math>n</math> with positive rational coefficients:[2]
<math>p_n(u)=\sum_{m=1}^{n} a_{n,m} u^m.</math>
First polynomials
The first few Bessel moment polynomials are:
- <math>p_1(u)=u</math>
- <math>p_2(u)=3u^2+u</math>
- <math>p_3(u)=10u^3+15u^2+u</math>
- <math>p_4(u)=35u^4+140u^3+63u^2+u</math>
- <math>p_5(u)=126u^5+1050u^4+1470u^3+255u^2+u</math>
Explicit coefficient formula
The coefficients <math>a_{n,m}</math> for <math>1 \le m \le n</math> are given explicitly by the finite alternating sum:
<math>a_{n,m}=\frac{1}{(m!)^2}\sum_{j=0}^{m-1}(-1)^j \binom{2m}{j}(m-j)^{2n}.</math>
For <math>m>n</math>, <math>a_{n,m}=0</math>.
Specific coefficients
- Leading coefficient: the highest-degree coefficient <math>a_{n,n}</math> is one-half of the <math>n</math>-th central binomial coefficient:
<math>a_{n,n}=\frac12 \binom{2n}{n}.</math>
- Linear coefficient: the coefficient of <math>u^1</math> is always unity:
<math>a_{n,1}=1\quad \text{for all } n \ge 1.</math>
- Second term: for <math>n \ge 2</math>, the sub-leading coefficient <math>a_{n,2}</math> satisfies:
<math>a_{n,2}=4^{n-1}-1.</math>
Table of coefficients
The coefficient matrix <math>a_{n,m}</math> for <math>1 \le n,m \le 5</math>:
| <math>n\setminus m</math> | 1 | 2 | 3 | 4 | 5 |
|---|---|---|---|---|---|
| 1 | 1 | — | — | — | — |
| 2 | 1 | 3 | — | — | — |
| 3 | 1 | 15 | 10 | — | — |
| 4 | 1 | 63 | 140 | 35 | — |
| 5 | 1 | 255 | 1470 | 1050 | 126 |
Properties
Differential recurrence relation
The sequence of polynomials satisfies a three-term differential-integral recurrence relation linking <math>p_{n+1}(u)</math> to <math>p_n(u)</math>: <math>p_{n+1}(u)=\left(u\frac{d}{du}\right)^2 p_n(u)+4u\,p_n(u)-2\int_0^u p_n(t)\,dt,</math>
with initial condition <math>p_1(u)=u</math>.
Generating function representation
The polynomial evaluation can be derived using the Jacobi–Anger-type identity for squared Bessel functions:
<math>\sum_{k=-\infty}^{\infty} J_k^2(2x)e^{iky}=J_0\left(4x\sin\frac{y}{2}\right).</math>
Differentiating <math>2n</math> times with respect to <math>y</math> at <math>y=0</math> yields the compact derivative form:
<math>p_n(x^2)=\frac{(-1)^n}{2}\left.\frac{d^{2n}}{dy^{2n}}J_0\left(4x\sin\frac{y}{2}\right)\right|_{y=0}.</math>
Applications
Bessel moment polynomials are applied in quantum optics and optical physics:[2]
- Quantum statistics: calculating higher-order photon-number moments and Mandel Q-parameters for nonlinear coherent states generated by Susskind–Glogower phase operators.
- Waveguide lattices: characterizing intensity dynamics and mode distributions in array couplers and photonic lattices governed by discrete Schrödinger-like equations.