Monoidal Alphabets for Generalized Harmonic Sums
Jayanta Phadikar

TL;DR
This paper introduces a unified algebraic framework using monoidal alphabets to systematically analyze and generate identities for various classes of Euler-type sums and harmonic numbers.
Contribution
It develops a general finite-alphabet monoidal framework that encompasses classical and generalized harmonic sums, enabling systematic reduction and identity derivation.
Findings
Framework recovers many known Euler-sum identities.
Framework produces new identities in a uniform manner.
Nested sums reduce to finite harmonic-number objects under the framework.
Abstract
We develop a general finite-alphabet framework for Euler-type sums based on the notion of a monoidal alphabet. An alphabet of summand letters is called monoidal when it is closed under pointwise multiplication, thereby inducing the usual stuffle, or quasi-shuffle, algebra on the associated nested sums. This viewpoint places classical multiple harmonic numbers, colored harmonic sums, and several generalized Euler sums under a common structural mechanism. We focus on three fundamental families of monoidal alphabets: the ordinary power alphabet generated by , the affine alphabet generated by linear factors , and the polynomial-base alphabet generated by polynomial factors . The resulting classes of multiple harmonic numbers, multiple affine harmonic numbers, and multiple polynomial-base harmonic numbers provide systematic containers for a wide range of finite and infinite…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
