On Some Basic Properties of Geometric Real Sequences

Similar documents
G-CALCULUS. Keywords: Geometric real numbers; geometric arithmetic; bigeometric derivative.

Solvability of Bigeometric Differential Equations by Numerical Methods. Key Words: Bigeometric-calculus, geometric real numbers, geometric arithmetic.

Maejo International Journal of Science and Technology

Theory of Generalized k-difference Operator and Its Application in Number Theory

Generalized Bell polynomials and the combinatorics of Poisson central moments

2M2. Fourier Series Prof Bill Lionheart

4 Separation of Variables

arxiv: v1 [math.fa] 23 Aug 2018

4 1-D Boundary Value Problems Heat Equation

Some Measures for Asymmetry of Distributions

Research Article On the Lower Bound for the Number of Real Roots of a Random Algebraic Equation

Week 6 Lectures, Math 6451, Tanveer

Summation of p-adic Functional Series in Integer Points

ORTHOGONAL MULTI-WAVELETS FROM MATRIX FACTORIZATION

Lecture Notes 4: Fourier Series and PDE s

CS229 Lecture notes. Andrew Ng

Completion. is dense in H. If V is complete, then U(V) = H.

BASIC NOTIONS AND RESULTS IN TOPOLOGY. 1. Metric spaces. Sets with finite diameter are called bounded sets. For x X and r > 0 the set

Research Article Numerical Range of Two Operators in Semi-Inner Product Spaces

Integrating Factor Methods as Exponential Integrators

Math 124B January 17, 2012

Lecture 11. Fourier transform

C. Fourier Sine Series Overview

A natural differential calculus on Lie bialgebras with dual of triangular type

Mat 1501 lecture notes, penultimate installment

Establishment of Weak Conditions for Darboux- Goursat-Beudon Theorem

An explicit Jordan Decomposition of Companion matrices

Course 2BA1, Section 11: Periodic Functions and Fourier Series

The Group Structure on a Smooth Tropical Cubic

A Two-Parameter Trigonometric Series

Discrete Bernoulli s Formula and its Applications Arising from Generalized Difference Operator

ANALOG OF HEAT EQUATION FOR GAUSSIAN MEASURE OF A BALL IN HILBERT SPACE GYULA PAP

NOISE-INDUCED STABILIZATION OF STOCHASTIC DIFFERENTIAL EQUATIONS

ALGORITHMIC SUMMATION OF RECIPROCALS OF PRODUCTS OF FIBONACCI NUMBERS. F. = I j. ^ = 1 ^ -, and K w = ^. 0) n=l r n «=1 -*/!

Problem set 6 The Perron Frobenius theorem.

Formulas for Angular-Momentum Barrier Factors Version II

Convergence Property of the Iri-Imai Algorithm for Some Smooth Convex Programming Problems

Uniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines is Strongly conp-complete

On the New q-extension of Frobenius-Euler Numbers and Polynomials Arising from Umbral Calculus

Product Cosines of Angles between Subspaces

MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES

Another Class of Admissible Perturbations of Special Expressions

SOME BASIC RESULTS ON THE SETS OF SEQUENCES WITH GEOMETRIC CALCULUS

Consistent linguistic fuzzy preference relation with multi-granular uncertain linguistic information for solving decision making problems

JENSEN S OPERATOR INEQUALITY FOR FUNCTIONS OF SEVERAL VARIABLES

Dual Integral Equations and Singular Integral. Equations for Helmholtz Equation

On prime divisors of remarkable sequences

PHYS 110B - HW #1 Fall 2005, Solutions by David Pace Equations referenced as Eq. # are from Griffiths Problem statements are paraphrased

$, (2.1) n="# #. (2.2)

THINKING IN PYRAMIDS

UNIFORM CONVERGENCE OF MULTIPLIER CONVERGENT SERIES

1 Heat Equation Dirichlet Boundary Conditions

Gauss Law. 2. Gauss s Law: connects charge and field 3. Applications of Gauss s Law

6 Wave Equation on an Interval: Separation of Variables

An approximate method for solving the inverse scattering problem with fixed-energy data

B. Brown, M. Griebel, F.Y. Kuo and I.H. Sloan

Homogeneity properties of subadditive functions

Restricted weak type on maximal linear and multilinear integral maps.

Volume 13, MAIN ARTICLES

Math 124B January 31, 2012

ADELIC ANALYSIS AND FUNCTIONAL ANALYSIS ON THE FINITE ADELE RING. Ilwoo Cho

