Bessel Generating Functions
- Bessel generating functions are analytic series that encapsulate classical, discrete, and deformed Bessel families, enabling unified expansions and orthogonality relations.
- They employ D-module structures and q-analog techniques to derive transmutation, raising/lowering formulas, and addition theorems with tangible combinatorial insights.
- Applications span random matrix theory, integrable systems, and probability, providing a framework for both continuous and discrete models in harmonic analysis.
Bessel generating functions serve as a unifying analytic and algebraic tool for studying classical, discrete, deformed, and q-analog Bessel families, underpinning expansions, addition formulas, orthogonality, and transforms central to harmonic analysis and special function theory. They encode both structural and combinatorial information, finding applications in random matrix theory, combinatorics, integrable systems, and probability.
1. Classical Bessel Generating Functions
The archetypal generating function is the bilateral expansion
realized as the unique holomorphic solution of a holonomic system arising from a Weyl algebra quotient ("Bessel module") (Chiang et al., 2023). For arbitrary order ,
where the equivalence denotes Borel resummation in non-integer order. The generating kernel can be interpreted as the image of a D-linear intertwiner mapping a cyclic vector in the module to elementary functions, with explicit transmutation (raising/lowering) formulas producing contiguous relations. Analogous forms exist for , , and : Integral representations—e.g., the Schl\"afli–Sonine formula
arise naturally from the module structure and underpin inversion and orthogonality (Chiang et al., 2023).
2. Discrete, Difference, and -Analog Generating Functions
Discrete Bessel functions are constructed by discretizing the classical generating function via a sum over equispaced angles,
yielding -point transforms that closely approximate for and preserve discrete analogues of linear and quadratic identities (e.g., Graf's addition theorem) (Uriostegui et al., 2020).
The -analogues, most notably the Hahn–Exton -Bessel functions,
yield combinatorial generating functions for skew shapes as ratios , which are rational in with positive coefficients (Kim et al., 2020). The bounded-diagonal case is refined via -Lommel polynomials, and continued fraction expansions are connected to moments of both type and standard orthogonal polynomials, analyzed via the Flajolet–Viennot theory.
Difference Bessel generating functions are obtained from delay-difference realizations of the Bessel module,
with analogous integral and recurrence structure (Chiang et al., 2023).
3. Generalizations: Higher Bessel and Deformed Generating Functions
The higher Bessel ("-Bessel") generating function
arises as the unique solution of and admits both power-series and multi-contour integral representations. Product formulas introduce a mixing kernel
interpreted as the period of a Landau–Ginzburg hypersurface and related to Buchstaber–Rees polynomials, which define -valued group laws (Gaiur et al., 5 May 2024).
Deformed generating functions under Dunkl operator calculus yield, e.g.,
where is the deformed exponential sum, and Poisson-type kernels lead to further confluent hypergeometric deformations, recovering the classical case as (Zahaf et al., 2012).
4. Bessel Polynomial and Associated Function Generating Functions
Generating functions for Bessel polynomials and associated Bessel functions permit multiple structural forms:
- The standard Bessel-polynomial generating function:
- Multiple-sum (multinomial) identities relating products of Bessel polynomials to sums over their arguments; probabilistic approaches use the generalized inverse Gaussian law to obtain moment representations and collapse multinomial expansions (Lévêque et al., 2012).
- Associated Bessel functions, with three distinct exponential generating functions adapted to the symmetries and reducibilities of their two-parameter indices, can each be given by explicit exponential/radical or contour-integral form—recovering standard polynomial and Laguerre generating functions in special cases (Fakhri et al., 2012).
5. Generating Functions in Probability, Random Matrices, and Integrable Systems
The Bessel point process, a determinantal process with kernel
admits a joint probability generating function over intervals as a Fredholm determinant: which is equivalently the tau function for a system of coupled Painlevé V equations, derived via a Riemann–Hilbert Lax pair construction. This formalism underpins probability generating functions for gap probabilities, particle ratios, and large- Hankel determinant asymptotics near the hard edge of random matrices (Charlier et al., 2017).
6. Algebraic, Combinatorial, and D-module Foundations
The algebraic structure of holonomic D-modules (quotients of the Weyl algebra by Bessel operators) determines the existence, form, and uniqueness of Bessel generating functions. Transmutation and intertwining operators encode contiguous and ladder relations, unifying a broad swath of generating functions from classical to difference and deformed types (Chiang et al., 2023). Product formulas for higher Bessel generating functions are intimately related to periods of algebraic hypersurfaces and generalized Frobenius expansions, with conjectured unimodality and real-rootedness of associated palindromic polynomials (Gaiur et al., 5 May 2024).
In combinatorics, q-Bessel and -Lommel generating functions enumerate connected skew shapes and are central in continued fraction expansions interpreted via weighted Motzkin paths, using orthogonal polynomial and lattice path methods (Kim et al., 2020).
7. Recurrence Relations, Bell Polynomials, and Umbral Formalism
Powers of Bessel and modified Bessel functions generate families of polynomials , whose exponential generating functions are . Explicit expressions via Bell polynomials and the Bessel zeta function
enable combinatorial and asymptotic enumeration, while recurrences are interpreted probabilistically via moment expansions of the symmetric beta distribution. The Cholewinski umbral formalism reveals binomial-type convolution properties for these polynomial families (Moll et al., 2013).
Key references:
- Discrete and transform-based structure (Uriostegui et al., 2020)
- D-module unification (Chiang et al., 2023)
- Higher order/group law connections (Gaiur et al., 5 May 2024)
- -analogs and combinatorics (Kim et al., 2020)
- Probabilistic and polynomial expansions (Moll et al., 2013, Lévêque et al., 2012)
- Associated functions (Fakhri et al., 2012)
- Deformed/difference families (Zahaf et al., 2012)
- Applications in random matrix theory/Painlevé integrability (Charlier et al., 2017)