Algorithms for polynomial computation over finite fields form a crucial domain in computational mathematics, with extensive applications ranging from cryptography and ...

In this article we consider matrix factorizations of a polynomial where the two matrices appearing in the factorization are the same, which we call "matrix square roots." The main result is that any ...

If you're enjoying this article, consider supporting our award-winning journalism by subscribing. By purchasing a subscription you are helping to ensure the future of impactful stories about the ...

Hilbert’s 12th problem asked for novel analogues of the roots of unity, the building blocks for certain number systems. Now, over 100 years later, two mathematicians have produced them. Problems in ...

Van der Waerden’s conjecture mystified mathematicians for 85 years. Its solution shows how polynomial roots relate to one another. The equation x 2 – 5 = 0 is a bit trickier. The polynomial can’t be ...