On the Number of Limit Cycles for Discontinuous Generalized Liénard Polynomial Differential Systems

u(x) s.t. px w x 0 Denote the solution to this problem by ˆx(p, x). In order to obtain ˆx we may simply solve the standard problem max x 0

Homework 5 Solutions

A Comparison Study of the Test for Right Censored and Grouped Data

Math 220B - Summer 2003 Homework 1 Solutions

221B Lecture Notes Notes on Spherical Bessel Functions

Smoothness equivalence properties of univariate subdivision schemes and their projection analogues

BALANCING REGULAR MATRIX PENCILS

Fourier Series. 10 (D3.9) Find the Cesàro sum of the series. 11 (D3.9) Let a and b be real numbers. Under what conditions does a series of the form

(f) is called a nearly holomorphic modular form of weight k + 2r as in [5].

Stochastic Automata Networks (SAN) - Modelling. and Evaluation. Paulo Fernandes 1. Brigitte Plateau 2. May 29, 1997

DYNAMIC RESPONSE OF CIRCULAR FOOTINGS ON SATURATED POROELASTIC HALFSPACE

Numerical solution of one dimensional contaminant transport equation with variable coefficient (temporal) by using Haar wavelet

Wavelet Galerkin Solution for Boundary Value Problems

Discrete Techniques. Chapter Introduction

EXPONENTIAL DECAY OF SOLUTIONS TO A VISCOELASTIC EQUATION WITH NONLINEAR LOCALIZED DAMPING

arxiv: v1 [math.co] 17 Dec 2018

Reichenbachian Common Cause Systems

Wavelet shrinkage estimators of Hilbert transform

PRIME TWISTS OF ELLIPTIC CURVES

Differential equations associated with higher-order Bernoulli numbers of the second kind

Introduction to Simulation - Lecture 14. Multistep Methods II. Jacob White. Thanks to Deepak Ramaswamy, Michal Rewienski, and Karen Veroy

Related Topics Maxwell s equations, electrical eddy field, magnetic field of coils, coil, magnetic flux, induced voltage

MARKOV CHAINS AND MARKOV DECISION THEORY. Contents

Statistical Learning Theory: A Primer

Maximum likelihood decoding of trellis codes in fading channels with no receiver CSI is a polynomial-complexity problem

arxiv: v1 [math.nt] 13 Jan 2009

Lecture Note 3: Stationary Iterative Methods

Research Article Building Infinitely Many Solutions for Some Model of Sublinear Multipoint Boundary Value Problems

b n n=1 a n cos nx (3) n=1

The Partition Function and Ramanujan Congruences

On the Goal Value of a Boolean Function

A proposed nonparametric mixture density estimation using B-spline functions

Input-to-state stability for a class of Lurie systems

Factorizations of Invertible Symmetric Matrices over Polynomial Rings with Involution

A Brief Introduction to Markov Chains and Hidden Markov Models

Research Article The Diagonally Dominant Degree and Disc Separation for the Schur Complement of Ostrowski Matrix

Some Properties Related to the Generalized q-genocchi Numbers and Polynomials with Weak Weight α

A CLUSTERING LAW FOR SOME DISCRETE ORDER STATISTICS

Transcription:

