New perspectives on exponentiated derivations, the formal Taylor theorem, and Fa\`a di Bruno's formula
Thomas J. Robinson

TL;DR
This paper explores a new perspective on formal calculus used in vertex algebras, emphasizing the role of formal translation operators and their extensions, connecting to Faà di Bruno's formula and umbral calculus.
Contribution
It introduces a viewpoint that simplifies extensions of formal calculus, facilitating the inclusion of logarithmic and iterated-logarithm objects, and links to classical combinatorial formulas.
Findings
Formal translation operator approach simplifies extensions of formal calculus.
Connections established between formal calculus, Faà di Bruno's formula, and umbral calculus.
Extensions include logarithmic and iterated-logarithm objects in formal calculus.
Abstract
We discuss certain aspects of the formal calculus used to describe vertex algebras. In the standard literature on formal calculus, the expression , where is not necessarily a nonnegative integer, is defined as the formal Taylor series given by the binomial series in nonnegative powers of the second-listed variable (namely, ). We present a viewpoint that for some purposes of generalization of the formal calculus including and beyond "logarithmic formal calculus", it seems useful, using the formal Taylor theorem as a guide, to instead take as the definition of the formal series which is the result of acting on by a formal translation operator, a certain exponentiated derivation. These differing approaches are equivalent, and in the standard generality of formal calculus or logarithmic formal calculus there is no reason to prefer one approach over the…
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.
Taxonomy
TopicsPolynomial and algebraic computation · Mathematics and Applications · Logic, programming, and type systems
