Algorithmic complexity, a cornerstone of theoretical computer science, examines the intrinsic resource requirements of computational problems and the limits of what can be efficiently computed. Within ...

In an isomorphic copy of the ring of symmetric polynomials we study some families of polynomials which are indexed by rational weight vectors. These families include well known symmetric polynomials, ...

A characterization is presented of the class of stationary processes that have polynomial covariance functions of degree less than or equal to 4 on an interval. The results extend to isotropic random ...