On Some Basic Properties of eometric Rea Sequences Khirod Boruah Research Schoar, Department of Mathematics, Rajiv andhi University Rono His, Doimukh-791112, Arunacha Pradesh, India Abstract Objective of this paper is to introduce geometric rea sequence and discuss their basic properties. Keywords Non-Newtonian Cacuus, geometric Arithmetic, geometric integers, geometric rea numbers. 1. INTRODUCTION In mid-seventeenth century, Newton and Leibniz created cassica cacuus considering the deviations by difference, i.e. as (x + ) f(x). In 1967 Michae rossman and Robert Katz created the first system of non-newtonian cacuus [10] and is caed Mutipicative Cacuus or exponentia cacuus considering the deviation by ratio, i.e. as f(x+a). The operations of mutipicative cacuus are caed as mutipicative derivative f(a) and mutipicative integra. In 1970 they had created infinite famiy of non-newtonian cacui, each of which are different from the cassica cacuus of Newton and Leibniz. After rossman and Katz s pioneering creation of non-newtonian cacuus, many researches have been deveoping the fied of non-newtonian cacuus and its appications. We refer rossman and Katz [10], Staney [24], Bashirov et a. [2, 3], rossman [9], K. Boruah and B. Hazarika [13, 14, 15, 16, 17, 18] for eements of mutipicative cacuus and its appications. An extension of mutipicative cacuus to functions of compex variabes is handed in Bashirov and Riza [1], Uzer [27],Bashirov et a. [3], Çakmak and Başar[5], Tekin and Başar [25], Türkmen and Başar [26]. Kadak and Özük studied the generaized Runge-Kutta method with respect to non-newtonian cacuus. Kadak et a [28] studied certain new types of sequence spaces over the Non- Newtonian Compex Fied. eometric cacuus is aso a type of non-newtonian cacuus. It provides differentiation and integration toos based on mutipication instead of addition. Every property in Newtonian cacuus has an anaog in mutipicative cacuus. eneray speaking mutipicative cacuus is a methodoogy that aows one to have a different ook at probems which can be investigated via cacuus. In some cases, for exampe for growth reated probems, the use of mutipicative cacuus is advocated instead of a traditiona Newtonian one. The main aim of this paper is to discuss about the basic properties of geometric sequences. Before we estabish new resuts, we reca the construction of arithmetics generated by different generators and the geometric arithmetic, which is the keyword of the whoe artice. 2. α ENERATOR AND EOMETRIC REAL FIELD A generator is a one-to-one function whose domain is the set of rea numbers, R and range is a set B R. For exampe, the identity function I and the exponentia function exp are generators. We consider any generator α with ream i.e. domain, say, A and range B, by α aritmetic, we mean the arithmetic whose operations and ordering reation are defined as foows: forx, y A, where A is a domain of the function α. α addition x+y = α[α 1 (x) + α 1 (y)] α subtraction x y = α[α 1 (x) α 1 (y)] α mutipication x y = α[α 1 (x) α 1 (y)] α division x/y = α[α 1 (x)/α 1 (y)] α order x < y α 1 x < α 1 y. It is to be noted that each generator generates exacty one arithmetic and each arithmetic is generated by exacty one generator. For exampe, if we choose the exponentia function exp as an α generator defined by α(x) = e z for x R and hence α 1 (x) = nx, then α aritmetic turns out to geometric arithmetic as foows: ISSN: 2231-5373 http://www.ijmttjourna.org Page 111

geometric addition x y = α[α 1 (x) + α 1 (y)] = e (nx +ny ) = x. y geometric subtraction x y = α[α 1 (x) α 1 (y)] = e (nx ny ) = x y, y 0 geometric mutipication x y = α[α 1 (x) α 1 (y)] = e (nx ny ) = x ny geometric division x y = α[α 1 (x)/α 1 (y)] = e (nx ny) = xn y, y 1. Simiary, the identity function generates cassica arithmetic. It is obvious that n(x) < n(y) if x < y for x, y R +. That is, x < y α 1 (x) < α 1 (y). So, without oss of generaity, we use x < y instead of the geometric order x < y. C. Türkmen and F. Başardefined the sets of geometric integers, geometric rea numbers and geometric compex numbers Z(), R() and C(), respectivey, as foows: Z() = {e x : x Z} R() = {e x : x R} = R^ + {0} C() = {e z : z C} = C {0}. If we take extended rea number ine, then R() = [0, ]. (R(),, )is a fied with geometric zero 1 and geometric identity e, since (1). (R(), ) is a geometric additive Abeian group with geometric zero 1, (2). (R() {1}, ) is a geometric mutipicative Abeian group with geometric identity e, (3). is distributive over. But (C(),, ) is not a fied, however, geometric binary operation is not associative in C(). For, we take x = e 1/4, y = e 4 and z = e (1+iπ /2) = ie. Then (x y) z = e z = z = ie Butx (y z) = x e 4 = e. Let us define geometric positive rea numbers and geometric negative rea numbers as foows: R + = x R : x > 1 R = x R : x < 1. 2.1 Some Usefu Reations between eometric Operations and Ordinary Arithmetic Operations: For a x, y R() x y = xy x y = x/y x y = x ny = y nx 1 a b y = a b ny a n y a y = bn y = b y a b c d = a b n c d = b a n c d = b a n d c = b a d c x y or x y = x 1 n y, y 1 x 2 = x x = x nx x p = x np 1 x x = e (nx) 1 2 ISSN: 2231-5373 http://www.ijmttjourna.org Page 112

