Pseudo-Polynomial Time Algorithm for Computing Moments of Polynomials in Free Semicircular Elements
Pseudo-Polynomial Time Algorithm for Computing Moments of Polynomials in Free Semicircular Elements
We consider about calculating $M$th 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��tzenberger's algorithm.
10 pages
FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Probability (math.PR), Mathematics - Operator Algebras, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Operator Algebras (math.OA), Mathematics - Probability
FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Probability (math.PR), Mathematics - Operator Algebras, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Operator Algebras (math.OA), Mathematics - Probability
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!