惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

人人都是产品经理
人人都是产品经理
aimingoo的专栏
aimingoo的专栏
Y
Y Combinator Blog
B
Blog
D
Docker
C
Check Point Blog
A
About on SuperTechFans
云风的 BLOG
云风的 BLOG
F
Fortinet All Blogs
Stack Overflow Blog
Stack Overflow Blog
Recent Announcements
Recent Announcements
MongoDB | Blog
MongoDB | Blog
WordPress大学
WordPress大学
Jina AI
Jina AI
罗磊的独立博客
月光博客
月光博客
博客园 - Franky
L
LangChain Blog
H
Help Net Security
Google DeepMind News
Google DeepMind News
Microsoft Security Blog
Microsoft Security Blog
小众软件
小众软件
T
Tailwind CSS Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Signed Generalized Stirling Polynomials, Nested Sums, and...
[Submitted on 26 May 2026 (v1), last revised 6 Sep 2026 (this ve · 2026-05-26 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:We begin with the observation that the signed generalized Stirling polynomials $P_k(m,x)$, which occur in a generalization of Malmsten's integral, reduce to the falling factorials when $k=m$. The structure of these generalized Stirling polynomials is then used to obtain recurrence relations, gamma--polygamma formulas for the polynomials $P_{m-s}(m,x)$, a more transparent proof of a vanishing identity used in earlier closed forms, and a finite approximation to $\cosh \pi x$ with a corresponding limit formula for $\pi$. We also observe that these polynomials occur naturally as signed residues of the equal-period Barnes multiple zeta function, namely $P_k(m,x)=(-1)^k m!\operatorname*{Res}_{s=m+1-k}\zeta_{m+1}(s,x)$. In addition, we derive the reflection formula $P_k(m,m+1-x)=(-1)^kP_k(m,x)$, use it to obtain finite parity-cancellation relations, and compare the resulting centered product polynomials with a classical Meixner--Pollaczek orthogonal family. These polynomial identities also yield explicit identities for Stirling cycle numbers. We then turn to finite nested sums built from the hyperbolic-secant integral sequence $\chi_n$. After the lower bounds are fixed, the nested sums become coefficient-counting problems: the common-lower-bound case gives binomial coefficients, while the staircase case gives Catalan numbers. Combining these counts with the closed forms for the individual $\chi_j$'s produces explicit evaluations involving Catalan's constant, zeta values, and polygamma values at one quarter. A Wolfram Language package accompanies the formulas.

Submission history

From: Abdulhafeez Abdulsalam Ayinde [view email]
[v1] Tue, 26 May 2026 11:00:23 UTC (18 KB)
[v2] Thu, 28 May 2026 07:13:16 UTC (19 KB)
[v3] Sun, 31 May 2026 11:49:32 UTC (21 KB)
[v4] Sun, 6 Sep 2026 22:41:16 UTC (25 KB)