Regularization of Divergent Power Sums via Fractional Extension of Differential Generators

• URL: http://arxiv.org/abs/2604.23544v2
• Date: Mon, 04 May 2026 04:07:43 GMT
• Title: Regularization of Divergent Power Sums via Fractional Extension of Differential Generators
• Abstract summary: We consider the regularization of the divergent sum $sum_n=1inftynm$ for every non-negative integer $m$.<n>The extension of the sum for non-integer $$ is obtained under the consistency condition that the regularized sum for integer $m$ emerges continuously from the sum for non-integer $$.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We reconsider the problem of regularizing the divergent series $\sum_{n=1}^{\infty}n^α$ for $\operatorname{Re}α>-1$, and offer a regularization prescription that yields the Riemann zeta regularization as a special case. The development of the regularization is framed as a two-step problem. The first step is prescribing a regularization of the divergent sum $\sum_{n=1}^{\infty}n^m$ for every non-negative integer $m$; and the second step is the extension of the sum for non-integer $α$. The extension is obtained under the consistency condition that the regularized sum for integer $m$ emerges continuously from the sum for non-integer $α$. The scheme is specified by a differential generator $L=L(\mathrm{d}/\mathrm{d}t)$ through which a generalized spectral function (GSF), $K_L(t)$, is constructed. Under the condition that the GSF has a holomorphic complex extension $K_L(z)$ with $z=0$ as a pole, the case for integer $m$ takes the regularized value $\sum_{n=1}^{\infty} n^m = (2πi)^{-1}\oint_C L^m K_L(z) z^{-1}\mathrm{d}z$, where $C$ is a closed contour enclosing only the pole of $K_L(z)$ at the origin. On the other hand, under the consistency condition, the case for non-integer $α$ takes the value $\sum_{n=1}^{\infty}n^α=(2πi)^{-1}\int_{\tilde{C}} L^α K_L(z) z^{-1}\mathrm{d}z$, where $L^α$ is the fractional extension of $L^m$ and $\tilde{C}$ is an appropriate deformation of the contour $C$. Here, we obtain the regularization corresponding to the generator $L=h(t) \mathrm{d}/\mathrm{d}t$, with $h(t)$ positive for all $t>0$, monotonically non-increasing, and admitting complex extension $h(z)$ such that $1/h(z)$ is entire. We find that the regularized sum is equal to the Riemann zeta regularized value plus terms determined by the generator $L$.

Related papers

• Quantum Change Interval: Exact Asymptotics for Minimum Error Localization [8.906035369693457]
  We study a returning quantum change interval in which a source emits $lvertrangle$ over one interval and $lvert0rangle$ elsewhere.<n>We analyze the matrix using Toeplitz comparison and Flner transfer, together with an exact decomposition by excitation number and interval hull.
  arXiv  Detail & Related papers  (2026-08-25T13:30:26Z)
• Exact Moments of Gaussian Gram Hafnians Reveal an $n^2/\log n$ Threshold for Weak Anticoncentration [2.8224889996383395]
  Anticoncentration is central to hardness arguments for approximate sampling.<n> finite dimensional Haar moment transfer and high probability small ball anticoncentration remain separate problems.
  arXiv  Detail & Related papers  (2026-08-17T19:12:22Z)
• Rényi exponent landscape of multipartite entanglement in free-fermion systems [51.56484100374058]
  We show that the Rényi tripartite information $I_3() exhibits a qualitatively $exclusion-dependent scaling at small Fermi momentum.<n>A direct consequence is a replica obstruction: $I_m(n)/I_m(1) sim zm-1 to 0$ for all integer $n geq 2$, so the leading von Neumann signal cannot be reconstructed from integer Rényi data.
  arXiv  Detail & Related papers  (2026-03-09T22:27:00Z)
• Polynomials and asymptotic constants in a resurgent problem from 't Hooft [0.0]
  Given $G(z)=sum_n=1inftysqrtn,zn$ for $|z|1$, find its analytic continuation for $|z|ge1$, excluding a branch-cut $zin[1,,infty)$.<n>A solution is provided by the bilateral convergent sum $G(z)=frac12sqrtpisum_n=inftyinfty (2pirm in-log(z))-3/2
  arXiv  Detail & Related papers  (2025-09-30T14:12:31Z)
• Approximating the operator norm of local Hamiltonians via few quantum states [53.16156504455106]
  Consider a Hermitian operator $A$ acting on a complex Hilbert space of $2n$.<n>We show that when $A$ has small degree in the Pauli expansion, or in other words, $A$ is a local $n$-qubit Hamiltonian.<n>We show that whenever $A$ is $d$-local, textiti.e., $deg(A)le d$, we have the following discretization-type inequality.
  arXiv  Detail & Related papers  (2025-09-15T14:26:11Z)
