Abstract:We introduce a moving average summability method, which is proved to be equivalent with the logarithmic ℓ-method. Several equivalence and Tauberian theorems are given. A strong law of large numbers is also proved.
“…(b) Here we closely follow [8]. From part (a) and the Abelian result of Theorem 9 (i), we have that (i) ⇒ (V, 1, q n , u n ) ⇒ (ii).…”
Section: )mentioning
confidence: 59%
“…We now generalise the results of [8], which were established for the logarithmic mean ℓ. Let Λ denote the set of all functions u that are invertible and u(x) ∼ u([x]).…”
Section: Resultsmentioning
confidence: 82%
“…(δ) the deferred Cesàro mean (D, n/λ, n) of Agnew [1], which is the (V, 1, 1, n, λ) average; (µ) the logarithmic moving average L(λ) of [8], which is the (V, 1, 1/(1 + n), log n, λ) average. The next section states our results on the properties of the introduced methods, the relations between them, and a law of large numbers.…”
Section: Also Letmentioning
confidence: 99%
“…Proof of Theorem 5. Here we follow closely the approach of [8]. To prove (V, p n , q n , u n ) ⇒ (V, p n , q n , u n , λ), let t n → s (Ω).…”
We introduce a non-regular generalisation of the Nörlund mean, and show its equivalence with a certain moving average. The Abelian and Tauberian theorems establish relations with convergent sequences and certain power series. A strong law of large numbers is also proved
“…(b) Here we closely follow [8]. From part (a) and the Abelian result of Theorem 9 (i), we have that (i) ⇒ (V, 1, q n , u n ) ⇒ (ii).…”
Section: )mentioning
confidence: 59%
“…We now generalise the results of [8], which were established for the logarithmic mean ℓ. Let Λ denote the set of all functions u that are invertible and u(x) ∼ u([x]).…”
Section: Resultsmentioning
confidence: 82%
“…(δ) the deferred Cesàro mean (D, n/λ, n) of Agnew [1], which is the (V, 1, 1, n, λ) average; (µ) the logarithmic moving average L(λ) of [8], which is the (V, 1, 1/(1 + n), log n, λ) average. The next section states our results on the properties of the introduced methods, the relations between them, and a law of large numbers.…”
Section: Also Letmentioning
confidence: 99%
“…Proof of Theorem 5. Here we follow closely the approach of [8]. To prove (V, p n , q n , u n ) ⇒ (V, p n , q n , u n , λ), let t n → s (Ω).…”
We introduce a non-regular generalisation of the Nörlund mean, and show its equivalence with a certain moving average. The Abelian and Tauberian theorems establish relations with convergent sequences and certain power series. A strong law of large numbers is also proved
“…The classical logarithmic method is a prime example of where one requires less (or deals with coarsenings of the Kolmogorov strong law). This is useful in a number of areas, particularly probability theory and analytic number theory (Bingham and Gashi [22] and [52, § § 4.16, 5.16, 21]).…”
Section: This Is Kolmogorov's Strong Lln (Slln) Of 1933 One Of the Kmentioning
In this survey, we trace the interplay between the Hardy-Littlewood school of analysis, prominent in the UK in the first half of the last century, and probability theory, barely known in the UK at that time.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.