In 2000 Patterson proved that if a bounded double sequence is divergent then there are RHregular matrix methods that sum it to various values. It is now natural to ask the following question. Is there a collection Υ of RH-regular matrix methods which are consistent and such that every bounded double
✦ LIBER ✦
Classes of design — classes of methods — classes of tools
✍ Scribed by Gerhard N. Schmitt; Chen-Cheng Chen
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 521 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0142-694X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Consistent classes of double summability
✍
Richard F. Patterson; Ekrem Savaş
📂
Article
📅
2010
🏛
Elsevier Science
🌐
English
⚖ 237 KB
Acyclicity of Switching Classes
✍
J. Hage; T. Harju
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 133 KB
For a finite undirected graph G = (V, E) and a subset A ⊆ V , the vertex switching of G by A is defined as the graph G A = (V, E ), which is obtained from G by removing all edges between A and its complement A and adding as edges all nonedges between A and A. The switching class [G] determined by G
Multipliers of Schatten classes
✍
Roshdi Khalil
📂
Article
📅
1982
🏛
Elsevier Science
🌐
English
⚖ 340 KB
Symmetry Classes of Functions
✍
N. Metropolis; G.C. Rota; J.A. Stein
📂
Article
📅
1995
🏛
Elsevier Science
🌐
English
⚖ 848 KB
Detailed list of classes
📂
Article
📅
1991
🏛
Elsevier Science
🌐
English
⚖ 105 KB
Detailed list of classes
📂
Article
📅
1988
🏛
Elsevier Science
🌐
English
⚖ 101 KB