𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A matriceal analogue of Fejer's theory

✍ Scribed by Sorina Barza; Lars-Erik Persson; Nicolae Popa


Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
126 KB
Volume
260
Category
Article
ISSN
0025-584X

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

J. Arazy [1] pointed out that there is a similarity between functions defined on the torus and infinite matrices. In this paper we discuss and develop in the framework of matrices Fejer's theory for Fourier series.


πŸ“œ SIMILAR VOLUMES


A matricial analogue of Fejer's theory f
✍ ĐorΔ‘e KrtiniΔ‡ πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 122 KB πŸ‘ 1 views

## Abstract We describe the space of operators on a Hilbert space with the summable Fourier expansion and prove that this space does not depend on the kind of summability method. We consider the same problem in the spaces of operators with respect to unitarily invariant norms. (Β© 2007 WILEY‐VCH Ver

Looking for an Analogue of Rice's Theore
✍ Bernd Borchert; Frank Stephan πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 223 KB πŸ‘ 1 views

Rice's Theorem says that every nontrivial semantic property of programs is undecidable. In this spirit we show the following: Every nontrivial absolute (gap, relative) counting property of circuits is UP-hard with respect to polynomial-time Turing reductions. For generators [31] we show a perfect a

A continuous analogue of Sperner's theor
✍ Daniel A. Klain; Gian-Carlo Rota πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 149 KB πŸ‘ 2 views

One of the best-known results of extremal combinatorics is Sperner's theorem, which asserts that the maximum size of an antichain of subsets of an n-element set equals the binomial coefficient n n/2 , that is, the maximum of the binomial coefficients. In the last twenty years, Sperner's theorem has