x 1 = e 1 og x x e = x and x 1 = x e n x = x x..... (upto n numberof x) = x n Thus x 1. x 2 = x e y = e y x y = x y x y x y x y = x y x y x y x = x, if x > 1 1, if x = 1 1, x if 0 < x < 1. 0 1 x y = y x, i. e. in short x y = y x. Further e x = e x hods for a x Z +. Thus the set of a geometric integers turns out to the foowing: Z() = {..., e 3, e 2, e 1, e 0, e 1, e 2, e 3,... } = {..., e 3, e 2, e, 1, e, e 2, e 3,... }. 3. MAIN RESULTS: EOMETRIC REAL SEQUENCE A function whose domain is the set N of natura numbers and range a set of geometric rea numbers is caed a geometric rea sequence. We denote geometric rea sequence as S: N R(). Since, we wi discuss about geometric rea sequences ony, we sha use the term geometric sequence to denote geometric rea sequence. A geometric sequence wi be denoted by {S n } or { S 1, S 2, S 3,..., S n,... } where n N. Numbers S 1, S 2, S 3,... wi be caed first term, second term, third term, of the sequence, respectivey. As we as the ordinary rea sequence, a the terms of geometric sequence wi be treated as distinct terms athough some terms are equa in different situations. Exampe of geometric sequence: 1. {S n } = {e ( 1)n, n N}. 2. {S n } = {e n, n N}. 3. {S n } = {e 1+( 1)n, n N}. 3.1 Bounds of eometric Sequence: It is obvious that the set R() = R + {0} of geometric rea numbers is bounded beow. So, geometric sequences are aways bounded beow. A geometric sequence is said to be bounded if it is bounded above. That is, a sequence {S n } is bounded if there exists a rea number K such that S n K, n N. 3.2 -Convergence of eometric Sequences: Definition:3.1. A geometric sequence {S n } is said to be convergent to a rea number > 0 if for ε > 1, there exists a positive integer m depending on ε such that S n < ε, for a n m.in ordinary sense ε < S n < ε for a n m. In other word, terms of the sequence approach the vaue by ratio as n becomes arger and arger. Symboicay, we write x a S n = or S n ISSN: 2231-5373 http://www.ijmttjourna.org Page 113

