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

推荐订阅源

F
Fortinet All Blogs
爱范儿
爱范儿
V
Visual Studio Blog
Engineering at Meta
Engineering at Meta
B
Blog
云风的 BLOG
云风的 BLOG
G
Google Developers Blog
MongoDB | Blog
MongoDB | Blog
博客园 - Franky
U
Unit 42
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
WordPress大学
WordPress大学
D
DataBreaches.Net
B
Blog RSS Feed
小众软件
小众软件
人人都是产品经理
人人都是产品经理
I
InfoQ
P
Proofpoint News Feed
博客园 - 聂微东
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
J
Java Code Geeks
The GitHub Blog
The GitHub Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
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.CO 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)