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 ...
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 ...
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 ...
Filomat, Vol. 30, No. 7, The 22nd International Conference on Finite and Infinite Dimensional Complex Analysis and Applications (2016), pp. 1757-1765 (9 pages ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback