Pseudo-Polynomial Time Algorithm for Computing Moments of Polynomials in Free Semicircular Elements
Abstract
We consider about calculating Mth moments of a given polynomial in free independent semicircular elements in free probability theory. By a naive approach, this calculation requires exponential time with respect to M. We explicitly give an algorithm for calculating them in polynomial time by rearranging Sch\"utzenberger's algorithm.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.