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 ...

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 ...

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 ...

Consider a finite dimensional H-module Lie algebra L over a field of characteristic 0 where H is a Hopf algebra. We prove the analog of Amitsur's conjecture on asymptotic behaviour for codimensions of ...