• Near-Optimal Convergence of Accelerated Gradient Methods under Generalized and $(L_0, L_1)$-Smoothness [57.93371273485736]
  We study first-order methods for convex optimization problems with functions $f$ satisfying the recently proposed $ell$-smoothness condition $||nabla2f(x)|| le ellleft(||nabla f(x)||right),$ which generalizes the $L$-smoothness and $(L_0,L_1)$-smoothness.
  arXiv  Detail & Related papers  (2025-08-09T08:28:06Z)
• The Communication Complexity of Approximating Matrix Rank [50.6867896228563]
  We show that this problem has randomized communication complexity $Omega(frac1kcdot n2log|mathbbF|)$. As an application, we obtain an $Omega(frac1kcdot n2log|mathbbF|)$ space lower bound for any streaming algorithm with $k$ passes.
  arXiv  Detail & Related papers  (2024-10-26T06:21:42Z)
• $\ell_p$-Regression in the Arbitrary Partition Model of Communication [59.89387020011663]
  We consider the randomized communication complexity of the distributed $ell_p$-regression problem in the coordinator model. For $p = 2$, i.e., least squares regression, we give the first optimal bound of $tildeTheta(sd2 + sd/epsilon)$ bits. For $p in (1,2)$,we obtain an $tildeO(sd2/epsilon + sd/mathrmpoly(epsilon)$ upper bound.
  arXiv  Detail & Related papers  (2023-07-11T08:51:53Z)
• Low-degree learning and the metric entropy of polynomials [44.99833362998488]
  We prove that any (deterministic or randomized) algorithm which learns $mathscrF_nd$ with $L$-accuracy $varepsilon$ requires at least $Omega(sqrtvarepsilon)2dlog n leq log mathsfM(mathscrF_n,d,|cdot|_L,varepsilon) satisfies the two-sided estimate $$c (1-varepsilon)2dlog
  arXiv  Detail & Related papers  (2022-03-17T23:52:08Z)
• Low-Rank Approximation with $1/\epsilon^{1/3}$ Matrix-Vector Products [58.05771390012827]
  We study iterative methods based on Krylov subspaces for low-rank approximation under any Schatten-$p$ norm. Our main result is an algorithm that uses only $tildeO(k/sqrtepsilon)$ matrix-vector products.
  arXiv  Detail & Related papers  (2022-02-10T16:10:41Z)
• Computational Complexity of Normalizing Constants for the Product of Determinantal Point Processes [12.640283469603357]
  We study the computational complexity of computing the normalizing constant. We show that $sum_Sdet(bf A_S,S)p$ exactly for every (fixed) positive even integer $p$ is UP-hard and Mod$_3$P-hard.
  arXiv  Detail & Related papers  (2021-11-28T14:08:25Z)
• The planted matching problem: Sharp threshold and infinite-order phase transition [25.41713098167692]
  We study the problem of reconstructing a perfect matching $M*$ hidden in a randomly weighted $ntimes n$ bipartite graph. We show that if $sqrtd B(mathcalP,mathcalQ) ge 1+epsilon$ for an arbitrarily small constant $epsilon>0$, the reconstruction error for any estimator is shown to be bounded away from $0$.
  arXiv  Detail & Related papers  (2021-03-17T00:59:33Z)
• Convergence Rate of the (1+1)-Evolution Strategy with Success-Based Step-Size Adaptation on Convex Quadratic Functions [20.666734673282498]
  The (1+1)-evolution strategy (ES) with success-based step-size adaptation is analyzed on a general convex quadratic function. The convergence rate of the (1+1)-ES is derived explicitly and rigorously on a general convex quadratic function.
  arXiv  Detail & Related papers  (2021-03-02T09:03:44Z)
• On the self-adjointness of H+A*+A [0.0]
  We build self-adjoint realizations $hat H$ of the formal Hamiltonian $H+A*+A$ with $D(hat H)cap D(hat H)=0$. We consider the problem of the description of $hat H$ as a (norm resolvent) limit of sequences of the kind $H+A*_n+A_n+E_n$.
  arXiv  Detail & Related papers  (2020-03-11T16:57:52Z)
• On the Complexity of Minimizing Convex Finite Sums Without Using the Indices of the Individual Functions [62.01594253618911]
  We exploit the finite noise structure of finite sums to derive a matching $O(n2)$-upper bound under the global oracle model. Following a similar approach, we propose a novel adaptation of SVRG which is both emphcompatible with oracles, and achieves complexity bounds of $tildeO(n2+nsqrtL/mu)log (1/epsilon)$ and $O(nsqrtL/epsilon)$, for $mu>0$ and $mu=0$
  arXiv  Detail & Related papers  (2020-02-09T03:39:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.