2000 character limit reached
Form Sequences to Polynomials and Back, via Operator Orderings
Published 26 Mar 2013 in math-ph and math.MP | (1303.6587v1)
Abstract: C.M. Bender and G. V. Dunne showed that linear combinations of words $q{k}p{n}q{n-k}$, where $p$ and $q$ are subject to the relation $qp - pq = \imath$, may be expressed as a polynomial in the symbol $z = \tfrac{1}{2}(qp+pq)$. Relations between such polynomials and linear combinations of the transformed coefficients are explored. In particular, examples yielding orthogonal polynomials are provided.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.