Chebyshev polynomials, a central class of orthogonal polynomials, have long been pivotal in numerical analysis, approximation theory and the solution of differential equations. Their inherent ...

Arithmetic circuit complexity investigates the computational resources required to evaluate polynomial functions via networks of arithmetic operations. At its core, this field seeks to classify ...

We prove that if A is an algebra over a field with at least k elements, and A satisfies xk = 0, then An, the ring of n-by-n matrices over A, satisfies xq = 0, where q = kn2 + 1. Theorem 1.3 ...

This monthly journal, begun in 1950, is devoted entirely to research in pure and applied mathematics, principally to the publication of original papers of moderate length. A section called Shorter ...