Pseudo-Polynomial Time Algorithm for Computing Moments of Polynomials in Free Semicircular Elements

January 24, 2019 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Rei Mizuta arXiv ID 1901.08210 Category math.OA Cross-listed cs.DS, math.PR Citations 0 Venue arXiv.org Last Checked 3 months ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” math.OA

Died the same way β€” πŸ‘» Ghosted