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

The Monthly publishes articles, as well as notes and other features, about mathematics and the profession. Its readers span a broad spectrum of mathematical interests, and include professional ...

Vesselin Dimitrov’s proof of the Schinzel-Zassenhaus conjecture quantifies the way special values of polynomials push each other apart. In the physical world, objects often push each other apart in an ...

Number theoretic transform (NTT) is widely recognized as the most efficient method for computing polynomial multiplication with high dimension and integral coefficients, due to its quasilinear ...

We prove that if $f(x)=\sum _{k=0}^{n-1}a_{k}x^{k}$ is a polynomial with no cyclotomic factors whose coefficients satisfy $a_{k}$ ≡ 1 mod 2 for 0 ≤ k < n, then ...