pith. sign in

arxiv: math/9808040 · v2 · submitted 1998-08-09 · 🧮 math.CO · math-ph· math.FA· math.MP· quant-ph

Polynomial Sequences of Binomial Type and Path Integrals

classification 🧮 math.CO math-phmath.FAmath.MPquant-ph
keywords typebinomialpathpolynomialquantumcalculuscombinatoricsenumerative
0
0 comments X
read the original abstract

Polynomial sequences $p_n(x)$ of binomial type are a principal tool in the umbral calculus of enumerative combinatorics. We express $p_n(x)$ as a \emph{path integral} in the ``phase space'' $\Space{N}{} \times {[-\pi,\pi]}$. The Hamiltonian is $h(\phi)=\sum_{n=0}^\infty p_n'(0)/n! e^{in\phi}$ and it produces a Schr\"odinger type equation for $p_n(x)$. This establishes a bridge between enumerative combinatorics and quantum field theory. It also provides an algorithm for parallel quantum computations. Keywords: Feynman path integral, umbral calculus, polynomial sequence of binomial type, token, Schr\"odinger equation, propagator, wave function, cumulants, quantum computation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.