Results 1 to 10 of about 1,178 (110)
Some Tauberian Remainder Theorems for Holder Summability
In this paper, we prove some Tauberian remainder theorems that generalize the results given by Meronen and Tammeraid [Math. Model. Anal., 18(1):97– 102, 2013] for Holder summability method using the notion of the general control modulo of the oscillatory
Umit Totur, Muhammet Ali Okur
doaj +4 more sources
Tauberian Remainder Theorems for the Weighted Mean Method of Summability
Using the weighted general control modulo, we prove several Tauberian remainder theorems for the weighted mean method of summability. Our results generalize the results proved by Meronen and Tammeraid [Math. Model. Anal. 18 (1) 2013, 97–102].
Sefa Anil Sezer, Ibrahim Canak
doaj +5 more sources
On Tauberian Remainder Theorems For Ces\`{a}ro Summability method of noninteger order [PDF]
Okur, Muhammet Ali, Totur, Ümit
core +4 more sources
Comparison of speeds of convergence in Riesz‐type families of summability methods. II
Certain summability methods for functions and sequences are compared by their speeds of convergence. The authors are extending their results published in paper [9] for Riesz‐type families {Aα} (α > α0 ) of summability methods Aα .
Anna Šeletski, Anne Tali
doaj +1 more source
On PNT equivalences for Beurling numbers [PDF]
In classical prime number theory several asymptotic relations are considered to be "equivalent" to the prime number theorem. In the setting of Beurling generalized numbers, this may no longer be the case.
Debruyne, Gregory, Vindas Diaz, Jasson
core +2 more sources
Generalized Euler‐Knopp method and convergence acceleration
New propositions on λ‐boundedness for generalized Euler‐Knopp method of summability (ϵ, T), where ? is a linear bounded operator from Banach space X into X, are proved.
O. Meronen, I. Tammeraid
doaj +1 more source
On General Prime Number Theorems with Remainder [PDF]
We show that for Beurling generalized numbers the prime number theorem in remainder form $$\pi(x) = \operatorname*{Li}(x) + O\left(\frac{x}{\log^{n}x}\right) \quad \mbox{for all } n\in\mathbb{N}$$ is equivalent to (for some $a>0$) $$N(x) = ax + O\left ...
Debruyne, Gregory, Vindas, Jasson
core +2 more sources
In-Degree and PageRank of web pages: why do they follow similar power laws? [PDF]
PageRank is a popularity measure designed by Google to rank Web pages. Experiments confirm that PageRank values obey a power law with the same exponent as In-Degree values. This paper presents a novel mathematical model that explains this phenomenon. The
Litvak, N. +2 more
core +2 more sources
Asymptotic formulas for stacks and unimodal sequences [PDF]
We study enumeration functions for unimodal sequences of positive integers, where the size of a sequence is the sum of its terms. We survey known results for a number of natural variants of unimodal sequences, including Auluck's generalized Ferrer ...
Bringmann, Kathrin, Mahlburg, Karl
core +2 more sources
Optimal control of a large dam [PDF]
A large dam model is an object of study of this paper. The parameters $L^{lower}$ and $L^{upper}$ are its lower and upper levels, $L=L^{upper}-L^{lower}$ is large, and if a current level of water is between these bounds, then the dam is assumed to be in ...
Abdel-Hameed +11 more
core +7 more sources

