Algorithmic properties of maximal orders in simple algebras over \(\mathbb{Q}\) (Q2366169): Difference between revisions

Improving a previous investigation, the author shows that the problem of deciding whether the index of a central simple algebra \(A\) over an algebraic number field \(K\) is equal to a given number \(d\), belongs to the complexity class \(\text{NP}\cap\text{co NP}\). In particular, to decide whether \(A\) is a skew-field, or a matrix algebra, belongs to this complexity class. The results extend an algorithm of Huang to factorize primes in \(K\), and a test of Zassenhaus for local maximality of orders in \(K\).