Next Article in Journal
Identifying the Informational/Signal Dimension in Principal Component Analysis
Previous Article in Journal
Some PPF Dependent Fixed Point Theorems for Generalized α-F-Contractions in Banach Spaces and Applications
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Domain of Nörlund Matrix

1
Faculty of Arts and Sciences, Department of Mathematics, Gaziantep University, Gaziantep 27310, Turkey
2
Şehitler Mah. Cambazlar Sok. No:9, Kilis 79000, Turkey
*
Author to whom correspondence should be addressed.
Submission received: 24 October 2018 / Revised: 14 November 2018 / Accepted: 16 November 2018 / Published: 20 November 2018

Abstract

:
In 1978, the domain of the Nörlund matrix on the classical sequence spaces lp and l was introduced by Wang, where 1 ≤ p < ∞. Tuğ and Başar studied the matrix domain of Nörlund mean on the sequence spaces f0 and f in 2016. Additionally, Tuğ defined and investigated a new sequence space as the domain of the Nörlund matrix on the space of bounded variation sequences in 2017. In this article, we defined new space b s ( N t ) and c s ( N t ) and examined the domain of the Nörlund mean on the bs and cs, which are bounded and convergent series, respectively. We also examined their inclusion relations. We defined the norms over them and investigated whether these new spaces provide conditions of Banach space. Finally, we determined their α-, β-, γ-duals, and characterized their matrix transformations on this space and into this space.

1. Introduction

1.1. Background

In the studies on the sequence space, creating a new sequence space and research on its properties have been important. Some researchers examined the algebraic properties of the sequence space while others investigated its place among other known spaces and its duals, and characterized the matrix transformations on this space.
One way to create a new sequence space in addition to standard sequence space is to use the domain of infinite matrices. In 1978, Ng-Lee [1] studied the domain of an infinite matrix. In the same year, Wang [2] constructed a new sequence space using an infinite matrix, unlike the infinite matrix used by Ng-Lee. These studies have been followed by many researchers such as Malkovsky [3], Altay, and Başar [4]. This topic was first studied in the 1970s but rather intensively after 2000.

1.2. Problem of Interest

The theory of infinite matrices was formulated by the book “Infinite Matrices and Sequence Spaces” written by Cooke [5]. After the publication of this book in 1950, many researchers have used infinite matrices over the years. In some of these studies, the domain of infinite matrices on a sequence space was investigated. One problem is that we do not know the properties of the domain of the Nörlund matrix, which is a trianglular infinite matrix on bs and cs. The domain of the Nörlund matrix is a new sequence space. We intend to address algebraic properties of this new space, to determine its place among other known spaces, to determine its duals, and to characterize the matrix transformations on this space and into this space. Our aim is to provide solutions to these problems.
One difficulty of this study is to determine whether the new space created by the infinite matrix is the contraction or the expansion or overlap of the original space. Also, we have a matrix mapping problem where we must determine the collection of infinite matrices for which the map is a sequence space into another sequence space. We intend to address the first problem by giving a few inclusion theorems, similar to previous studies. For the second problem, we provide two theorems and use the matrix transformation between the standard sequences spaces.

1.3. Literature Survey

Many authors have used infinite matrices for the calculation of any matrix domain up to now. For more information, see [6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26]. Ng and Lee [1] built sequence spaces using the domain of the Cesaro matrix of order one on the classical sequences l p and l in 1978, where 1 ≤ p < ∞. In the same year, the spaces l ( N t ) and l p ( N t ) which are the domain of the Nörlund matrix on the sequence space l p and l were studied by Wang [2], with 1 ≤ p < ∞. Malkovsky [3] constructed the domain of the Riesiz matrix on sequence spaces c , c 0 , and l in 1997. Altay and Başar [27] worked on the domain of Riesiz matrix on l in 2002. Malkovsky and Savaş [28] built some sequence spaces derived from the concept of weighted means. Aydın and Başar [29] introduced sequence spaces, a 0 r and a c r , that are derived from the domain of the A r matrix which are stronger than the Cesaro method, C1. Aydın and Başar [30] studied the forms a 0 r ( u , p ) and a c r ( u , p ) . Aydın and Başar [31] introduced the spaces a 0 r ( Δ ) and a c r ( Δ ) of difference sequences. Aydın and Başar [32] also introduced the sequence space a p r of a non-absolute type of Ar matrix. Altay and Başar [33] investigated and introduced the domain of the Euler matrix on c and c 0 . Sengönül and Başar [34] introduced and investigated the domain of the Cesaro matrix of order one on sequence spaces c and c 0 . Also, f 0 ( N t ) and f ( N t ) were defined by Tuğ and Başar [35], where f0 and f were almost null and almost convergent sequence spaces, respectively. Yeşilkayagil and Başar [36] investigated the paranormed Nörlund sequence space of the non-absolute type. Yeşilkayagil and Başar [37] worked on the domain of the Nörlund matrix in some Maddox’s spaces. Yaşar and Kayaduman [38] introduced and investigated sequence spaces b s ( F ^ ( r , s ) ) and c s ( F ^ ( r , s ) ) using the domain of the Generalized Fibonacci matrix on bs and cs. Furthermore, Mears [39,40] introduced some theorems and the inverse of the Nörlund matrix for the Nörlund mean.

1.4. Scope and Contribution

In this paper, we conduct studies on the sequence space such as topological properties, inclusion relations, base, duals, and matrix transformation. We provide certain tools to researchers by using the concept of sequence spaces directly or indirectly.
We will use a method similar to the ones used in previous studies to solve these problems. We see in the previous studies that the new sequence space produced from original space is a linear space. The same is true for the spaces we produced. At the same time, spaces produced are normed spaces and Banach spaces. In general, the spaces produced and original spaces were found to be isomorphic. The spaces produced in some studies were the expansion of the original space while the others involved some overlap. For example, the space produced in the study of Yaşar and Kayaduman [38] is an expansion, while in this study, the space is a contraction. In this study, alpha, beta, and gamma duals of the spaces produced are available. However, the spaces produced in some previous studies do not have all the duals.
In addition, we try to close the existing deficits in the field the domain of the Nörlund matrix on classical sequence spaces.

1.5. Organization of the Paper

This article consists of eight sections. In Section 1, general information about the working problem is given and the history and importance of the problem is emphasized. A literature survey and the scope and contribution of the study are also presented. In Section 2, a mathematical background of this study is given. In Section 3, two new sequence spaces are constructed using the domain of the Nörlund matrix on the bs and cs sequence spaces. These spaces are b s ( N t ) and c s ( N t ) , where N t is the Nörlund matrix according to t = (tk). The formulation of the Nt-transform function of any sequence space is obtained, and it is shown that they are linear spaces. Also, their norms are defined. We find that b s ( N t ) b s and c s ( N t ) c s . In Section 4, b s ( N t ) and c s ( N t ) are proven to be Banach spaces. Their inclusion relations are given and they are compared to other spaces. It is found that the c s ( N t ) space has a Schauder base. The α-, β-, and γ-duals of these two spaces are calculated. Finally, the necessary conditions for matrix transformations on and into these spaces are provided. They are in the form of ( b s ( N t ) , λ ) , ( c s ( N t ) , λ ) , ( μ , b s ( N t ) ) , and ( μ , c s ( N t ) ) , where we denote the class of infinite matrices moved from sequences of μ space to sequences of λ space with (μ,λ). In Section 5 and Section 6, results and discussion of the study are given, respectively. In Section 7, simple numerical examples were given in order to illustrate the findings of the paper. In the last section, a summary and the conclusions of the paper were reported.

