Results 11 to 20 of about 1,771,045 (277)
On an application of almost increasing sequences [PDF]
Using an almost increasing sequence, a result of Mazhar (1977) on |C,1|k summability factors has been generalized for |C,α;β|k and |N¯,pn;β|k summability factors under weaker conditions.
Hüseyın Bor
doaj +5 more sources
A new application of almost increasing sequences [PDF]
In this paper, a known result dealing with |N, pn|k summability of infinite series has been generalized to the φ-|N, pn;δ|k infinite series by using an almost increasing sequence.
Ahmet Karakaş
doaj +2 more sources
New results for almost increasing sequences [PDF]
In the present paper, two theorems of absolute summability have been proved by using the definition of almost increasing sequence.
Bağdagül Kartal
doaj +3 more sources
On a new application of almost increasing sequences
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hüseyin Bor
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
On a new application of almost increasing sequences [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Özarslan, Hikmet, Keten, Ayşegül
openaire +8 more sources
An application of almost increasing sequences [PDF]
We extended a theorem of Mishra and Srivastava (1983–1984) on |C, 1|k summability factors, using almost increasing sequences, to summability under weaker conditions.
openaire +10 more sources
A New Application of Almost Increasing Sequences
Abstract Bor has proved a main theorem dealing with | N̄ , pn|k summability factors of infinite series. In this paper, we have generalized this theorem to the φ − |A, pn|k summability factors, under weaker conditions by using an almost increasing sequence instead of a positive monotonic non-decreasing sequence.
Keten, Ayşegül, Özarslan, Hikmet
openaire +2 more sources
An extremal problem for a graphic sequence to have a realization containing every 2-tree with prescribed size [PDF]
A graph $G$ is a $2$-tree if $G=K_3$, or $G$ has a vertex $v$ of degree 2, whose neighbors are adjacent, and $G-v$ is a 2-tree. Clearly, if $G$ is a 2-tree on $n$ vertices, then $|E(G)|=2n-3$.
De-Yan Zeng, Jian-Hua Yin
doaj +1 more source
The almost-sure asymptotic behavior of the solution to the stochastic heat equation with L\'evy noise [PDF]
We examine the almost-sure asymptotics of the solution to the stochastic heat equation driven by a L\'evy space-time white noise. When a spatial point is fixed and time tends to infinity, we show that the solution develops unusually high peaks over short
Chong, Carsten, Kevei, Péter
core +2 more sources