and we say that the sequence geometricay converges to or -convergent to. Since, ε < S n < ε, for a n m, hence infinite number of terms ie to the eft of ε and infinite number of terms ie to the right of ε. Theorem 3.1.-convergent sequence are bounded. Proof. Let the geometric sequence {S n } converge to. Then for given ε > 1, there exists a positive integer m such that < S ε n < ε, for a n m. Now, since ε > 1 and > 0, hence and ε are finite numbers. Let ε L = min{ ε, S 1, S 2,.., S m 1 }. U = max{ε, S 1, S 2,.., S m 1 }. Then, L S n U, for a n m. Hence the sequence is bounded. Theorem 3.2.Boundedness need not impy geometric convergence. Proof. Let us consider the sequence {S n }, where S n = e ( 1)n, n N such thats n. Then for ε = e, m N, such that ε < S n < ε n m e < e( 1)n < e e < e( 1)2m < e and e < 1 e( 1)2m < e < e < e e and e < e 1 < e e 2 < 1 < and < 1 < e2 1 < and < 1 which is impossibe at the same time. Hence, the sequence is not convergent. Aso, it can be proved that a geometric sequence can not -converse to more than one imits. 3.3 -Limit of a Function: According to rossman and Katz [10], geometric imit of a positive vaued function defined in a positive interva is same to the ordinary imit. We have defined -imit of a function with the hep of geometric arithmetic in as foows: A function f, which is positive in a given positive interva, is said to tend to the imit > 0 as x tends to a R, if, corresponding to any arbitrariy chosen number ε > 1, however sma(but greater than 1), there exists a positive number δ > 1, such that 1 < f(x) < ε for a vaues of x for which 1 < x a < δ. We write f(x) = x a Here, or f(x). x a < δ x a < δ 1 δ < x a < δ Simiary, f(x) < ε < f(x) < ε. ε a < x < aδ. δ Thus, in ordinary sense, f(x) means that for any given positive rea number ε > 1,no matter however coser to 1, a finite number δ > 1 such that f(x) ], ε[ for every x ] a, aδ[.it is to be noted that ε δ engths of the open intervas ] a, aδ[ and ], ε[ decreases as δ and ε respectivey decreases to 1. Therefore, as ε δ ε ISSN: 2231-5373 http://www.ijmttjourna.org Page 114

decreases to 1, f(x) becomes coser and coser to, as we as x becomes coser and coser to a as δ decreases to 1. Hence, is aso the ordinary imit of f(x). i.e. f x f x.in other words, we can say that -imit and ordinary imit are same for bipositive functions whose functiona vaues as we as arguments are positive in the given interva. Ony difference is that in -cacuus we approach the imit geometricay, but in ordinary cacuus we approach the imit ineary. A function f is said to tend to imit as x tends to a from the eft, if for each ε > 1 (however sma), there exists δ > 1 such that f(x) < ε when a/δ < x < a.in symbos, we write f(x) = or f(a 1) =. x a Simiary, a function f is said to tend to imit as x tends to a from the right, if for each ε > 1(however sma), there exists δ > 1 such that f(x) < ε when a < x < aδ.in symbos, we then write f(x) = or f(a + 1) =. x a+ If f(x) is negative vaued in a given interva, it wi be said to tend to a imit < 0 if for ε > 1, δ > 1 such that f(x) ]ε, ε [ whenever x ] a δ, aδ[. 3.4 -Continuity of a Function[16]: A function f is said to be -continuous at x = a if 1. f(a) i.e., the vaue of f(x) at x = a, is a definite number, 2. the -imit of the function f(x) as x a exists and is equa to f(a). Aternativey, a function f is said to be -continuous at x = a, if for arbitrariy chosenε > 1, however sma, there exists a number δ > 1 such that f(x) f(a) < ε for a vaues of x for which, x a < δ. On comparing the above definitions of imits and continuity, we can concude that a function f is continuous at x = a if f(x) im x a f(a) = 1. 3.5 -Limit Point of a eometric Sequence: A rea number ξ is said to be a -imit point of a geometric sequence {S n } if for a given ε > 1 however sma but greater than 1, S n ] ξ, ξ[ for an infinite number of vaues of n N. Thus, ξ is a imit point of the ε sequence if every neighborhood of ξ contains an infinite number of members of the sequence. It can be easiy proved that Bozano-Weierstrass Theorem is aso vaid for infinite set of geometric rea numbers and geometric sequences. Theorem 3.1 (Cauchy s genera principe of geometric convergence). A necessary and sufficient condition for the convergence of a geometric sequence {S n } is that, for ε > 1 there exists a positive integer m 0 such that S n S m < ε, n, m m 0. That is, S m +1 S m +2 S n < ε, n, m m 0 S m +1 S m +2 S n < ε. Equivaenty, we can say that the sequence {S n } is convergent if and ony if for ε > 1 there exists a positive integer m such that S n+p S n < ε, n m, p 1. Theorem3.2 If{a n } and {b n } be two convergent sequences such that ima n = a, imb n = b, then for a n N 1. im(a n b n ) = a b, 2. im(a n b n ) = a b, 3. im(a n b n ) = a b, ISSN: 2231-5373 http://www.ijmttjourna.org Page 115

4. im(a n b n ) = a b. Proof. (i) We have discussed that in case of bi-positive functions, geometric imit and ordinary imit are same. Since terms of a geometric sequence are aways positive, hence ima n = a ima n = a and imb n = b imb n = b.now, (ii) (iii) (iv) Proof is simiar. im(a n b n ) = im(a n b n ) = im(a n b n ) = im(a n )im(b n ) = ab. im(a n b n ) = im(a n /b n ) = im(a n /b n ) = im(a n )/im(b n ) = a/b = a b. im(a n b n ) = im (a n ) n(b n ) = im (a n ) n(b n ) = im e n(a n ).n (b n ) = e im n (a n ).n (b n ) na.nb = e = a n (b) = a b. Theorem3.3 If ima n =, such that > 0, then a 1 a 2... a n e n =. Proof. We know that, if a positive term series {a n } converges to positive number, then im a 1 a 2... a n 1 n =.Since, terms of a geometric sequence age aways positive and ima n = ima n =, hence a 1 a 2... a n e n = im a 1 a 2... a n 1/n (e n ) = im a 1 a 2... a 1/n n = im a 1 a 2... a 1/n n =. 5. ACKNOWLEDMENT It is peasure to thank Professor Bipan Hazarika, Department of Mathematics, Rajiv andhi University, Itanagar, for his constructive suggestions and corrections made for the improvement of this paper as we as eometric cacuus. 6. CONCLUSION Here we have discussed about some basic properties of geometric rea sequences. In [13] we have introduced geometric difference sequence spaces which are based on geometric arithmetic. Here we have just introduce geometric rea sequences, -imit, -continuity and their basic properties which wi be hepfu for the deveopment of the eometric Cacuus. REFERENCES [1] Bashirov, M. Riza, On Compex mutipicative differentiation, TWMS J. App. Eng. Math. 1(1)(2011), 75-85. [2] A. E. Bashirov, E. Misiri, Y. Tandoǧdu, A. Özyapici, On modeing with mutipicative differentia equations, App. Math. J. Chinese Univ., 26(4)(2011), 425-438. [3] A. E. Bashirov, E. M. Kurpinar, A. Özyapici, Mutipicative Cacuus and its appications, J. Math. Ana. App., 337(2008), 36-48. [4] F. Başar,, Summabiity Theory and Its Appications, Bentham Science Pubishers, e-books, Monographs, xi+405 sf., Istanbu- 2012, ISBN:978-1-60805-420-6. [5] A. F. Çakmak, F. Başar, On Cassica sequence spaces and non-newtonian cacuus, J. Inequa. App. 2012, Art. ID 932734, 12pp. ISSN: 2231-5373 http://www.ijmttjourna.org Page 116

[6] Richard. Cooke, Infinite Matrices and Sequence Spaces, Macmian and Co., London, 1950. U. [7] Kadak, Determination of Köthe-Toepitz duas over non-newtonian Compex Fied, The Scientific Word Journa, Voume 2014, Artice ID 438924, 10 pages. [8] D. J. H. aring, The β- and γ-duaity of sequence spaces, Proc. Camb. Phi. Soc., 63(1967), 963-981. [9] M. rossman, Bigeometric Cacuus: A System with a scae-free Derivative, Archimedes Foundation, Massachusetts, 1983. [10] M. rossman, R. Katz, Non-Newtonian Cacuus, Lee Press, Piegon Cove, Massachusetts, 1972. [11] J. rossman, M. rossman, Katz, The First Systems of Weighted Differentia and Integra Cacuus, University of Michigan. [12] Jane rossman,meta-cacuus: Differentia and Integra, University of Michigan. [13] K. Boruah and B. Hazarika, Appication of eometric Cacuus in Numerica Anaysis and Difference Sequence Spaces, Journa of Mathematica Anaysis and Appications, SCI, Esevier Pubication 449(2)(2017), 1265-1285. [14] K. Boruah and B. Hazarika, On Some eneraized eometric Difference Sequence Spaces, Proyecciones Journa of Mathematics (accepted). [15] K. Boruah and B. Hazarika, Some Basic Properties of Cacuus and Its Appications in Numerica Anaysis, Numerica Functiona Anaysis and Optimization (under review). [16] K. Boruah and B. Hazarika, Cacuus, TWMS Journa of Appied and Engineering Mathematics (accepted), ESCI. [17] K. Boruah and B. Hazarika, Soution of Bigeometric-Differentia Equations by Numerica Methods, Numerica Functiona Anaysis and Optimization (under review). [18] K. Boruah and B. Hazarika, Bigeometric Integra Cacuus, TWMS Journa of Appied and Engineering Mathematics (accepted), ESCI. [19] H. Kizmaz, On Certain Sequence Spaces, Canad. Math. Bu., 24(2)(1981), 169-176. [20]. Köthe, Topitz, Vector Spaces I, Springer-Verag, 1969. [21]. Köthe, O. Topitz, Linear Raumemitunendichenkoordinaten und Ring unendichenmatrizen, J. F. Reine u. angew Math., 171(1934), 193-226. [22] I.J. Maddox, Infinite Matrices of Operators, Lecture notes in Mathematics, 786, Springer-Verag(1980). [23] MikaiEt and RifatÇoak, On Some eneraized Difference Sequence Spaces, Soochow J. Math., 21(4), 377-386. [24] D. Staney, A mutipicative cacuus, Primus IX 4 (1999) 310-326. [25] S. Tekin, F. Başar, Certain Sequence spaces over the non-newtonian compex fied, Abstr. App. Ana., 2013. Artice ID 739319, 11 pages. [26] CengizTürkmen and F. Başar, Some Basic Resuts on the sets of Sequences with eometric Cacuus, Commun. Fac. Fci. Univ. Ank. Series A1. Vo 1. No 2(2012) Pages 17-34. [27] A. Uzer, Mutipicative type Compex Cacuus as an aternative to the cassica cacuus, Comput. Math. App., 60(2010), 2725-2737. [28] Ugur Kadak and Hakan Efe, Matrix Transformation between Certain Sequence Spaces over the Non-Newtonian Compex Fied,Hindawi Pubishing Corporation, The Scientific Word Journa, Voume 2014, Artice ID 705818, 12 pages. ISSN: 2231-5373 http://www.ijmttjourna.org Page 117