2. Mathematical Background

The set of all real-valued sequences is indicated by w. By a sequence space, we understand that it is a linear subspace of w. The symbols l ,   c ,   c 0 ,   l p ,   b s ,   c s ,   c s 0 ,   b v ,   b v 0 , and l 1 are called sequence spaces bounded, convergent to zero, convergent, absolutely p-summable, bounded series, convergent series, series converging to zero, bounded variation, and absolutely convergent series, respectively.
Now let’s give descriptions of some sequence spaces.
l = { x = ( x k ) w : sup k | x k | < } ,
c = { x = ( x k ) w : lim k | x k l | = 0 for   some   l } ,
c 0 = { x = ( x k ) w : lim k | x k | = 0 } ,
l p = { x = ( x k ) w : k | x k | p < } , ( 0 < p < ) ,
b s = { x = ( x k ) w : sup n | k = 0 n x k | < } ,
c s = { x = ( x k ) w : lim n | k = 0 n x k l | = 0   for   some   l } ,
c s 0 = { x = ( x k ) w : lim n | k = 0 n x k | = 0 } ,
b v = { x = ( x k ) w : k | x k x k 1 | < } ,
b v 0 = b v c 0
l 1 = { x = ( x k ) w : k | x k | < } , ( 0 < p < ) ,
We indicate the set of natural numbers including 0 by ℕ. The class of the non-empty and finite subsets of ℕ is denoted by .
We will transfer the matrix transformation between sequence spaces. Let A = (ank) be an infinite matrix for every n,k ℕ, where ank is a real number. A is defined as a matrix transformation from X to Y if, for every x = (xk) X, sequence Ax = {An(x)} is an A-transform of x and in Y; where
A n ( x ) = k a n k x k   for   each   n .
Here, the series converges for every n ℕ in Equation (1).
In Equation (1), although the limit of the summation is are not written, it is from 0 to ∞, and we will use it for the rest of the article. The family of all the matrix transformations from X to Y is denoted by (X,Y).
Let λ and K be an infinite matrix and a sequence space, respectively. Then, the matrix domain, λK, which is a sequence space is defined by:
λ K = { t = ( t k ) w : K t λ }
Let A and B be linear spaces over the same scalar field. A map f: AB is called linear if:
f(ax1 + bx2) = af(x1) + bf(x2)
for all scalars a,b and all x1, x2 A. An isomorphism f: AB is a bijective linear map. We say that A and B are isomorphic if there is an isomorphism f: AB.
A normed space is (A, ‖.‖) consisting of a linear space A and a norm ‖.‖:A→ℝ such that ‖a‖ = 0; ‖μa‖ = |μ|‖a‖ for each scalar μ and each a A; ‖a + b‖ ≤ ‖a‖ + ‖b‖ for each a,b A.
A Banach space is (A, ‖.‖), a complete normed linear space, where completeness means that for every sequence (an) in A with ‖aman‖→0 (m,n→∞), there exists a A such that ‖ana‖→0 (n→∞).
Let us define the Schauder basis of A normed space. Let a sequence (ak) A. There exists only one sequence of scalars (vk) such that y = k ν k a k and lim n y k = 0 n ν k a k = 0 . Then, (ak) is called a Schauder basis for A.
Let R be a sequence space. α-, β-, and γ-duals R α , R β , and R γ of R are defined respectively, as:
R α = { a = ( a k ) w : a r = ( a k r k ) l 1   for   all   r R } ,
R β = { a = ( a k ) w : a r = ( a k r k ) c s   for   all   r R } ,
R γ = { a = ( a k ) w : a r = ( a k r k ) b s   for   all   r R } .
Let us give almost-convergent sequences space. This was first defined by Lorentz [41]. Let a = (ak) l. Sequence a is almost convergent to limit α if and only if lim m k = 0 m a n + k m + 1 = α uniformly in n. By f-lim a = α, we indicate sequence a is almost convergent to limit α. The sequence spaces f and f0 are:
f 0 = { a = ( a k ) l : lim m k = 0 m a n + k m + 1 = 0   uniformly   in   n } , f = { a = ( a k ) l : α lim m k = 0 m a n + k m + 1 = α   uniformly   in   n } .
Lemma 1.
[35] Let δ and μ be a subspace of w. Then, S = ( s n k ) ( δ ( N t ) , μ ) if, and only if, P = ( p n k ) ( δ , μ ) , where:
p n k = j = k ( 1 ) j k D j k T k s n j   for   all   k , n .
Lemma 2.
[35] Let δ and μ be a subspace of w and let the infinite matrices be S = ( s n k ) and V = ( v n k ) . If S and V are connected with the relation:
v n k = j = 0 n t n j T n s n k   for   all   k , n ,
then, S ( δ , μ ( N t ) ) if, and only if, V ( δ , μ ) .
Lemma 3.
[42] Let S = (snk) and r = (rk) ∈ w and the inverse matrix F = (fnk) of the triangle matrix G = (gnk) by,
s n k = { j = k n r j f j k , 0 k n 0 , k > n
for all k,n . In that case,
δ G γ = { r = ( r k ) w : S ( μ , l ) } ,
δ G β = { r = ( r k ) w : S ( μ , c ) }
such that μ is any sequence space.
Now, we take a non-negative real sequence (tk) with tk > 0 and T n = k = 0 n t k for all n ℕ. The Nörlund mean according to t = (tk) is defined by the matrix N t = ( a n k t ) as:
a n k t = { t n k T n , 0 k n 0 , k > n   for   all   k , n .
The inverse matrix U t = ( u n k t ) of N t = ( a n k t ) is defined as:
u n k t = { ( 1 ) n k D n k T k , 0 k n 0 , k > n
for all n,k ℕ, t0 = D0 = 1 and Dn for n {1,2,3,…} and,
D n = | t 1 1 0 0 . . 0 t 2 t 1 1 0 . . 0 t 3 t 2 t 1 1 . . 0 . . . . .   . . . . .   . . t n 1 t n 2 t n 3 t n 4     1 t n t n 1 t n 2 t n 3     t 1 | .

3. Auxiliary Results

In this section, spaces b s ( N t ) and c s ( N t ) are defined. Also, some of their properties are found.
Let us define the sets b s ( N t ) and c s ( N t ) , whose N t = ( a n k t ) transforms are in bs and cs.
b s ( N t ) = { x = ( x k ) w : sup n | j = 0 n k = 0 j t j k T j x k | < } ,
c s ( N t ) = { x = ( x k ) w : ( j = 0 n k = 0 j t j k T j x k ) n c } .
Here, it can be seen from Equation (2) that b s ( N t ) = ( b s ) N t   and   c s ( N t ) = ( c s ) N t .
If x = (xn) w and y = N t x , such that y = (yn), then the equality,
y n = ( N t x ) n = k = 0 n t n k T n x k   for   all   n
is satisfied. In this situation, we can see that x n = ( U t y ) n , that is,
x n = k = 0 n ( 1 ) n k D n k T k y k   for   all   n .
Now, let us detail one of the basic theorems of our article.
Theorem 1.
The set of b s ( N t ) is a linear space.
Proof. 
The proof is left to the reader because it is easy to see that it provides the linear space conditions. □
Theorem 2.
The set of c s ( N t ) is a linear space.
Proof. 
The proof is left to the reader because it is easy to see that it provides the linear space conditions. □
Theorem 3.
b s ( N t ) is a normed space with:
x b s ( N t ) = sup n | j = 0 n k = 0 j t j k T j x k | .
Proof. 
The proof is left to the reader because it is easy to see that it provides the normed space conditions. □
Theorem 4.
c s ( N t ) is a normed space with the norm in Equation (9).
Proof. 
The proof is left to the reader because it is easy to see that it provides the normed space conditions. □
Theorem 5.
b s ( N t ) and b s spaces are isomorphic as normed spaces.
Proof. 
Let us take the transformation:
T : b s ( N t ) x b s y = T x = N t x .
It is clear that T is both injective and linear.
Let y = (yn) bs. By using Equations (6) and (7), we find,
x b s ( N t ) = sup n | j = 0 n k = 0 j t j k T j x k |   = sup n | j = 0 n k = 0 j t j k T j i = 0 n ( 1 ) k i D k i T i y i |   = sup n | j = 0 n y j | = y b s .
Hence, x is an element of b s ( N t ) and T is surjective. We see that T preserves the norm. Here, b s ( N t ) and b s are isometric. That is, b s ( N t ) b s . □
Theorem 6.
c s ( N t ) and c s spaces are isomorphic as normed spaces.
Proof. 
The proof can be made similar to Theorem 5. □
Now, let S = (snk) be an infinite matrix and give the equations below:
lim k s n k = 0   for   each   n ,
sup m k | n = 0 m ( s n k s n , k + 1 ) | < ,
n s n k convergent   for   each   k
sup n k | s n k s n , k + 1 | < ,
lim n s n k = α k   for   each   k ,   α k ,
sup N , K | n k ( s n k s n , k + 1 ) | < ,
sup N , K | n k ( s n k s n , k 1 ) | < ,
lim n ( s n k s n , k + 1 ) = α   for   each   k ,   α ,
lim n k | s n k s n , k + 1 | = k | lim n ( s n k s n , k + 1 ) | ,
sup n | lim k s n k | < ,
lim n k | s n k s n , k + 1 | = 0   uniformly   in   n ,
lim m k | n = 0 m ( s n k s n , k + 1 ) | = 0 ,
lim m k | n = 0 m ( s n k s n , k + 1 ) | = k | n ( s n k s n , k + 1 ) | = 0 ,
sup N , K | n k [ ( s n k s n , k + 1 ) ( s n 1 , k s n 1 , k + 1 ) ] | < ,
sup m | lim k n = 0 m s n k | < ,
α k n s n k = α k   for   each   k ,
sup N , K | n k [ ( s n k s n 1 , k ) ( s n , k 1 s n 1 , k 1 ) ] | < .
m k f lim s n k = m k   for   each   k ,
m k lim q k 1 q + 1 | i = 0 q Δ [ j = 0 n + i ( s j k m k ) ] | = 0   uniformly   in   n ,
sup n k | Δ [ j = 0 n s j k ] | < ,
m k f lim j = 0 n s j k = m k   for   each   k ,
sup n k | j = 0 n s j k | < ,
m k lim n n k s n k = m k   for   each   k ,
lim n k | Δ [ j = 0 n ( s j k m k ) ] | = 0 ,
sup n k | j = 0 n s j k | p < ,   q = p p 1 ,
sup m , n | n = 0 m s n k | < ,
sup m , l | n = 0 m k = l s n k | < ,
sup m , l | n = 0 m k = 0 l s n k | < ,
lim m k | n = m s n k | = 0 ,
n k s n k ,   convergent   for   each   k
lim m n = 0 m ( s n k s n , k + 1 ) = α   for   each   k ,   α .
sup m k | n = 0 m ( s n k s n , k 1 ) | < ,
Now, we provide some matrix transformations which are taken from Stieglitz and Tietz [43] to use in the inclusion theorems.
Lemma 4.
Let S = ( s n k ) be an infinite matrix. Then, the following statements hold.
(1) 
S = ( s n k ) ( b s , l ) if, and only if, Equations (10) and (13) hold.
(2) 
S = ( s n k ) ( c s . c ) if, and only if, Equations (13) and (14) hold.
(5) 
S = ( s n k ) ( b s , l 1 ) if, and only if, Equations (10) and (15) hold.
(6) 
S = ( s n k ) ( c s , l 1 ) if, and only if, Equation (16) holds.
(7) 
S = ( s n k ) ( b s , c ) if, and only if, Equations (10), (17), and (18) hold.
(8) 
S = ( s n k ) ( c s , l ) if, and only if, Equations (13) and (19) hold.
(9) 
S = ( s n k ) ( b s , c 0 ) if, and only if, Equations (10) and (20) hold.
(10) 
S = ( s n k ) ( b s , c s 0 ) if, and only if, Equations (10) and (21) hold.
(11) 
S = ( s n k ) ( b s , c s ) if, and only if, Equations (10) and (22) hold.
(12) 
S = ( s n k ) ( b s , b v ) if, and only if, Equations (10) and (23) hold.
(13) 
S = ( s n k ) ( b s , b s ) if, and only if, Equations (10) and (11) hold.
(14) 
S = ( s n k ) ( c s , c s ) if, and only if, Equations (10) and (41) hold.
(15) 
S = ( s n k ) ( b s , b v 0 ) if, and only if, Equations (13), (20), and (23) hold.
(16) 
S = ( s n k ) ( c s , c 0 ) if, and only if, Equation (13) holds and Equation (14) also holds with α k = 0 for all k ℕ.
(17) 
S = ( s n k ) ( c s , b s ) if, and only if, Equations (11) and (24) hold.
(18) 
S = ( s n k ) ( c s , c s 0 ) if, and only if, Equation (11) holds and Equation (25) also holds with α k = 0 for all k ℕ.
(19) 
S = ( s n k ) ( c s , b v ) if, and only if, Equation (26) holds.
(20) 
S = ( s n k ) ( c s , b v 0 ) if, and only if, Equation (26) holds and Equation (14) also holds with α k = 0 for all k ℕ.
(21) 
S = ( s n k ) ( l , b s ) = ( c , b s ) = ( c 0 , b s ) if, and only if, Equation (31) holds.
(22) 
S = ( s n k ) ( l p , b s ) if, and only if, Equation (34) holds.
(23) 
S = ( s n k ) ( l 1 , b s ) if, and only if, Equation (35) holds.
(24) 
S = ( s n k ) ( b v , b s ) if, and only if, Equation (36) holds.
(25) 
S = ( s n k ) ( b v 0 , b s ) if, and only if, Equation (37) holds.
(26) 
S = ( s n k ) ( l , c s ) if, and only if, Equation (38) holds.
(27) 
S = ( s n k ) ( c , c s ) if, and only if, Equations (31), (32), and (39) hold.
(28) 
S = ( s n k ) ( c s 0 , c s ) if, and only if, Equations (11) and (40) hold.
(29) 
S = ( s n k ) ( l p , c s ) if, and only if, Equations (12) and (34) hold.
(30) 
S = ( s n k ) ( l 1 , c s ) if, and only if, Equations (12) and (35) hold.
(31) 
S = ( s n k ) ( b v , c s ) if, and only if, Equations (12), (35) and (37) hold.
(32) 
S = ( s n k ) ( b v 0 , c s ) if, and only if, Equations (12) and (37) hold.
Lemma 5.
Let S = ( s n k ) be an infinite matrix for all k,n ℕ.
(1) 
S = ( s n k ) ( f , c s ) if, and only if, Equations (25) and (31)–(33) hold (Başar [44]).
(2) 
S = ( s n k ) ( c s , f ) if, and only if, Equations (13) and (27) hold (Başar and Çolak [45]).
(3) 
S = ( s n k ) ( b s , f ) if, and only if, Equations (10), (13), (27) and (28) hold (Başar and Solak [46]).
(4) 
S = ( s n k ) ( b s , f ) if, and only if, Equations (10) and (28)–(30) hold (Başar and Solak [46]).
(5) 
S = ( s n k ) ( c s , f s ) if, and only if, Equations (29) and (30) hold (Başar and Çolak [45]).

4. Main Results

Theorem 7.
b s ( N t ) is a Banach space, according to Equation (9).
Proof. 
Clearly, the norm conditions are satisfied. Let us take the sequence x i = ( x i ) n as a Cauchy sequence in b s ( N t ) for all i,n ℕ. We find,
y i n = k = 0 n t n k T n x i k   for   all   i , k
by using Equation (7). Since the sequence x i = ( x i ) n is a Cauchy sequence, ε > 0 and there exists n0 ℕ, such that:
x i x m b s ( N t ) = sup n | j = 0 n k = 0 j t j k T j ( x k i x k m ) |   = sup n | k = 0 n ( y k i y k m ) | = y i y m < ε
for all i,m > n0. yiy (i→∞) such that y b s exists because b s is complete. b s ( N t ) is also complete because b s ( N t ) and b s are isomorphic. Hence, b s ( N t ) is a Banach space. □
Theorem 8.
c s ( N t ) is a Banach space, according to Equation (9).
Proof. 
Clearly, the norm conditions are satisfied. Let us take the sequence x i = ( x i ) n is a Cauchy sequence in c s ( N t ) for all i,n ℕ. We find:
y i n = k = 0 n t n k T n x i k   for   all   i , k
by using Equation (7). Since the sequence x i = ( x i ) n is a Cauchy sequence, ε > 0 and there exists n0 ℕ, such that:
x i x m c s ( N t ) = sup n | j = 0 n k = 0 j t j k T j ( x k i x k m ) |   = sup n | k = 0 n ( y k i y k m ) | = y i y m < ε
for all i,m > n0. yiy (i→∞) such that y c s exists because cs is complete. c s ( N t ) is also complete because the c s ( N t ) and c s are isomorphic. Hence, c s ( N t ) is a Banach space. □
Theorem 9.
c s ( N t ) b s ( N t ) is valid.
Proof. 
Let x c s ( N t ) . If y = N t x c s , then k N t x c . Since c s l , k N t x l . Hence, y = N t x b s . Therefore, x b s ( N t ) . We obtain that c s ( N t ) b s ( N t ) . □
Theorem 10.
b s and b s ( N t ) have an overlap, but neither of them contains the other.
Proof. 
We prove that b s and b s ( N t ) are not disjointed.
(i)
Let x = ( x k ) = ( 1 , 0 , 0 , ) and t = ( t k ) = ( 1 , 0 , 0 , ) . It is clear that x b s . If we do the necessary calculations, we find x b s ( N t ) . Thus, x b s b s ( N t ) .
(ii)
Now, let us take x = (xk) and,
x k = j = 0 k ( 1 ) k D k j T j
for all k ℕ. Then, we obtain:
( N t x ) n = k = 0 n t n k T n j = 0 k ( 1 ) k D k j T j = ( 1 ) n
for all n ℕ. Thus ( N t x ) n b s . That is, x b s ( N t ) . However, x b s ( N t ) . Therefore, b s ( N t ) \ b s is not empty.
(iii)
Let x = ( x k ) = ( 1 , 0 , 0 , ) and t = ( t k ) = ( 1 , 1 , 1 , ) . It is clear that x b s . If we do the necessary calculations, we find that x b s ( N t ) . Hence, x b s \ b s ( N t ) . □
Theorem 11.
b s ( N t ) and l have an overlap, but neither of them contains the other.
Proof. 
We prove that b s ( N t ) and l are not disjointed.
(i)
Let x = ( x k ) = { ( 1 ) k } for all k ℕ. It is clear that { ( 1 ) k } l . If we do the necessary calculations, we find x = ( x k ) = { ( 1 ) k } b s ( N t ) . Thus, x b s ( N t ) l .
(ii)
Now, we take x = ( x k ) = ( 1 , 1 , 1 , ) . N t x = x b s . Thus, x b s ( N t ) , but x l . Then, x l \ b s ( N t ) .
(iii)
On the other hand, if we take Equation (42), then N t x b s . So, x b s ( N t ) , but x l . Thus, x b s ( N t ) \ l .
This is the desired result. □
Theorem 12.
c s and c s ( N t ) have an overlap, but neither of them contains the other.
Proof. 
We prove that c s and c s ( N t ) are not disjointed.
(i)
If we use the example in the (i) of the proof of Theorem 10, then we find x c s c s ( N t ) .
(ii)
Now, let x = ( x k ) = ( 1 , 2 , 3 , ( 1 ) k k + 1 , ) and t = ( t k ) = ( 1 , 1 , 1 , ) for all k ℕ. Then, we obtain that x c s ( N t ) . However, x c s . Therefore, c s ( N t ) \ c s is not empty.
(iii)
If we use the example in the (iii) of the proof of Theorem 10, then we find x c s \ c s ( N t ) .
Theorem 13.
c s ( N t ) and c have an overlap, but neither of them contains the other.
Proof. 
Let us prove that c s ( N t ) and c are not disjointed.
(i)
If we use the example in the (i) of the proof of Theorem 10, then we find that there exists at least one point belonging to both c s ( N t ) and c .
(ii)
If we use the example in the (ii) of the proof of Theorem 11, then we find x c \ c s ( N t ) .
(iii)
Let x = ( x k ) = ( 1 , 1 , 1 , 1 , ) and t = ( t k ) = ( 1 , 1 , 0 , 0 , ) . Then, N t x = ( 1 , 0 , 0 , ) c s . Therefore, x c s ( N t ) , but x c . Thus, x c s ( N t ) \ c .
This is the desired result. □
Lemma 6.
Let r = ( r n ) w and let U t = ( u n k t ) be the inverse matrix of N t Nörlund matrix. The infinite matrix C = ( c n k ) is defined by:
c n k = { r n u n k t , 0 k n 0 , k > n
for all k,n ℕ, μ { c s , b s } . In that case r { μ ( N t ) α } if, and only if, C ( μ , l 1 ) .
Proof. 
Let r = ( r n ) and x = ( x n ) be an element of w for all n ℕ. Let y = ( y n ) be such that y = N t x is defined by Equation (7). In that case,
r x = r n x n = r n ( U t y ) n = ( C y ) n = C y
for all n ℕ. Therefore, we find using Equation (7) that r x = ( r n x n ) l 1 with x = ( x n ) μ ( N t ) if, and only if, C y l 1 with y μ . That is, C ( μ , l 1 ) .
Let us give the Schauder basis of c s ( N t ) .
Corollary 1.
Let us define sequences b ( k ) = { b n ( k ) } n in the c s ( N t ) , such that:
b n ( k ) = { ( 1 ) n k D n k T k , n k 0 , n < k .
Then { b n ( k ) } n is called a basis for c s ( N t ) and every x c s ( N t ) has only one representation x = k y k b ( k ) , such that y k = ( N t x ) k .
In this section, we give the α-, β-, and γ-duals of the spaces b s ( N t ) and c s ( N t ) and the matrix transformations related to these spaces.
If we use Lemmas 3, 4, and 6 together, the following corollary is found.
Corollary 2.
Let us B = (bnk) and C = (cnk) such that:
b n k = { r n u n k t , 0 k n 0 , k > n   and   c n k = j = k n ( 1 ) j k D j k T k r j .
If we take m1, m2, m3, m4, m5, m6, m7, and m8 as follows:
m 1 = { r = r k w : sup N , K | n k ( b n k b n , k + 1 ) | < } , m 2 = { r = r k w : sup N , K | n k ( b n k b n , k 1 ) | < } , m 3 = { r = r k w : lim k c n k = 0 } , m 4 = { r = r k w : α lim n ( c n k c n , k + 1 ) = α   } , m 5 = { r = r k w : lim n k | c n k c n , k + 1 | = k | lim n ( c n k c n , k + 1 ) | } , m 6 = { r = r k w : α lim n c n k = α   for   all   k } , m 7 = { r = r k w : sup n k | c n k c n , k + 1 | < } , m 8 = { r = r k w : sup n | lim k c n k | < } .
Then, the following statements hold:
(1) 
b s ( N t ) α = m 1
(2) 
c s ( N t ) α = m 2
(5) 
b s ( N t ) β = m 3 m 4 m 5
(6) 
c s ( N t ) β = m 6 m 7
(7) 
b s ( N t ) γ = m 3 m 7
(8) 
c s ( N t ) γ = m 7 m 8
Now, let us list the following conditions, where p n k is taken from Equation (3);
lim k p n k = 0   for   each   n ,
sup n k | p n k p n , k + 1 | < ,
m k lim n ( p n k p n , k + 1 ) = m k   for   all   k , n ,
lim n k | p n k p n , k + 1 | = k | lim n ( p n k p n , k + 1 ) | ,
sup m k | n = 0 m ( p n k p n , k + 1 ) | < ,
lim m k | n = 0 m ( p n k p n , k + 1 ) | = k | n ( p n k p n , k + 1 ) | = 0 ,
lim m k | n = 0 m ( p n k p n , k + 1 ) | = 0 ,
sup N , K | n k ( p n k p n , k + 1 ) | < .
sup N , K | n k [ ( p n k p n , k + 1 ) ( p n 1 , k p n 1 , k + 1 ) ] | < ,
sup n | lim k p n k | < ,
m k lim n p n k = m k   for   all   k ,
sup m | lim k n = 0 m p n k | < ,
sup m k | n = 0 m ( p n k p n , k 1 ) | < ,
m k n p n k = m k   for   each   k ,
sup N , K n | k ( p n k p n , k 1 ) | < ,
m k f lim p n k = m k   for   each   k ,
sup N , K | n k [ ( p n k p n 1 , k ) ( p n , k 1 p n 1 , k 1 ) ] | < ,
m k lim q k 1 q + 1 | i = 0 q Δ [ j = 0 n + i ( p j k m k ) ] | = 0   uniformly   in   n ,
sup n k | j = 0 n p j k | < ,
m k lim n n k p n k = m k   for   each   k ,
m k lim n k | Δ [ j = 0 n ( p j k m k ) ] | = 0 ,
sup n k | Δ [ j = 0 n p j k ] | < ,
m k f lim j = 0 n p j k = m k   for   each   k ,
lim n k | p n k p n , k + 1 | = 0 ,
n p n k   convergent   for   each   k .
Now we can give several conclusions of Lemmas 1,2,4, and 5.
Corollary 3.
Let S = ( s n k ) be an infinite matrix for all k,n ℕ. Then,
(1) 
S = ( s n k ) ( b s ( N t ) , c 0 ) if, and only if, Equations (43) and (66) hold.
(2) 
S = ( s n k ) ( b s ( N t ) , c s 0 ) if, and only if, Equations (43) and (49) hold.
(5) 
S = ( s n k ) ( b s ( N t ) , c ) if, and only if, Equations (43), (45), and (46) hold.
(6) 
S = ( s n k ) ( b s ( N t ) , c s ) if, and only if, Equations (43) and (48) hold.
(7) 
S = ( s n k ) ( b s ( N t ) , l ) if, and only if, Equations (43) and (44) hold.
(8) 
S = ( s n k ) ( b s ( N t ) , b s ) if, and only if, Equations (43) and (47) hold.
(9) 
S = ( s n k ) ( b s ( N t ) , l 1 ) if, and only if, Equations (43) and (50) hold.
(10) 
S = ( s n k ) ( b s ( N t ) , b v ) if, and only if, Equations (43) and (51) hold.
(11) 
S = ( s n k ) ( b s ( N t ) , b v 0 ) if, and only if, Equations (44), (51), and (65).
Corollary 4.
Let S = ( s n k ) be an infinite matrix for all k,n ℕ. Then,
(1) 
S = ( s n k ) ( c s ( N t ) , c 0 ) if, and only if, Equation (44) holds and Equation (53) also holds with m k = 0 for all k .
(2) 
S = ( s n k ) ( c s ( N t ) , c s 0 ) if, and only if, Equation (47) holds and Equation (56) also holds with m k = 0 for all k .
(5) 
S = ( s n k ) ( c s ( N t ) , c ) if, and only if, Equations (44) and (53) hold.
(6) 
S = ( s n k ) ( c s ( N t ) , c s ) if, and only if, Equations (47) and (67) hold.
(7) 
S = ( s n k ) ( c s ( N t ) , l ) if, and only if, Equations (44) and (52) hold.
(8) 
S = ( s n k ) ( c s ( N t ) , b s ) if, and only if, Equations (47) and (54) hold.
(9) 
S = ( s n k ) ( c s ( N t ) , l 1 ) if, and only if, Equation (57) holds.
(10) 
S = ( s n k ) ( c s ( N t ) , b v ) if, and only if, Equation (59) holds.
(11) 
S = ( s n k ) ( c s ( N t ) , b v 0 ) if, and only if, Equation (59) holds and Equation (53) also holds with m k = 0 for all k .
Corollary 5.
Let S = ( s n k ) be an infinite matrix for all k,n ℕ. Then,
(1) 
S = ( s n k ) ( b s ( N t ) , f ) if, and only if, Equations (43), (44), (58), and (60) hold.
(2) 
S = ( s n k ) ( c s ( N t ) , f ) if, and only if, Equations (44) and (58) hold.
(5) 
S = ( s n k ) ( f , c s ( N t ) ) if, and only if, Equations (56) and (61)–(63) hold with v n k instead of p n k , where v n k is defined by Equation (4).
(6) 
S = ( s n k ) ( b s ( N t ) , f s ) if, and only if, Equations (43), (58), (64), and (65) hold.
(7) 
S = ( s n k ) ( c s ( N t ) , f s ) if, and only if, Equations (64) and (65) hold.
Corollary 6.
Let S = ( s n k ) be an infinite matrix for all k,n ℕ. Then,
(1) 
S = ( s n k ) ( l , b s ( N t ) ) = ( c , b s ( N t ) ) = ( c 0 , b s ( N t ) ) if, and only if, Equation (31) holds with v n k instead of s n k , where v n k is defined by Equation (4).
(2) 
S = ( s n k ) ( l p , b s ( N t ) ) if, and only if, Equation (34) holds with v n k instead of s n k where v n k , is defined by Equation (4).
(5) 
S = ( s n k ) ( l 1 , b s ( N t ) ) if, and only if, Equation (35) holds with with v n k instead of s n k , where v n k is defined by Equation (4).
(6) 
S = ( s n k ) ( b v , b s ( N t ) ) if, and only if, Equation (36) holds with with v n k instead of s n k , where v n k is defined by Equation (4).
(7) 
S = ( s n k ) ( b v 0 , b s ( N t ) ) if, and only if, Equation (37) holds with v n k instead of s n k , where v n k is defined by Equation (4).
(8) 
S = ( s n k ) ( l , c s ( N t ) ) if, and only if, Equation (38) holds with v n k instead of s n k , where v n k is defined by Equation (4).
(9) 
S = ( s n k ) ( c , c s ( N t ) ) if, and only if, Equations (12), (31), and (39) hold with v n k instead of s n k , where v n k is defined by Equation (4).
(10) 
S = ( s n k ) ( c s 0 , c s ( N t ) ) if and only if Equations (11) and (40) hold with v n k instead of s n k where v n k is defined by Equation (4).
(11) 
S = ( s n k ) ( l p , c s ( N t ) ) if, and only if, Equations (12) and (34) hold with v n k instead of s n k , where v n k is defined by Equation (4).
(12) 
S = ( s n k ) ( l 1 , c s ( N t ) ) if, and only if, Equations (12) and (35) hold with v n k instead of s n k , where v n k is defined by Equation (4).
(13) 
S = ( s n k ) ( b v , c s ( N t ) ) if, and only if, Equations (12), (35) and (37) hold with v n k instead of s n k where v n k is defined by Equation (4).
(14) 
S = ( s n k ) ( b v 0 , c s ( N t ) ) if, and only if, Equations (12) and (37) hold with v n k instead of s n k , where v n k is defined by Equation (4).

5. Results

The present paper is concerned with the domain of the trianglular infinite matrix. The triangular matrix we use in this study is the Nörlund matrix. We introduced the sequence spaces c s ( N t ) and b s ( N t ) as the domain of the Nörlund matrix, where c s and b s are convergent and bounded series, respectively. We found that these spaces are linear spaces and they have the same norm,
x = sup n | j = 0 n k = 0 j t j k T j x k | ,
where x b s ( N t ) or x c s ( N t ) . c s ( N t ) and b s ( N t ) are Banach spaces with that norm. Some inclusion theorems of them were given. It was found that c s ( N t ) b s ( N t ) holds. At the same time, b s , b s ( N t ) ; c s , c s ( N t ) ; b s ( N t ) , l ; and c s ( N t ) , c have an overlap, but neither of them contains the other. It was shown that the space b s ( N t ) has no Schauder basis, but the space c s ( N t ) has a Schauder basis. We detected that both spaces have the α-, β-, and γ-duals and calculated them. Finally, the necessary conditions for the matrix transformations on and into these spaces were given.

6. Discussion

The spaces l ( N t ) and l p ( N t ) were studied by Wang [2] while 1 ≤ p < ∞. f 0 ( N t ) and f ( N t ) were studied by Tuğ and Başar [35], where f 0 and f are almost-null and almost-convergent sequence spaces, respectively. Tuğ and Başar [35] have not investigated whether the space was the expansion or the contraction or overlap of the original space. However, it is determined to be the overlap in our study. Tuğ [47] defined and investigated a new sequence space as the domain of the Nörlund matrix in the space of all the sequences of the bounded variation. In our study, we determined that it is an expansion.
We introduced new sequence spaces, b s ( N t ) and c s ( N t ) , as the sets of all sequences whose N t = ( a n k t ) transforms are in the sequence space, bs and cs,
b s ( N t ) = { x = ( x k ) w : sup n | j = 0 n k = 0 j t j k T j x k | < } ,
c s ( N t ) = { x = ( x k ) w : ( j = 0 n k = 0 j t j k T j x k ) n c } .
We realize that these spaces are linear and have normed spaces with the same norm and Banach spaces as the convenient norm. The pairs b s ( N t ) , b s and c s ( N t ) , c s are isomorphic as normed spaces. Also, c s ( N t ) b s ( N t ) holds. At the same time, b s , b s ( N t ) ; c s , c s ( N t ) ; b s ( N t ) , l ; and c s ( N t ) , c have an overlap, but neither of them contains the other. It was determined that they have α-, β-, and γ-duals. Finally, we found some matrix transformations related to these new spaces.

7. Illustrative Examples

Example 1.
Let S = ( s n k ) be infinite unit matrix for all k,n such that,
s n k = { 1 , k = n 0 , k n .
We show that S = ( s n k ) ( b s ( N t ) , l ) . For this, let’s look at the conditions of Equations (43) and (44).
i- 
The Equation (43): lim k p n k = 0   for   each   n N .
p n k = j = k ( 1 ) j k D j k T k s n j = { T n , k = n 0 , k n .
In that case lim k p n k = 0.
ii- 
The Equation (44): sup n k | p n k p n , k + 1 | < . We find,
p n k p n , k + 1 = { T n , k n k + 1 0 , k n   o r   k + 1 n .
Hence, sup n k | p n k p n , k + 1 | = sup n 2 T n = 2 sup n k = 0 n t k .
Consequently, S = ( s n k ) ( b s ( N t ) , l ) for every t = ( t k ) b s .
Also, there is no non-negative t = (tk) such that S = ( s n k ) ( b s ( N t ) , b s ) . This is because, if Equation (47) is investigated, we find,
sup m k | n = 0 m ( p n k p n , k + 1 ) | = T 0 + 2 sup m k = 1 m j = 0 k t j .
Since t = ( t k ) is non-negative, Equation (47) is not bounded.
Example 2.
Let S = ( s n k ) be an infinite unit matrix for all k,n ℕ, such as Example 1.
We show that S = ( s n k ) ( b s ( N t ) , b v ) . For this, let’s look at the conditions of Equations (43) and (51).
We know that the condition Equation (43) holds. For Equation (51), if we calculate, then we find:
sup N , K | n k [ ( p n k p n , k + 1 ) ( p n 1 , k p n 1 , k + 1 ) ] | = 2 sup N , K k = 0 t k .
This result is the same as the result of Example 1. Hence, S = ( s n k ) ( b s ( N t ) , b v ) for every t = ( t k ) b s .
Example 3.
Let S = ( s n k ) be an infinite unit matrix for all k,n ℕ, such as Example 1.
We show that S = ( s n k ) ( c s ( N t ) , l 1 ) . For this, let’s look at the condition of Equation (57).
If we calculate, then we find:
sup N , K n | k ( p n k p n , k 1 ) | = 0
This result shows that S = ( s n k ) ( c s ( N t ) , l 1 ) .
Example 4.
Let S = ( s n k ) be an infinite unit matrix for all k,n ℕ, such as Example 1.
We show that S = ( s n k ) ( c s ( N t ) , b v ) . For this, let’s look at the condition of Equation (59).
If we calculate, then we find
sup N , K | n k [ ( p n k p n 1 , k ) ( p n , k 1 p n 1 , k 1 ) ] | = 0
This result shows that S = ( s n k ) ( c s ( N t ) , b v ) .

8. Summary and Conclusions

In this article, two new sequence spaces are constructed using the domain of the Nörlund matrix on the bs and cs sequence spaces. These Spaces are b s ( N t ) and c s ( N t ) , where N t is the Nörlund matrix according to t = ( t k ) . The formulation of the N t -transform function of any sequence space is obtained, and it is shown that they are linear spaces. Also, their norms are defined. We found that b s ( N t ) b s and c s ( N t ) c s . That is, the pairs b s ( N t ) , b s and c s ( N t ) , c s are isomorphic spaces. At the same time, they are proven to be Banach spaces. Their inclusion relations are given and they are compared to other spaces. It is determined that the c s ( N t ) space has a Schauder base. Also, the α-, β-, and γ- duals of these two spaces are calculated. Finally, the necessary conditions for the matrix transformations on and into these spaces are provided. They are in the form of ( b s ( N t ) , λ ) , ( c s ( N t ) , λ ) , ( μ , b s ( N t ) ) , and ( μ , c s ( N t ) ) , where we denote the class of infinite matrices moved from sequences of μ space to sequences of λ space with ( μ , λ ) .

Author Contributions

This article was written with equal contributions from both authors. The final manuscript was read and approved by both authors.

Funding

This research received no external funding.

Acknowledgments

We thank to the responsible editors and reviewers for their contribution for the improvement of this paper. We also thank Mehmet Kanoğlu for his help in reviewing English of the paper.

Conflicts of Interest

Both authors declare that they have no interests.

References

  1. Ng, P.-N.; Lee, P.-Y. Cesaro sequence space of non-absolute type. Comment. Math. Prace Mat. 1978, 20, 429–433. [Google Scholar]
  2. Wang, C.S. On Nörlund Sequence Space. Tamkang J. Math. 1978, 9, 269–274. [Google Scholar]
  3. Malkovsky, E. Recent results in the theory of matrix transformations in sequence spaces. Mat. Vesnik 1997, 49, 187–196. [Google Scholar]
  4. Altay, B.; Başar, F. On some Euler sequence spaces of non-absolute type. Ukranian Math. J. 2005, 57, 3–17. [Google Scholar] [CrossRef]
  5. Cooke, R.G. Infinite Matrices and Sequence Spaces; Macmillan and Co. Limited: London, UK, 1950. [Google Scholar]
  6. Kayaduman, K.; Çoşkun, H. On some inequalities and σ(A)-conservative matrices. Southeast Asian Bull. Math. 2010, 34, 1–10. [Google Scholar]
  7. Kayaduman, K.; Yaşar, F.; Çetin, A. On Some Inequalities and σB(r,s)-Conservative Matrices. J. Inequal. Special Funct. 2018, 9, 82–91. [Google Scholar]
  8. Kirişçi, M.; Başar, F. Some new sequence spaces derived by the domain of generalized difference matrix. Comput. Math. Appl. 2010, 60, 1299–1309. [Google Scholar] [CrossRef]
  9. Kayaduman, K.; Çoşkun, H. On the σ(A)-summability and σ(A)-core. Demonstratio Math. 2007, 4, 860–867. [Google Scholar] [CrossRef]
  10. Altay, B.; Başar, F. Some paranormed Riezs sequence spaces of non-absolute type. Southeast Asian Bull. Math. 2006, 30, 591–608. [Google Scholar]
  11. Mursaleen, M.; Noman, A.K. On the spaces of λ-convergent and bounded sequences. Thai J. Math. 2010, 8, 311–329. [Google Scholar]
  12. Candan, M. Domain of the double sequential band matrix in the classical sequence spaces. J. Inequal. Appl. 2012, 2012, 281. [Google Scholar] [CrossRef] [Green Version]
  13. Candan, M.; Kayaduman, K. Almost convergent sequence space derived by generalized Fibonacci matrix and Fibonacci core. Br. J. Math. Comput. Sci. 2015, 7, 150–167. [Google Scholar] [CrossRef]
  14. Candan, M. Almost convergence and double sequential band matrix. Acta Math. Sci. 2014, 34B, 354–366. [Google Scholar] [CrossRef]
  15. Candan, M. A new sequence space isomorphic to the space lp and compact operators. J. Math. Comput. Sci. 2014, 4, 306–334. [Google Scholar]
  16. Candan, M. Domain of the double sequential band matrix in the spaces of convergent and null sequences. Adv. Differ. Equ. 2014, 2014, 163. [Google Scholar] [CrossRef] [Green Version]
  17. Candan, M.; Güneş, A. Paranormed sequence space of non-absolute type founded using generalized difference matrix. Proc. Natl. Acad. Sci. India Sect. A 2015, 85, 269–276. [Google Scholar] [CrossRef]
  18. Candan, M. Some new sequence spaces derived from the spaces of bounded, convergent and null sequences. Int. J. Mod. Math. Sci. 2014, 12, 74–87. [Google Scholar]
  19. Candan, M.; Kara, E.E. A study on topological and geometrical characteristics of new Banach sequence spaces. Gulf J. Math. 2015, 4, 67–84. [Google Scholar]
  20. Candan, M.; Kılınç, G. A different look for paranormed Riesz sequence space derived by Fibonacci matrix. Konuralp J. Math. 2015, 3, 62–76. [Google Scholar]
  21. Şengönül, M.; Kayaduman, K. On the Riesz almost convergent sequence space. Abstr. Appl. Anal. 2012, 2012, 691694. [Google Scholar] [CrossRef]
  22. Kayaduman, K.; Şengönül, M. The spaces of Cesaro almost convergent sequences and core theorems. Acta Math. Sci. 2012, 32B, 2265–2278. [Google Scholar] [CrossRef]
  23. Çakan, C.; Çoşkun, H. Some new inequalities related to the invariant means and uniformly bounded function sequences. Appl. Math. Lett. 2007, 20, 605–609. [Google Scholar] [CrossRef]
  24. Çoşkun, H.; Çakan, C. A class of statistical and σ-conservative matrices. Czechoslovak Math. J. 2005, 55, 791–801. [Google Scholar] [CrossRef]
  25. Çoşkun, H.; Çakan, C.; Mursaleen, M. On the statistical and σ-cores. Studia Math. 2003, 154, 29–35. [Google Scholar] [CrossRef]
  26. Kayaduman, K.; Furkan, H. Infinite matrices and σ(A)-core. Demonstr. Math. 2006, 39, 531–538. [Google Scholar] [CrossRef]
  27. Altay, B.; Başar, F. On the paranormed Riesiz sequence spaces of non-absolute type. Southeast Asian Bull. Math. 2005, 26, 701–715. [Google Scholar]
  28. Malkovsky, E.; Savaş, E. Matrix transformations between sequence spaces of generalized weighted means. Appl. Math. Comput. 2004, 147, 333–345. [Google Scholar] [CrossRef]
  29. Aydın, C.; Başar, F. On the new sequence spaces which include the spaces c0 and c. Hokkaido Math. J. 2004, 33, 383–398. [Google Scholar] [CrossRef]
  30. Aydın, C.; Başar, F. Some new paranormed sequence spaces. Inform. Sci. 2004, 160, 27–40. [Google Scholar] [CrossRef]
  31. Aydın, C.; Başar, F. Some new difference sequence spaces. Appl. Math.Comput. 2004, 157, 677–693. [Google Scholar] [CrossRef]
  32. Aydın, C.; Başar, F. Some new sequence spaces which include the spaces lp and l. Demonstr. Math. 2005, 38, 641–656. [Google Scholar]
  33. Altay, B.; Başar, F. Some new Euler sequence spaces of non-absolute type. Ukranian Math. J. 2005, 57, 1–17. [Google Scholar] [CrossRef]
  34. Şengönül, M.; Başar, F. Some new cesaro sequence spaces of non-absolute type which include thespaces c0 and c. Soochow J. Math. 2005, 31, 107–119. [Google Scholar]
  35. Tuğ, O.; Başar, F. On the Space of Nörlund Almost Null and Nörlund Almost Convergent Sequence. Filomat 2016, 30, 773–783. [Google Scholar] [CrossRef]
  36. Yeşilkayagil, M.; Başar, F. On the Paranormed Nörlund Sequence Space of Non-absolute Type. Abstr. Appl. Anal. 2014, 2014, 858704. [Google Scholar] [CrossRef]
  37. Yeşilkayagil, M.; Başar, F. Domain of the Nörlund Matrix in Some of Maddox’s Spaces. Proc. Natl. Sci. India Sect. A 2017, 87, 363–371. [Google Scholar] [CrossRef]
  38. Yaşar, F.; Kayaduaman, K. A Different Study on the Spaces of Generalized Fibonacci Difference bs and cs Spaces Sequence. Symmetry 2018, 10, 274. [Google Scholar] [CrossRef]
  39. Mears, F.M. Some Multiplication Theorems for the Nörlund Mean. Bull. Am. Math. Soc. 1935, 41, 875–880. [Google Scholar] [CrossRef]
  40. Mears, F.M. The Inverse Nörlund Mean. Ann. Math. 1943, 44, 401–409. [Google Scholar] [CrossRef]
  41. Lorentz, G.G. A contribution to the theory of divergent sequences. Acta Math. 1948, 80, 167–190. [Google Scholar] [CrossRef]
  42. Altay, B.; Başar, F. Certain topological properties and duals of the matrix domain of a triangle matrix in a sequence space. J. Math. Anal. Appl. 2007, 336, 632–645. [Google Scholar] [CrossRef]
  43. Stieglitz, M.; Tietz, H. Matrix transformationen von folgenräumen eine ergebnisübersicht. Math. Z. 1997, 154, 1–16. [Google Scholar] [CrossRef]
  44. Başar, F. Strongly conservative sequence to series matrix transformations. Erc. Üni. Fen Bil. Derg. 1989, 5, 888–893. [Google Scholar]
  45. Başar, F.; Çolak, R. Almost-conservative matrix transformations. Turkish J. Math. 1989, 13, 91–100. [Google Scholar]
  46. Başar, F.; Solak, İ. Almost-coercive matrix transformations. Rend. Mat. Appl. 1991, 11, 249–256. [Google Scholar]
  47. Tuğ, O. On the Domain of Nörlund Matrix in the Space of Bounded Variation Sequences. Eurasian J. Sci. Eng. 2017, 3, 111–120. [Google Scholar] [CrossRef]

Share and Cite

MDPI and ACS Style

Kayaduman, K.; Yaşar, F. On Domain of Nörlund Matrix. Mathematics 2018, 6, 268. https://0-doi-org.brum.beds.ac.uk/10.3390/math6110268

AMA Style

Kayaduman K, Yaşar F. On Domain of Nörlund Matrix. Mathematics. 2018; 6(11):268. https://0-doi-org.brum.beds.ac.uk/10.3390/math6110268

Chicago/Turabian Style

Kayaduman, Kuddusi, and Fevzi Yaşar. 2018. "On Domain of Nörlund Matrix" Mathematics 6, no. 11: 268. https://0-doi-org.brum.beds.ac.uk/10.3390/math6110268

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop