Dirichlet polynomials and entropy
David I. Spivak, Timothy Hosgood

TL;DR
This paper explores the relationship between Dirichlet polynomials, entropy, and a geometric interpretation, establishing a formula connecting entropy with a rectangle-based measure derived from a homomorphism.
Contribution
It introduces a novel homomorphism from Dirichlet polynomials to a rectangle rig, linking entropy to geometric measures and providing a new perspective on entropy calculation.
Findings
The rectangle-area formula $A(d)=L(d)W(d)$ holds for all Dirichlet polynomials.
Entropy of a Dirichlet polynomial can be computed using the homomorphism $h$.
Similar results are established for cross entropy.
Abstract
A Dirichlet polynomial in one variable is a function of the form for some . We will show how to think of a Dirichlet polynomial as a set-theoretic bundle, and thus as an empirical distribution. We can then consider the Shannon entropy of the corresponding probability distribution, and we define its length (or, classically, its perplexity) by . On the other hand, we will define a rig homomorphism from the rig of Dirichlet polynomials to the so-called rectangle rig, whose underlying set is and whose additive structure involves the weighted geometric mean; we write , and call the two components area and width…
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.
