Pseudo-Polynomial Time Algorithm for Computing Moments of Polynomials in Free Semicircular Elements
January 24, 2019 Β· Declared Dead Β· π arXiv.org
"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 Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β math.OA
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Noncommutative versions of inequalities in quantum information theory
R.I.P.
π»
Ghosted
Unitary orthonormal bases of finite dimensional inclusions
R.I.P.
π»
Ghosted
Signal communication and modular theory
R.I.P.
π»
Ghosted
Quantum information theory and Fourier multipliers on quantum groups
R.I.P.
π»
Ghosted
Phase Group Categories of Bimodule Quantum Channels
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted