This is a preview. Log in through your library . Abstract The subject of this paper are polynomials in multiple non-commuting variables. For polynomials of this type orthogonal with respect to a state ...

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

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