Existence of some Positive Solutions to Fractional Difference Equations
|
|
- Paulina Summers
- 7 years ago
- Views:
Transcription
1 International Journal of Difference Equations ISSN , Volume 10, Number, pp 1 3 (015 Existence of some Positive Solutions to Fractional Difference Equations Deepak B Pachpatte Dr Babasaheb Ambedkar Marathwada University Department of Mathematics Aurangabad, 3100, India pachpatte@gmailcom Arif S Bagwan Pimpri Chinchwad College of Engineering Department of First Year Engineering Nigdi, Pune, 110, India arifbagwan@gmailcom Amol D Khandagale Dr Babasaheb Ambedkar Marathwada University Department of Mathematics Aurangabad, 3100, India kamoldsk@gmailcom Abstract The main objective of this paper is to study the existence of solutions to some basic fractional difference equations The tool employed is Krasnosel skii fixed point theorem which guarantees at least two positive solutions AMS Subject Classifications: 39A10, 6A33 Keywords: Fractional difference equation, existence, positive solution 1 Introduction The theory of fractional calculus and associated fractional differential equations in continuous case has received great attention However, very limited progress has been done Received March 1, 015; Accepted July 6, 015 Communicated by Martin Bohner
2 Deepak Pachpatte, Arif Bagwan and Amol Khandagale in the development of the theory of finite fractional difference equations But, recently a remarkable research work has been made in the theory of fractional difference equations Diaz and Osler [10] introduced a discrete fractional difference operator defined as an infinite series Recently, a variety of results on discrete fractional calculus have been published by Atici and Eloe [,5,7] with delta operator Atici and Sengul [6] provided some initial attempts by using the discrete fractional difference equations to model tumor growth M Holm [11] extended his contribution to discrete fractional calculus by presenting a brief theory for composition of fractional sum and difference Furthermore, Goodrich [1 3] developed some results on discrete fractional calculus in which he used Krasnosel skii fixed point theorem to prove the existence of initial and boundary value problems Following this trend, H Chen, et al [13] and S Kang, et al [1] discussed about the positive solutions of BVPs of fractional difference equations depending on parameters H Chen, et al [8], in their article provided multiple solutions to fractional difference boundary value problems using various fixed point theorems In this paper, we consider the boundary value problems of fractional difference equation of the form v y(t = h(t + v 1f(t + v 1, y(t + v 1, (11 y(v = y(v + b = 0, (1 where t [0, b] N0, f : [v 1, v+b] Nv 1 R R is continuous, h : [v 1, v+b] Nv 1 [0,, 1 < v and is a positive parameter The present paper is organized as follows In Section, together with some basic definitions, we will demonstrate some important lemmas and theorem in order to prove our main result In Section 3, we establish the results for existence of solutions to the boundary value problem (11 (1 using Krasnosel skii fixed point theorem Preliminaries In this section, let us first collect some basic definitions and lemmas that are very much important to us in the sequel Definition 1 (See [3, 7] We define t v = Γ(t + 1 Γ(t + 1 v, (1 for any t and v for which right hand side is defined We also appeal to the convention that if t + v 1 is a pole of the Gamma function and t + 1 is not a pole, then t v = 0
3 Existence of Solutions to Fractional Difference Equations 3 Definition (See [3, 7] The v th fractional sum of a function f, for v > 0 is defined as, v f(t = v f(t, a := 1 Γ(v t v (t s 1 v 1 f(s, ( for t {a + v, a + v + 1, } =: N a+v We also define the v th fractional difference for t v = 0 by v a+vf(t := N v N f(t, where t N a+v and N N is chosen so that 0 N 1 < v N Now we give some important lemmas Lemma 3 (See [3, 7] Let t and v be any numbers for which t v and t v 1 are defined Then t v = vt v 1 s=a Lemma (See [3, 7] Let 0 N 1 < v N Then v v y(t = y(t + C 1 t v 1 + C t v + + C N t v N, (3 for some C i R with 1 i N Lemma 5 (See [7] Let 1 < v and f : [v 1, v +b] Nv 1 R R be given Then the solution of fractional boundary value problem v y(t = f(t+v 1, y(t+v 1, y(v = y(v + b + 1 = 0 is given by b+1 y(t = G(t, sf(s + v 1, y(s + v 1, ( where Green s function G : [v 1, v + b] Nv 1 [0, b + 1] N0 R is defined by t G (t, s = 1 v 1 (v + b s v 1 (v + b 1 v 1 (t s 1 v 1, 0 s < t v + 1 b + 1 Γv t v 1 (v + b s v 1 (v + b 1 v 1, 0 t v + 1 < s b + 1, Lemma 6 (See [7] The Green s function G(t, s given Lemma 5 satisfies 1 G (t, s 0 for each (t, s [v, v + b] Nv [0, b + 1] N0, max t [v,v+b] Nv G (t, s = G (s + v 1, s for each s [0, b] N0 and 3 There exists a number γ (0, 1 such that min G (t, s max G (t, s = γg (s + v 1, s ] t [v,v+b] Nv Nv t [ v+b, 3(v+b for s [0, b] N0 (5
4 Deepak Pachpatte, Arif Bagwan and Amol Khandagale Now we give the solution of fractional boundary value problem (11 (1, if it exists Theorem 7 Let f : [v 1, v + b] Nv 1 R R be given A function y is a solution to the discrete fractional boundary value problem (11 (1 iff it is a fixed point of the operator F y(t = G (t, s h (s + v 1 f (s + v 1, y (s + v 1, (6 where G(t, s is given in Lemma 5 Proof From Lemma, we find that a general solution to problem (11 (1 is y (t = v h(t + v 1f(t + v 1, y(t + v 1 + C 1 t v 1 + C t v, from the boundary condition y(v = 0, y (v = v h(t + v 1f(t + v 1, y(t + v 1 t=v + C 1 (v v 1 + C (v v = 1 Γv t v (t s 1 v 1 h(s + v 1f(t + v 1, y(t + v 1 + C Γ(v 1 = C Γ(v 1 = 0, therefore, C = 0 On the other hand, using boundary condition y(v + b = 0 t=v y (v + b = v h(t + v 1f(t + v 1, y(t + v 1 t=v+b + C 1 (v + b v 1 + C (v + b v = 1 Γv t v (t s 1 v 1 h(s + v 1f(t + v 1, y(t + v 1 + C 1 (v + b v 1 = 0, C 1 (v + b v 1 = 1 Γv C 1 = 1 Γv(v + b v 1 t=v+b t v (t s 1 v 1 h(s + v 1f(s + v 1, y(s + v 1 t=v+b (v + b s 1 v 1 h(s + v 1f(s + v 1, y(s + v 1
5 Existence of Solutions to Fractional Difference Equations 5 Using C 1 and C in y(t, we get y(t = 1 Γv t v 1 + Γv(v + b v 1 t v (t s 1 v 1 h(s + v 1f(s + v 1, y(s + v 1 (v + b s 1 v 1 h(s + v 1f(s + v 1, y(s + v 1 { t v t v 1 (v + b s 1 v 1 y(t = Γv(v + b v 1 } (t s 1v 1 h(s + v 1 Γv f(s + v 1, y(s + v 1 t v 1 (v + b s 1 v 1 + Γv(v + b v 1 h(s + v 1f(s + v 1, y(s + v 1 s=t v+1 y(t = G(t, sh(s + v 1f(s + v 1, y(s + v 1 (7 Consequently, we observe that y(t implies that whenever y is a solution of (11 (1, y is a fixed point of (6, as desired Theorem 8 (See [1] Let E be a Banach space, and let K E be a cone in E Assume that Ω 1 and Ω are open sets contained in E s t 0 Ω 1 and Ω 1 Ω, and let S : K (Ω \ Ω 1 K be a completely continuous operator such that either 1 Sy y for y K Ω 1 and Sy y for y K Ω ; Or Sy y for y K Ω 1 and Sy y for y K Ω Then S has at least one fixed point in K (Ω \ Ω 1 3 Main Result To prove our main result, let us state all required theorems for the existence of positive solutions to problem (11 (1 For this, let 1 η :=, G(s + v 1, sh(s + v 1 σ := 1 γ [ 3(b+v v+1] s=[ b+v v+1] G ([ ], b v + v, s
6 6 Deepak Pachpatte, Arif Bagwan and Amol Khandagale where η and σ are well defined by Lemma 6 and γ is the number given by Lemma 63 In the sequel, we present some conditions on f that will imply the existence of positive solutions H1: a number r > 0 such that f(t, y ηr whenever 0 y r H: a number r > 0 such that f(t, y σr whenever γr y r f(t, y H3: lim min = + y 0 + t [v,v+b] Nv y H: lim y + f(t, y min t [v,v+b] Nv y = + For our purpose, let E be a Banach space defined by { } E = y : [v, v + b] Nv R, y(v = y(v + b = 0, (31 with norm y = max y(t, t [v, v + b] N0 Also, define the cones { K 0 = y E : 0 y(t, min y(t γ y(t t [ v+b, 3(v+b ] } (3 In order to prove our first existence result, let us prove the following important lemma Lemma 31 F (K 0 K 0 ie, F leaves the cone K 0 invariant Proof Observe that min t [ v+b, 3(v+b ] which implies F y K 0 (F y(t = min t [ v+b, 3(v+b ] G(t, sh(s + v 1 f(s + v 1, y(s + v 1 γ G(t, sh(s + v 1f(s + v 1, y(s + v 1 γ max t [v,v+b] Nv G(t, sh(s + v 1 f(s + v 1, y(s + v 1 = γ F y,
7 Existence of Solutions to Fractional Difference Equations 7 Theorem 3 Assume that distinct numbers r 1 > 0 and r > 0 with r 1 < r such that f satisfies the condition H1 at r 1 and H at r Then the fractional boundary value problem (11 (1 has at least one positive solution say y 0 satisfying r 1 y 0 r Proof As F is completely continuous operator and F : K 0 K 0, let Ω 1 = {y K 0 : y r 1 } Then for any y K 0 Ω 1, we have from H1 F y = max t [v,v+b] Nv G (t, s h (s + v 1 f (s + v 1, y (s + v 1, G (s + v 1, s h (s + v 1 f (s + v 1, y (s + v 1 ηr 1 = r 1 = y G(s + v 1, sh(s + v 1 (33 Hence, F y = y for y K 0 Ω 1 Now, let Ω = {y K 0 : y r } Then for any y K 0 Ω we have from H F y(t = G (t, s h (s + v 1 f (s + v 1, y (s + v 1, [ 3(b+v v+1] s=[ b+v v+1] G (t, s h (s + v 1 f (s + v 1, y (s + v 1 G(t, sh(s + v 1 σr = r = y (3 Hence, F y y for y K 0 Ω So, it follows from Theorem 8 that there exists y 0 K 0 such that F y 0 = y 0 i e, fractional boundary value problem (11 (1 has a positive solution, say y 0 satisfying r 1 y 0 r In the next theorem, we give the existence of at least two positive solutions Theorem 33 Assume that f satisfies condition H1 and H3 Then the fractional boundary value problem (11 (1 has at least two positive solutions, say y 1 and y such that 0 y 1 < m < y
8 8 Deepak Pachpatte, Arif Bagwan and Amol Khandagale Proof From the assumptions, ε > 0 and r > 0 with r < m s t for 0 y r, (σ + ε f (t, y y, t [v, v + b] Nv ] [ [ b v b + v Let r 1 (0, r and + v Hence, for y Ω r, we have (F y + v = G, 3(b + v ] + v, s h(s + v 1 f(s + v 1, y(s + v 1 ([ ] b v (σ + ε G + v, s h(s + v 1 y (σ + ε y s=[ 3(v+b v+1] s=[ v+b v+1] G + v, s h(s + v 1 > σ y 1 σ = y = r (35 Thus, F y > y, for y K 0 Ω r On the other hand, suppose H3 holds, then there exists τ > 0 and R 1 > 0 such that (σ + τ f(t, y y, y R 1, t [v, v + b] Nv Now let R such that, R > max (m, R 1/ γ then, we have (F y + v = G + v, s h(s + v 1 f(s + v 1, y(s + v 1 ([ ] b v G + v, s h (s + v 1 (σ + τ y [ 3(b+v v+1] (σ + τ y s=[ b+v v+1] G (t, s h (s + v 1 σ y 1 σ = R (36
9 Existence of Solutions to Fractional Difference Equations 9 Hence, F y y for y K 0 Ω R Now, for any y Ω m, H1 implies that, f (t, y ηm, t [v, v + b] N v Let F y(t = G (t, s h (s + v 1 f (s + v 1, y (s + v 1 G (s + v 1, s h (s + v 1 ηm = ηm 1 η = m = y (37 Hence, F y y for y K 0 Ω m Therefore from Theorem 8, there are two fixed points y 1 and y of operator F s t 0 y 1 < m < y Theorem 3 Suppose conditions H and H hold, f > 0 for t [v, v + b] Nv Then the fractional boundary value problem (11 (1 has at least two positive solutions, say y 1 and y such that 0 y 1 < m < y Proof Suppose that H holds Then there exists ε > 0 (ε < η and 0 < r < m such (η ε that f (t, y y, 0 y r, t [v, v + b] Nv Let r 1 (0, r, then for y Ω r1, we have F y(t = G (t, s h (s + v 1 f (s + v 1, y (s + v 1 G (s + v 1, s h (s + v 1 < ηr 1 G (s + v 1, s h (s + v 1 (η ε r 1 < ηr 1 1 η = r 1 = y (38 Hence, we have F y < y for y Ω r1 On the other hand, suppose that H holds, then there exists 0 < τ < η and R 0 > 0 s t f (t, y τη, y R 0, t [v, v + b] Nv Denote M = max f(t, y Then (t,y [v,v+b] Nv [0,R 0 ] 0 f(t, y (τy + M, 0 y <
10 30 Deepak Pachpatte, Arif Bagwan and Amol Khandagale { } M Let R > max (η τ, m For y Ω R, we have F y = max t [v,v+b] Nv G (t, s h (s + v 1 f (s + v 1, y (s + v 1 G (s + v 1, s h (s + v 1 f (s + v 1, y (s + v 1 (τ y + M G(s + v 1, sh(s + v 1 = (τr + M 1 η < R = y (39 Hence, we have F y < y for y Ω R Finally, for any y Ω m, since γm y(t m for t have (F y + v = G f(s + v 1, y(s + v 1 > σγm [ 3(b+v v+1] s=[ b+v v+1] G [ b + v + v, s h(s + v 1 ] 3 (b + v,, we + v, s h (s + v 1 = m = y (310 Hence, F y > y, for y K 0 Ω m Therefore, by Theorem 8, the proof is complete Example 35 Consider the fractional boundary value problem ( y (t = 100 e(t+ t + 1 { ( y 1 t + 1 ( + y t + 1 } (311 ( y 3 ( 5 = 0, y = 0, (31 where v = 5 1 (, b = 5, f(t, y = 100 t y 1 + y, h (t = e t With a simple computation we can verify that η > 0001 f : [0, [0, [0, and h : [0, [0, and f(t, y satisfies the conditions H1 and H3, will have at least one positive solution
11 Existence of Solutions to Fractional Difference Equations 31 References [1] C S Goodrich, Continuity of solutions to discrete fractional initial value problems, Computers and Mathematics with Applications, vol 59 no 11, pp , 010 [] C S Goodrich, On a discrete fractional three-point boundary value problem, Journal of Difference Equations and Applications, vol 18, no 3, pp , 01 [3] C S Goodrich, Some new existence results for fractional difference equations, International Journal of Dynamical Systems and Differential Equations, vol 3, no1, pp 15 16, 011 [] F M Atici and P W Eloe, A transform method in discrete fractional calculus, International Journal of Difference Equations, vol, no, pp , 007 [5] F M Atici and P W Eloe, Initial value problems in discrete fractional calculus, Proceedings of American Mathematical Society, vol 137, no 3, pp , 009 [6] F M Atici and S Sengul, Modeling with fractional difference equations, Journal of Mathematical Analysis and Applications, vol 369, no 1, pp 1 9, 010 [7] F M Atici and P W Eloe, Two-point boundary value problems for finite fractional difference equations, International Journal of Difference Equations, vol 17, no, pp 5 56, 011 [8] H Chen, Y Cui, X Zhao, Multiple solutions to fractional difference boundary value problems, Abstract and Applied Analysis, vol 01, article , 01 [9] H L Gray, N F Zhang, On a new definition of the fractional difference, Mathematics of Computation, vol50, no18, pp ,1988 [10] J B Diaz, T J Osler, Differences of fractional order, Mathematics of Computation, vol 8, pp 185 0, 197 [11] M Holm, Sum and difference compositions in discrete fractional calculus, Cubo, vol 13, no 3, pp , 011 [1] R P Agarwal, M Meehan, and D O Regan, Fixed Point Theory and Applications, Cambridge University Press, Cambridge, UK, 001 [13] S Kang, X Zhao, H Chen, Positive solutions for boundary value problems of fractional difference equations depending on parameters, Advances in Difference Equations, vol 013, article 376, 013
12 3 Deepak Pachpatte, Arif Bagwan and Amol Khandagale [1] S Kang, Y Li, H Chen, Positive solutions for boundary value problems of fractional difference equations with nonlocal conditions, Advances in Difference Equations, vol 01, article 7, 01
On the Oscillation of Nonlinear Fractional Difference Equations
Mathematica Aeterna, Vol. 4, 2014, no. 1, 91-99 On the Oscillation of Nonlinear Fractional Difference Equations M. Reni Sagayaraj, A.George Maria Selvam Sacred Heart College, Tirupattur - 635 601, S.India
More informationExponential Functions and Laplace Transforms for Alpha Derivatives
Exponential Functions and Laplace Transforms for Alpha Derivatives ELVAN AKIN BOHNER and MARTIN BOHNER Department of Mathematics, Florida Institute of Technology Melbourne, Florida 3291, USA E-mail: eakin@math.unl.edu,
More informationCONSTANT-SIGN SOLUTIONS FOR A NONLINEAR NEUMANN PROBLEM INVOLVING THE DISCRETE p-laplacian. Pasquale Candito and Giuseppina D Aguí
Opuscula Math. 34 no. 4 2014 683 690 http://dx.doi.org/10.7494/opmath.2014.34.4.683 Opuscula Mathematica CONSTANT-SIGN SOLUTIONS FOR A NONLINEAR NEUMANN PROBLEM INVOLVING THE DISCRETE p-laplacian Pasquale
More information6.2 Permutations continued
6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of
More informationNote on some explicit formulae for twin prime counting function
Notes on Number Theory and Discrete Mathematics Vol. 9, 03, No., 43 48 Note on some explicit formulae for twin prime counting function Mladen Vassilev-Missana 5 V. Hugo Str., 4 Sofia, Bulgaria e-mail:
More information0 <β 1 let u(x) u(y) kuk u := sup u(x) and [u] β := sup
456 BRUCE K. DRIVER 24. Hölder Spaces Notation 24.1. Let Ω be an open subset of R d,bc(ω) and BC( Ω) be the bounded continuous functions on Ω and Ω respectively. By identifying f BC( Ω) with f Ω BC(Ω),
More informationMATH 425, PRACTICE FINAL EXAM SOLUTIONS.
MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More informationA new continuous dependence result for impulsive retarded functional differential equations
CADERNOS DE MATEMÁTICA 11, 37 47 May (2010) ARTIGO NÚMERO SMA#324 A new continuous dependence result for impulsive retarded functional differential equations M. Federson * Instituto de Ciências Matemáticas
More informationSCORE SETS IN ORIENTED GRAPHS
Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What
More informationON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction
ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING Abstract. In [1] there was proved a theorem concerning the continuity of the composition mapping, and there was announced a theorem on sequential continuity
More informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More informationModern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem
More information1 Error in Euler s Method
1 Error in Euler s Method Experience with Euler s 1 method raises some interesting questions about numerical approximations for the solutions of differential equations. 1. What determines the amount of
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More information88 CHAPTER 2. VECTOR FUNCTIONS. . First, we need to compute T (s). a By definition, r (s) T (s) = 1 a sin s a. sin s a, cos s a
88 CHAPTER. VECTOR FUNCTIONS.4 Curvature.4.1 Definitions and Examples The notion of curvature measures how sharply a curve bends. We would expect the curvature to be 0 for a straight line, to be very small
More informationThe Fourier Series of a Periodic Function
1 Chapter 1 he Fourier Series of a Periodic Function 1.1 Introduction Notation 1.1. We use the letter with a double meaning: a) [, 1) b) In the notations L p (), C(), C n () and C () we use the letter
More informationTOPIC 4: DERIVATIVES
TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
More informationSOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
More informationMultiplier-accelerator Models on Time Scales
International Journal of Statistics and Economics; [Formerly known as the Bulletin of Statistics & Economics ISSN 0973-7022)]; ISSN 0975-556X,; Spring 2010, Volume 4, Number S10; Copyright 2010 by CESER
More informationAn improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
This is the Pre-Published Version. An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines Q.Q. Nong, T.C.E. Cheng, C.T. Ng Department of Mathematics, Ocean
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More informationAvailability of a system with gamma life and exponential repair time under a perfect repair policy
Statistics & Probability Letters 43 (1999) 189 196 Availability of a system with gamma life and exponential repair time under a perfect repair policy Jyotirmoy Sarkar, Gopal Chaudhuri 1 Department of Mathematical
More informationA simple criterion on degree sequences of graphs
Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree
More informationMathematical Induction
Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How
More informationThe Black-Scholes pricing formulas
The Black-Scholes pricing formulas Moty Katzman September 19, 2014 The Black-Scholes differential equation Aim: Find a formula for the price of European options on stock. Lemma 6.1: Assume that a stock
More informationProperties of BMO functions whose reciprocals are also BMO
Properties of BMO functions whose reciprocals are also BMO R. L. Johnson and C. J. Neugebauer The main result says that a non-negative BMO-function w, whose reciprocal is also in BMO, belongs to p> A p,and
More informationTotal colorings of planar graphs with small maximum degree
Total colorings of planar graphs with small maximum degree Bing Wang 1,, Jian-Liang Wu, Si-Feng Tian 1 Department of Mathematics, Zaozhuang University, Shandong, 77160, China School of Mathematics, Shandong
More informationEvery Positive Integer is the Sum of Four Squares! (and other exciting problems)
Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationMultiple positive solutions of a nonlinear fourth order periodic boundary value problem
ANNALES POLONICI MATHEMATICI LXIX.3(1998) Multiple positive solutions of a nonlinear fourth order periodic boundary value problem by Lingbin Kong (Anda) and Daqing Jiang (Changchun) Abstract.Thefourthorderperiodicboundaryvalueproblemu
More informationTHE BANACH CONTRACTION PRINCIPLE. Contents
THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,
More informationF. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)
Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p
More informationWRITING PROOFS. Christopher Heil Georgia Institute of Technology
WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationThe Henstock-Kurzweil-Stieltjes type integral for real functions on a fractal subset of the real line
The Henstock-Kurzweil-Stieltjes type integral for real functions on a fractal subset of the real line D. Bongiorno, G. Corrao Dipartimento di Ingegneria lettrica, lettronica e delle Telecomunicazioni,
More informationInternational Journal of Information Technology, Modeling and Computing (IJITMC) Vol.1, No.3,August 2013
FACTORING CRYPTOSYSTEM MODULI WHEN THE CO-FACTORS DIFFERENCE IS BOUNDED Omar Akchiche 1 and Omar Khadir 2 1,2 Laboratory of Mathematics, Cryptography and Mechanics, Fstm, University of Hassan II Mohammedia-Casablanca,
More informationBargaining Solutions in a Social Network
Bargaining Solutions in a Social Network Tanmoy Chakraborty and Michael Kearns Department of Computer and Information Science University of Pennsylvania Abstract. We study the concept of bargaining solutions,
More informationAn inequality for the group chromatic number of a graph
Discrete Mathematics 307 (2007) 3076 3080 www.elsevier.com/locate/disc Note An inequality for the group chromatic number of a graph Hong-Jian Lai a, Xiangwen Li b,,1, Gexin Yu c a Department of Mathematics,
More informationSection 3.7. Rolle s Theorem and the Mean Value Theorem. Difference Equations to Differential Equations
Difference Equations to Differential Equations Section.7 Rolle s Theorem and the Mean Value Theorem The two theorems which are at the heart of this section draw connections between the instantaneous rate
More informationP. Jeyanthi and N. Angel Benseera
Opuscula Math. 34, no. 1 (014), 115 1 http://dx.doi.org/10.7494/opmath.014.34.1.115 Opuscula Mathematica A TOTALLY MAGIC CORDIAL LABELING OF ONE-POINT UNION OF n COPIES OF A GRAPH P. Jeyanthi and N. Angel
More informationFuzzy Differential Systems and the New Concept of Stability
Nonlinear Dynamics and Systems Theory, 1(2) (2001) 111 119 Fuzzy Differential Systems and the New Concept of Stability V. Lakshmikantham 1 and S. Leela 2 1 Department of Mathematical Sciences, Florida
More information36 CHAPTER 1. LIMITS AND CONTINUITY. Figure 1.17: At which points is f not continuous?
36 CHAPTER 1. LIMITS AND CONTINUITY 1.3 Continuity Before Calculus became clearly de ned, continuity meant that one could draw the graph of a function without having to lift the pen and pencil. While this
More information0 0 such that f x L whenever x a
Epsilon-Delta Definition of the Limit Few statements in elementary mathematics appear as cryptic as the one defining the limit of a function f() at the point = a, 0 0 such that f L whenever a Translation:
More informationThe Heat Equation. Lectures INF2320 p. 1/88
The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)
More informationMax-Min Representation of Piecewise Linear Functions
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 43 (2002), No. 1, 297-302. Max-Min Representation of Piecewise Linear Functions Sergei Ovchinnikov Mathematics Department,
More informationAdaptive Online Gradient Descent
Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650
More informationNotes on Complexity Theory Last updated: August, 2011. Lecture 1
Notes on Complexity Theory Last updated: August, 2011 Jonathan Katz Lecture 1 1 Turing Machines I assume that most students have encountered Turing machines before. (Students who have not may want to look
More informationA characterization of trace zero symmetric nonnegative 5x5 matrices
A characterization of trace zero symmetric nonnegative 5x5 matrices Oren Spector June 1, 009 Abstract The problem of determining necessary and sufficient conditions for a set of real numbers to be the
More informationHEAVISIDE CABLE, THOMSON CABLE AND THE BEST CONSTANT OF A SOBOLEV-TYPE INEQUALITY. Received June 1, 2007; revised September 30, 2007
Scientiae Mathematicae Japonicae Online, e-007, 739 755 739 HEAVISIDE CABLE, THOMSON CABLE AND THE BEST CONSTANT OF A SOBOLEV-TYPE INEQUALITY Yoshinori Kametaka, Kazuo Takemura, Hiroyuki Yamagishi, Atsushi
More informationTriangle deletion. Ernie Croot. February 3, 2010
Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,
More informationALMOST COMMON PRIORS 1. INTRODUCTION
ALMOST COMMON PRIORS ZIV HELLMAN ABSTRACT. What happens when priors are not common? We introduce a measure for how far a type space is from having a common prior, which we term prior distance. If a type
More informationLinear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold:
Linear Algebra A vector space (over R) is an ordered quadruple (V, 0, α, µ) such that V is a set; 0 V ; and the following eight axioms hold: α : V V V and µ : R V V ; (i) α(α(u, v), w) = α(u, α(v, w)),
More informationModeling and Performance Evaluation of Computer Systems Security Operation 1
Modeling and Performance Evaluation of Computer Systems Security Operation 1 D. Guster 2 St.Cloud State University 3 N.K. Krivulin 4 St.Petersburg State University 5 Abstract A model of computer system
More informationLecture 7: Finding Lyapunov Functions 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.243j (Fall 2003): DYNAMICS OF NONLINEAR SYSTEMS by A. Megretski Lecture 7: Finding Lyapunov Functions 1
More informationResearch Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization
Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 510838, 15 pages doi:10.1155/2010/510838 Research Article Stability Analysis for Higher-Order Adjacent Derivative
More informationn k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...
6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence
More informationContinuity of the Perron Root
Linear and Multilinear Algebra http://dx.doi.org/10.1080/03081087.2014.934233 ArXiv: 1407.7564 (http://arxiv.org/abs/1407.7564) Continuity of the Perron Root Carl D. Meyer Department of Mathematics, North
More informationCITY UNIVERSITY LONDON. BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION
No: CITY UNIVERSITY LONDON BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION ENGINEERING MATHEMATICS 2 (resit) EX2005 Date: August
More informationAn example of a computable
An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept
More informationSome Research Problems in Uncertainty Theory
Journal of Uncertain Systems Vol.3, No.1, pp.3-10, 2009 Online at: www.jus.org.uk Some Research Problems in Uncertainty Theory aoding Liu Uncertainty Theory Laboratory, Department of Mathematical Sciences
More informationSection 6.1 - Inner Products and Norms
Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,
More informationOPTIMAl PREMIUM CONTROl IN A NON-liFE INSURANCE BUSINESS
ONDERZOEKSRAPPORT NR 8904 OPTIMAl PREMIUM CONTROl IN A NON-liFE INSURANCE BUSINESS BY M. VANDEBROEK & J. DHAENE D/1989/2376/5 1 IN A OPTIMAl PREMIUM CONTROl NON-liFE INSURANCE BUSINESS By Martina Vandebroek
More informationarxiv:1112.0829v1 [math.pr] 5 Dec 2011
How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman Thomas P. Hayes arxiv:1112.0829v1 [math.pr] 5 Dec 2011 Abstract Consider a gambling game in which we are allowed to repeatedly
More informationALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION
ALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION Aldrin W. Wanambisi 1* School of Pure and Applied Science, Mount Kenya University, P.O box 553-50100, Kakamega, Kenya. Shem Aywa 2 Department of Mathematics,
More informationON SUPERCYCLICITY CRITERIA. Nuha H. Hamada Business Administration College Al Ain University of Science and Technology 5-th st, Abu Dhabi, 112612, UAE
International Journal of Pure and Applied Mathematics Volume 101 No. 3 2015, 401-405 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v101i3.7
More informationUnified Lecture # 4 Vectors
Fall 2005 Unified Lecture # 4 Vectors These notes were written by J. Peraire as a review of vectors for Dynamics 16.07. They have been adapted for Unified Engineering by R. Radovitzky. References [1] Feynmann,
More informationWHEN DOES A CROSS PRODUCT ON R n EXIST?
WHEN DOES A CROSS PRODUCT ON R n EXIST? PETER F. MCLOUGHLIN It is probably safe to say that just about everyone reading this article is familiar with the cross product and the dot product. However, what
More informationSome stability results of parameter identification in a jump diffusion model
Some stability results of parameter identification in a jump diffusion model D. Düvelmeyer Technische Universität Chemnitz, Fakultät für Mathematik, 09107 Chemnitz, Germany Abstract In this paper we discuss
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationTHE CONTRACTION MAPPING THEOREM
THE CONTRACTION MAPPING THEOREM KEITH CONRAD 1. Introduction Let f : X X be a mapping from a set X to itself. We call a point x X a fixed point of f if f(x) = x. For example, if [a, b] is a closed interval
More informationMATH 590: Meshfree Methods
MATH 590: Meshfree Methods Chapter 7: Conditionally Positive Definite Functions Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu MATH 590 Chapter
More informationLeft Jordan derivations on Banach algebras
Iranian Journal of Mathematical Sciences and Informatics Vol. 6, No. 1 (2011), pp 1-6 Left Jordan derivations on Banach algebras A. Ebadian a and M. Eshaghi Gordji b, a Department of Mathematics, Faculty
More informationToday s Topics. Primes & Greatest Common Divisors
Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime
More information8.1 Min Degree Spanning Tree
CS880: Approximations Algorithms Scribe: Siddharth Barman Lecturer: Shuchi Chawla Topic: Min Degree Spanning Tree Date: 02/15/07 In this lecture we give a local search based algorithm for the Min Degree
More informationA Network Flow Approach in Cloud Computing
1 A Network Flow Approach in Cloud Computing Soheil Feizi, Amy Zhang, Muriel Médard RLE at MIT Abstract In this paper, by using network flow principles, we propose algorithms to address various challenges
More information6. Define log(z) so that π < I log(z) π. Discuss the identities e log(z) = z and log(e w ) = w.
hapter omplex integration. omplex number quiz. Simplify 3+4i. 2. Simplify 3+4i. 3. Find the cube roots of. 4. Here are some identities for complex conjugate. Which ones need correction? z + w = z + w,
More informationSome remarks on Phragmén-Lindelöf theorems for weak solutions of the stationary Schrödinger operator
Wan Boundary Value Problems (2015) 2015:239 DOI 10.1186/s13661-015-0508-0 R E S E A R C H Open Access Some remarks on Phragmén-Lindelöf theorems for weak solutions of the stationary Schrödinger operator
More informationFINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROS-SHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS
FINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROS-SHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS Abstract. It is shown that, for any field F R, any ordered vector space structure
More informationSUM OF TWO SQUARES JAHNAVI BHASKAR
SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted
More informationMathematical Induction. Lecture 10-11
Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach
More information6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation
6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation Daron Acemoglu and Asu Ozdaglar MIT November 2, 2009 1 Introduction Outline The problem of cooperation Finitely-repeated prisoner s dilemma
More informationPractice with Proofs
Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using
More informationSection 4.4 Inner Product Spaces
Section 4.4 Inner Product Spaces In our discussion of vector spaces the specific nature of F as a field, other than the fact that it is a field, has played virtually no role. In this section we no longer
More informationSign changes of Hecke eigenvalues of Siegel cusp forms of degree 2
Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2 Ameya Pitale, Ralf Schmidt 2 Abstract Let µ(n), n > 0, be the sequence of Hecke eigenvalues of a cuspidal Siegel eigenform F of degree
More informationThe Mean Value Theorem
The Mean Value Theorem THEOREM (The Extreme Value Theorem): If f is continuous on a closed interval [a, b], then f attains an absolute maximum value f(c) and an absolute minimum value f(d) at some numbers
More informationLectures 5-6: Taylor Series
Math 1d Instructor: Padraic Bartlett Lectures 5-: Taylor Series Weeks 5- Caltech 213 1 Taylor Polynomials and Series As we saw in week 4, power series are remarkably nice objects to work with. In particular,
More informationLecture 10. Finite difference and finite element methods. Option pricing Sensitivity analysis Numerical examples
Finite difference and finite element methods Lecture 10 Sensitivities and Greeks Key task in financial engineering: fast and accurate calculation of sensitivities of market models with respect to model
More information4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
More informationON FIBONACCI NUMBERS WITH FEW PRIME DIVISORS
ON FIBONACCI NUMBERS WITH FEW PRIME DIVISORS YANN BUGEAUD, FLORIAN LUCA, MAURICE MIGNOTTE, SAMIR SIKSEK Abstract If n is a positive integer, write F n for the nth Fibonacci number, and ω(n) for the number
More informationSome Problems of Second-Order Rational Difference Equations with Quadratic Terms
International Journal of Difference Equations ISSN 0973-6069, Volume 9, Number 1, pp. 11 21 (2014) http://campus.mst.edu/ijde Some Problems of Second-Order Rational Difference Equations with Quadratic
More informationOPTIMAL SELECTION BASED ON RELATIVE RANK* (the "Secretary Problem")
OPTIMAL SELECTION BASED ON RELATIVE RANK* (the "Secretary Problem") BY Y. S. CHOW, S. MORIGUTI, H. ROBBINS AND S. M. SAMUELS ABSTRACT n rankable persons appear sequentially in random order. At the ith
More informationLabeling outerplanar graphs with maximum degree three
Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us
More informationOn Integer Additive Set-Indexers of Graphs
On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that
More informationHøgskolen i Narvik Sivilingeniørutdanningen STE6237 ELEMENTMETODER. Oppgaver
Høgskolen i Narvik Sivilingeniørutdanningen STE637 ELEMENTMETODER Oppgaver Klasse: 4.ID, 4.IT Ekstern Professor: Gregory A. Chechkin e-mail: chechkin@mech.math.msu.su Narvik 6 PART I Task. Consider two-point
More information