On the Bohr-Hardy criteria (Q1101622): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01198632 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2034913032 / rank | |||
Normal rank |
Latest revision as of 08:51, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the Bohr-Hardy criteria |
scientific article |
Statements
On the Bohr-Hardy criteria (English)
0 references
1988
0 references
A sequence \(\beta\) which has the property that \(\Sigma _ n\beta _ nx_ n\) is summable B whenever \(\Sigma _ nx_ n\) is summable A is called a summability factor of type (A,B). Numerous researchers have considered the problem of characterizing the summability factors of type (A,B) where A and B are members of certain classes of matrices. In every instance in the literature when necessary and sufficient conditions have been obtained for \(\beta\) to be a summability factor of type (A,B) these have been equivalent to the so called Bohr-Hardy criteria. In the case \(A=B\) these conditions reduce to the series to sequence convergence domain being a sum space. In this note we exhibit a class of regular Nörlund polynomial methods which fail to generate sum spaces. We also give a sufficient condition for a Nörlund method to generate a sum space. This is then used to give regular, normal methods A and B for which the Bohr-Hardy criteria determines the summability factors of type (A,A) and (B,B) but not the summability factors of type (A,B).
0 references
summability factor
0 references
regular Nörlund
0 references
polynomial methods
0 references
sum space
0 references
Bohr-Hardy criteria
0 references