arXiv subjects

Junior Michel

Publications and source records attributed to Junior Michel.

3 recordsLinked to original sources

arXiv2026

Mehler--Heine asymptotics for finite differences of mass-modified Charlier and Meixner polynomials

Point-mass perturbations and finite-difference operations alter the finite-degree structure of discrete orthogonal polynomials, but their combined effect at the Mehler--Heine scale is not immediate. We study the monic Charlier and Meixner families under a pure Uvarov modification by a fixed mass $A\delta_{0}$ at the endpoint of the support and determine the asymptotic behaviour of their forward and backward differences of arbitrary fixed order. Using a rank-one connection formula, we show that the perturbation coefficient decays factorially in the Charlier case and exponentially, with an algebraic prefactor, in the Meixner case. In both families this decay is faster than every algebraic power of $n^{-1}$ and therefore suppresses the growth produced by any fixed number of finite differences. Consequently, for every fixed $A\geq0$ and $k\in\Nzero$, the mass-modified and classical families have the same locally uniform Mehler--Heine limits in $\C$. Forward differences preserve the reciprocal-Gamma profile up to the factor $(-1)^k$, whereas backward differences translate the limiting argument by $k$, shifting the limiting zero lattice from $\Nzero$ to $k+\Nzero$. We also derive a first-order shift equation for the common forward limit and characterize its entire solution space. Complex-plane portraits and real-axis computations illustrate the predicted limiting profiles, the two zero lattices, and the asymptotic disappearance of the fixed endpoint mass. These results identify a scale-separation mechanism governing the fixed-order asymptotic stability of the Charlier and Meixner families under rank-one endpoint perturbations.

math.CA↗

arXiv2026

ADPSO-ERLS: A Hybrid Discrete PSO with Enhanced Local Search for the Traveling Salesman Problem

The Traveling Salesman Problem is a canonical setting for studying how a population-based method should allocate a fixed search budget between exploration and progressively stronger local intensification. We propose ADPSO-ERLS, a discrete swarm algorithm that treats this allocation as an explicit, tunable design variable. It couples memory-guided swap mutation, heterogeneous initialization, selective candidate-restricted 2-opt during evolution, and an incumbent-only final refinement combining candidate-restricted and optional full 2-opt with double-bridge perturbations. The method is PSO-inspired, using personal and global memories yet dispensing with velocity, inertia, and acceleration coefficients. All six algorithms are implemented in Rust, run on identical hardware, and stopped at a strict, recorded limit of 100,000 candidate-solution assessments, so that programming language, hardware, and evaluation budget are held common across methods; wall-clock time is reported separately because equal assessment counts need not correspond to equal arithmetic work. Over 50 runs on five symmetric TSPLIB instances under the integer \texttt{EUC\_2D} convention, ADPSO-ERLS attains the lowest best and mean cost on every instance, with best-tour Gap of $1.93$--$4.17\%$ and relative error of $3.04$--$5.50\%$. It ranks first under the Friedman test, and all twenty-five multiplicity-controlled Wilcoxon comparisons favor it with large, near-complete distributional separation. A paired ablation with common seeds links initialization, in-run local search, and final refinement to quality gains, while candidate restriction chiefly cuts runtime, by up to a factor of roughly $38$. Further experiments up to $16{,}862$ cities keep best-tour Gaps below $6.7\%$, solving the largest case in under eleven minutes.

math.OC↗

arXiv2026

On generating functions and Mehler--Heine formulas for discrete Charlier and Meixner Sobolev-type orthogonal polynomials

Generating functions are among the most important analytical tools in the theory of orthogonal polynomials, providing a unified framework for deriving structural identities, asymptotic expansions, and zero distributions. However, despite the extensive development of discrete Sobolev orthogonal polynomials, no general generating-function theory has been available for the Sobolev-type Charlier and Meixner families associated with arbitrary-order forward differences $j\geq 1$ and an exterior mass point $\alpha<0$. In this paper, we develop the first unified generating-function framework for these families. Starting from explicit connection formulas, we derive generating functions for the Sobolev-type polynomials and their iterated forward differences, which serve as the main analytical tool for establishing new Mehler--Heine formulas. The resulting asymptotic analysis shows that an exterior Sobolev perturbation generates exactly one exceptional zero converging to the mass point, while the remaining zeros preserve the classical asymptotic distribution. Moreover, the limiting Mehler--Heine functions are independent of both the Sobolev mass parameter and the order of the forward difference operator, revealing a universality phenomenon for higher-order discrete Sobolev perturbations. These results considerably extend the analytical theory of discrete Sobolev orthogonal polynomials and establish a direct connection between generating functions, Mehler--Heine asymptotics, and the asymptotic distribution of the zeros for the discrete Sobolev-type Charlier and Meixner families.

math.CA↗