Abstract

We propose a deterministic polynomial time algorithm to find a splitting element in a given central simple algebra over an algebraic number field. This enables us to give deterministic polynomial time methods for some problems of algorithmic representation theory, where formerly only randomized (Las Vegas) methods were available, including the problem of decomposition of simple algebras over R and C.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call