Explicit bounds for second-order difference equations and a solution to a question of Stević
|
|
- Jasmine Lynette Ford
- 7 years ago
- Views:
Transcription
1 J. Math. Anal. Appl Explicit bounds for second-order difference equations and a solution to a question of Stević Kenneth S. Berenhaut,1, Eva G. Goedhart Department of Mathematics, Wake Forest University, Winston-Salem, NC 27109, USA Received 24 June 2004 Available online 19 November 2004 Submitted by J. Henderson Abstract This note gives explicit, applicable bounds for solutions of a wide class of second-order difference equations with nonconstant coefficients. Among the applications is an affirmative answer to a recent question of Stević Elsevier Inc. All rights reserved. Keywords: Explicit bounds; Applicable bounds; Second-order linear difference equations; Growth rates; Nonconstant coefficients 1. Introduction This paper studies explicit, applicable growth rates for second-order difference equations. In particular, we will consider equations of the form b i = 2 + gi 1 b i hi 1 b i 2, 1 for i 2, and provide sharp inequalities for {b i } in terms of the sequences {gi} and {hi}, and the initial values b 0 and b 1. Solutions of difference equations of the form in 1 * Corresponding author. addresses: berenhks@wfu.edu K.S. Berenhaut, goedeg3@wfu.edu E.G. Goedhart. 1 The author acknowledges financial support from a Sterge Faculty Fellowship X/$ see front matter 2004 Elsevier Inc. All rights reserved. doi: /j.jmaa
2 2 K.S. Berenhaut, E.G. Goedhart / J. Math. Anal. Appl have been studied by many authors cf. [2 4,6 13]. Often the study has focused on the understanding of oscillatory or asymptotic behavior. Our main theorem Theorem 2 implies the following result which partially answers a question of Stević[8]. Theorem 1. Suppose that c 0 and {b i } satisfies 1, with gi = c/i 2. Then, for n 0, b n b 0 + b 1 n k c, 2 χ c where k c = 1 + 4c and { 1, if 0 c 2 or c 6, χ c = 2 kc ck c 22 kc c, if 2 <c<6. Note that c = k c k c 1. Hence, by Lemma 2a, in Section 3, for 2 c 6i.e., 2 k c 3, 2 k c 1 χ c 1, k c k c 1 and by Lemma 2c, 3 χ c 1 + k c k c In [8], Stević proved that b n = On c+1 and correctly conjectured that b n = On k c. The main theorem here is the following. Theorem 2. Suppose B and g are positive functions satisfying the second-order differential equation B x = gxbx, B x exists on x 1, {b i } is a solution to the difference equation in 1, with h1> 1, and 4 7 hn gn, for all n 2. Let V2 = 0 and 8 Vn= 1 6 for n 3, where n 1 min i 1<η i <i<ζ i <i+1 { B ζ i B η i } + Hn, 9
3 Hn= K.S. Berenhaut, E.G. Goedhart / J. Math. Anal. Appl hi<0 hibi In addition, suppose there exist positive constants, c 0 and c 1, satisfying { } B2 B1 + Vn 0 <c 0 min,b1 B0, h1 { } B2 B1 + Vn 0 <c 1 min,b1 B0, g1 for all n 3, then b0 b n + b 1 Bn, 13 c 0 c 1 for n 0. Note that from the conditions in Theorem 2, it follows that B is increasing. If B x is nondecreasing in x and h 0, then Vn 0, for all n, and we obtain the following corollary. Corollary 1. Suppose B and g are positive functions satisfying 7, B x is nondecreasing on x 1, and {b i } is a solution to the difference equation in 1 with h 0. In addition, suppose that there exist positive constants, c 0 and c 1, satisfying 0 <c 0 min { B2 B1, B1 B0 }, 14 { } B2 B1 0 <c 1 min,b1 B0, g1 then 13 is satisfied for all n 0. Similarly, if B x is nonincreasing in x and h 0, we have Vn= 1 n 1 { min B ζ i B η i } 6 i 1<η i <i<ζ i <i+1 = 1 6 n 1 B i + 1 B i 1 = 1 6 B n + B n 1 B 2 B 1, 16 for n 3, and Theorem 2 leads to the following corollary. Corollary 2. Suppose B and g are positive functions satisfying 7, B x is nonincreasing on x 1, with { 1 inf B n + B n 1 B 2 B 1 } C, 17 n 1 6
4 4 K.S. Berenhaut, E.G. Goedhart / J. Math. Anal. Appl Table 1 Constants c 0 and c 1 for some pairs g, B Bx gx B x c 0 c 1 x 5 20/x xi1 2 x 1/x x lnx + 1 x + 2/x lnx xe x 1 + 2/x x 5/2 3.75/x for some C, and {b i } is a solution to the difference equation in 1, with h 0. In addition, suppose that there exist positive constants, c 0 and c 1, satisfying 0 <c 0 min { B2 B1 + C,B1 B0 }, { } B2 B1 + C 0 <c 1 min,b1 B0, g1 then 13 is satisfied for all n 0. Note that if B x 0, for all x, then we may take C = 1 6 B 2 + B 1 in 17. Example. In [8], Stević alsoprovedthatifgi = 1/i for i 1, then b n = One n.as noted in Table 1, for that particular g, we actually have b n = O ni 1 2 n, 19 where I k z denotes the modified Bessel function of the first kind cf. [1]. To see how the two bounds compare, note that 1/n ni1 2 n = lim n As shown in Table 1, a more appropriate g for the bound ne n is given by gi = 1 + 2/i. Table 1 gives several noteworthy examples of pairs g, B with associated constants c 0 and c 1. The remainder of the paper proceeds as follows. Section 2 comprises a proof of Theorem 2, while Section 3 includes a proof of Theorem 1 which uses Corollaries 1 and Proof of the main result In this section we prove Theorem 2. We will employ the following elementary lemma cf. Mitrinović [5, p. 362] which follows directly from Taylor s theorem. Lemma 1. Suppose f is defined over the interval n 1,n+1.Iff x exists for n 1 x n + 1, then
5 K.S. Berenhaut, E.G. Goedhart / J. Math. Anal. Appl fn+ 1 2fn+ fn 1 = f n f ζ f η, 21 for some n 1 <η<n<ζ <n Proof of Theorem 2. Suppose B and g satisfy the assumptions of the theorem and define and ε i = Bi b i i 0, 23 ε i 1 = ε i ε i 1 i First, set b 0 = c 0 and b 1 = 0. We will show that in this case, {b i } i>0 and {b i+1 b i } i>0 are nonnegative sequences, i.e., b i+1 b i 0, for i 1. Note that b 1 = 0, and since h1> 1, we have that b 2 = 1 + h1c 0 > 0. Thus assume 25 holds for 1 i M 2, for some M 3. By 1, the induction hypothesis, and 8, we have b M b M 1 = 1 + gm 1 b M hm 1 b M 2 Thus 25 holds for all i 1. Now, by 23 and 11, we have gm 1b M 1 hm 1b M 2 gm 1b M 2 hm 1b M 2 25 = gm 1 hm 1 b M ε 0 = ε 1 ε 0 = B1 b 1 B0 b 0 = B1 B0 c Also, employing 1 and 11, ε 1 = B2 b 2 B1 b 1 = B2 B1 1 + g1 b h1 b 0 = B2 B1 1 + h1 c For ε 2, we have, for some ζ 2 and η 2 satisfying 1 <η 2 < 2 <ζ 2 < 3, ε 2 = B3 B2 1 + g2 b h2 b 1 = B3 2B2 + B1 g2b2 + g2 B2 b 2 + B2 b 2 B1 b1 + h2b1 = 1 6 B ζ 2 B η 2 + B 2 g2b2 + g2ε 2 + ε 1 + h2b 1 = 1 6 B ζ 2 B η 2 + g2ε 2 + ε 1 + h2b 1, 29
6 6 K.S. Berenhaut, E.G. Goedhart / J. Math. Anal. Appl where we have used 1, Lemma 1, and 7. Repeating the process in 29, successively, to rewrite ε 3, ε 4,..., ε n 1, we obtain ε n 1 = ε n ε n 1 = 1 n 1 B ζ i B η i n 1 n 1 + giε i + ε 1 + hib i 1 6 n 1 1 B ζ i B η i + giε i + ε hi<0 n 1 hib i 1 by 25 n 1 = Vn+ giε i + ε 1 hi<0 hiε i 1 = Vn+ B2 B1 1 + h1 n 1 c 0 + giε i + hi<0 n 1 hi ε i 1 giε i + hi<0 hi ε i 1, 30 where ζ i and η i satisfy i 1 <η i <i<ζ i <i+ 1, for i {2, 3,...,n 1}. The inequality in 30 follows from 11. Now, ε 0 = B0 b 0 = B0 + c 0 > 0, and hence from 27 and 28, we obtain ε 2 ε 1 ε 0 > Thus, assume ε i 0, for 0 i N 1, for some N 3. Then, by 30, the induction hypothesis, and the fact that g is positive, we have N 1 ε N = ε N 1 + ε N 1 giε i + hi<0 and the induction is complete. Combining this with 25 gives hi εi 1 0, 32 b n Bn, 33 for all n 0. A similar argument also holds when, in place of the sequence {b i }, we consider the solution {bi } of 1 with starting values b0 = 0 and b 1 = c We then have
7 K.S. Berenhaut, E.G. Goedhart / J. Math. Anal. Appl bn Bn, 35 for all n 1. To complete the proof, note that for the solution {b i }, with arbitrary starting values b 0 and b 1,wehave b b i = 0 b i + b 1 b i c 0 c b 0 b i 1 c + b 1 b i 0 c b 0 1 c Bi + b 1 0 c Bi 1 b 0 = + b 1 Bi. 36 c 0 c 1 This completes the proof of Theorem A question of Stević In this section, we employ Corollaries 1 and 2 to prove Theorem 1. First we require the following technical lemma. Lemma 2. Define, for x 1, the functions z, r 1, and r 2 via zx def = 1 6 xx 1x 2, r 1x def = 2 x 2 xx 1, and r 2 x def = 2 x 4 zx 2 x = 2 x 3 8 zx 4 + zx. We then have the following inequalities: a r 1 x 0 for 2 x 3; b r 1 x 0 for 1 x 2, x 3; c r 2 x 0 for 2 x 3. Proof. Note that r 1 x = 2x ln 2 2 2, 37 and hence r 1 x 0for1 x x 0 and r 1 x 0forx x 0, where def x 0 = ln 2 ln ln 2 Since 1/4 < ln 2 2 < 1/2, the definition in 38 leads to 2 <x 0 < 3 in fact, x The inequalities in a and b now follow via concavity considerations, upon noting that r 1 1 = r 1 2 = r 1 3 = 0. For c, suppose 2 x 3, and note that for such x, 0 zx x We then have
8 8 K.S. Berenhaut, E.G. Goedhart / J. Math. Anal. Appl zx r 2x = 2 x 2 2 = 2 x zx 8 zx 1 + zx 4 2 x zx 4 2 x zx = 2 x zx 4 1 zx 1 + zx zx zx The two inequalities in 40 follow from 39. Expanding about x = 2, and employing 39, this gives 2 8 zx r 2x 1 + x 2 ln x 2 28 = ln 2 12 x 2 0, and part c follows. We are now in a position to prove Theorem 1. Proof of Theorem 1. Set h 0, and note that for c 0i.e.,k c 1, B and g defined by Bx = x k c and gx = c satisfy x 2 c B x = k c k c 1x kc 2 = cx kc 2 = x 2 x k c = gxbx, 42 and hence 7 is satisfied. Now, for x 1, { B 4 x = k c k c 1k c 2k c 3x k c 4 0, if 2 <c<6, 43 0, otherwise, thus B x is nonincreasing on x 1, when 2 <c<6i.e.,2<k c < 3 and nondecreasing when 0 c 2orc 6. Note that B2 = 2 k c, B1 = 1, B0 = 0, and g1 = c. Case 1. c 6or0 c 2i.e.,k c 3or1 k c 2. Here, min{b2 B1, B1 B0}=1 and by Lemma 2b, { } { B2 B1 2 k c } 1 min,b1 B0 = min 1 + g1 1 + c, 1 = Applying Corollary 1 with c 0 = c 1 = 1 gives 2. Case 2. 2 <c<6i.e.,2<k c < 3. Here, B x = k c k c 1k c 2x k c 3, 45 thus B x 0asx tends to infinity. Taking C = 1 6 B 2 + B 1, wehave
9 where K.S. Berenhaut, E.G. Goedhart / J. Math. Anal. Appl min { B2 B1 + C,B1 B0 } { = min B2 B1 6 1 B 2 + B 1 }, 1 = min { Jc,1 } = 1, 46 Jc def = 2 k c k ck c 1k c 2 2 k c The last equality in 46 follows by Lemma 2c. In fact Jc 3. Also, since Jc 2 k c 1, by Lemma 2a we have { } { } B2 B1 + C Jc min,b1 B0 = min 1 + g1 1 + c, 1 = Jc 1 + c. 48 Applying Corollary 2, with c 0 = 1 and c 1 = Jc/1 + c = χ c, gives 2. Remark. After completion of this manuscript, Prof. Stević kindly shared with us a preliminary draft of a short note [9] also confirming his conjecture in [8]. The result therein is of a purely asymptotic nature, whereas here we are interested in explicit and applicable bounds. Since the question provided some of our original motivation and the bound in this case is quite simple and informative, we have chosen to leave our handling of his question among our examples. The interested reader is encouraged to seek out [9] for a different perspective on the particular case when gi = c/i 2 for some c 0, all i 1, and h 0 in 1. Acknowledgment We are very thankful to a referee for comments and insights that substantially improved this manuscript. References [1] M. Abramowitz, I.A. Stegun, Handbook of Mathematical Functions, Dover, New York, [2] V.B. Demidovič, Conditions for boundedness of the solutions of second-order linear difference equations with periodic coefficients, Vestnik Moskov. Univ. Ser. I Mat. Meh [3] E. Kurpinar, On the boundedness of solutions of second-order difference equation with monotonical coefficients, J. Fac. Sci. Ege Univ. Fen. Fak. Derg. Ser. A B [4] E. Kurpinar, G.Sh. Guseinov, The boundedness of solutions of second-order difference equations, Indian J. Math [5] D.S. Mitrinović, Analytic Inequalities, in cooperation with P.M. Vasić, Grundlehren Math. Wiss., Band 1965, Springer-Verlag, New York, [6] F.W.J. Olver, Error bounds for linear recurrence relations, Math. Comp [7] S. Stević, Growth theorems for homogeneous second-order difference equations, ANZIAM J [8] S. Stević, Asymptotic behavior of second-order difference equations, ANZIAM J [9] S. Stević, Asymptotic behavior of a second-order difference equation, preprint, [10] W.F. Trench, Asymptotic behavior of solutions of a linear second-order difference equation, in: Asymptotic Methods in Analysis and Combinatorics, J. Comput. Appl. Math
10 10 K.S. Berenhaut, E.G. Goedhart / J. Math. Anal. Appl [11] W.F. Trench, Linear perturbations of a nonoscillatory second-order difference equation, J. Math. Anal. Appl [12] W.F. Trench, Linear perturbations of a nonoscillatory second-order difference equation, II, J. Math. Anal. Appl [13] R. Wong, H. Li, Asymptotic expansions for second-order linear difference equations, in: Asymptotic Methods in Analysis and Combinatorics, J. Comput. Appl. Math
A PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS. In memory of Rou-Huai Wang
A PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS XAVIER CABRÉ, MANEL SANCHÓN, AND JOEL SPRUCK In memory of Rou-Huai Wang 1. Introduction In this note we consider semistable
More informationFACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
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 informationReal Roots of Univariate Polynomials with Real Coefficients
Real Roots of Univariate Polynomials with Real Coefficients mostly written by Christina Hewitt March 22, 2012 1 Introduction Polynomial equations are used throughout mathematics. When solving polynomials
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
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 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 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 informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More informationSEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov
Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices
More informationProbability Generating Functions
page 39 Chapter 3 Probability Generating Functions 3 Preamble: Generating Functions Generating functions are widely used in mathematics, and play an important role in probability theory Consider a sequence
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 informationBX in ( u, v) basis in two ways. On the one hand, AN = u+
1. Let f(x) = 1 x +1. Find f (6) () (the value of the sixth derivative of the function f(x) at zero). Answer: 7. We expand the given function into a Taylor series at the point x = : f(x) = 1 x + x 4 x
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
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 informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
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 informationMOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao yufeiz@mit.edu
Integer Polynomials June 9, 007 Yufei Zhao yufeiz@mit.edu We will use Z[x] to denote the ring of polynomials with integer coefficients. We begin by summarizing some of the common approaches used in dealing
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series In the preceding section we were able to find power series representations for a certain restricted class of functions. Here we investigate more general problems: Which functions
More informationTAKE-AWAY GAMES. ALLEN J. SCHWENK California Institute of Technology, Pasadena, California INTRODUCTION
TAKE-AWAY GAMES ALLEN J. SCHWENK California Institute of Technology, Pasadena, California L INTRODUCTION Several games of Tf take-away?f have become popular. The purpose of this paper is to determine the
More informationPrime Numbers and Irreducible Polynomials
Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.
More informationStochastic Inventory Control
Chapter 3 Stochastic Inventory Control 1 In this chapter, we consider in much greater details certain dynamic inventory control problems of the type already encountered in section 1.3. In addition to the
More informationON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION. E. I. Pancheva, A. Gacovska-Barandovska
Pliska Stud. Math. Bulgar. 22 (2015), STUDIA MATHEMATICA BULGARICA ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION E. I. Pancheva, A. Gacovska-Barandovska Smirnov (1949) derived four
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 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 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 informationIrreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients
DOI: 10.2478/auom-2014-0007 An. Şt. Univ. Ovidius Constanţa Vol. 221),2014, 73 84 Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients Anca
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Spring 2012 Homework # 9, due Wednesday, April 11 8.1.5 How many ways are there to pay a bill of 17 pesos using a currency with coins of values of 1 peso, 2 pesos,
More informationSome Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.
Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
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 HENSEL S ROOTS AND A FACTORIZATION FORMULA IN Z[[X]]
#A47 INTEGERS 4 (204) ON HENSEL S ROOTS AND A FACTORIZATION FORMULA IN Z[[X]] Daniel Birmaer Department of Mathematics, Nazareth College, Rochester, New Yor abirma6@naz.edu Juan B. Gil Penn State Altoona,
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 informationLecture Notes on Elasticity of Substitution
Lecture Notes on Elasticity of Substitution Ted Bergstrom, UCSB Economics 210A March 3, 2011 Today s featured guest is the elasticity of substitution. Elasticity of a function of a single variable Before
More informationA 2-factor in which each cycle has long length in claw-free graphs
A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science
More informationSolutions of Equations in One Variable. Fixed-Point Iteration II
Solutions of Equations in One Variable Fixed-Point Iteration II Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011
More informationCHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationON NONNEGATIVE SOLUTIONS OF NONLINEAR TWO-POINT BOUNDARY VALUE PROBLEMS FOR TWO-DIMENSIONAL DIFFERENTIAL SYSTEMS WITH ADVANCED ARGUMENTS
ON NONNEGATIVE SOLUTIONS OF NONLINEAR TWO-POINT BOUNDARY VALUE PROBLEMS FOR TWO-DIMENSIONAL DIFFERENTIAL SYSTEMS WITH ADVANCED ARGUMENTS I. KIGURADZE AND N. PARTSVANIA A. Razmadze Mathematical Institute
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
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 informationEXISTENCE AND NON-EXISTENCE RESULTS FOR A NONLINEAR HEAT EQUATION
Sixth Mississippi State Conference on Differential Equations and Computational Simulations, Electronic Journal of Differential Equations, Conference 5 (7), pp. 5 65. ISSN: 7-669. UL: http://ejde.math.txstate.edu
More informationarxiv:math/0601660v3 [math.nt] 25 Feb 2006
NOTES Edited by William Adkins arxiv:math/666v3 [math.nt] 25 Feb 26 A Short Proof of the Simple Continued Fraction Expansion of e Henry Cohn. INTRODUCTION. In [3], Euler analyzed the Riccati equation to
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 informationError Bound for Classes of Polynomial Systems and its Applications: A Variational Analysis Approach
Outline Error Bound for Classes of Polynomial Systems and its Applications: A Variational Analysis Approach The University of New South Wales SPOM 2013 Joint work with V. Jeyakumar, B.S. Mordukhovich and
More informationON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction
ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove
More informationOn closed-form solutions to a class of ordinary differential equations
International Journal of Advanced Mathematical Sciences, 2 (1 (2014 57-70 c Science Publishing Corporation www.sciencepubco.com/index.php/ijams doi: 10.14419/ijams.v2i1.1556 Research Paper On closed-form
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 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 informationArrangements of Stars on the American Flag
Arrangements of Stars on the American Flag Dimitris Koukoulopoulos and Johann Thiel Abstract. In this article, we examine the existence of nice arrangements of stars on the American flag. We show that
More information1.5. Factorisation. Introduction. Prerequisites. Learning Outcomes. Learning Style
Factorisation 1.5 Introduction In Block 4 we showed the way in which brackets were removed from algebraic expressions. Factorisation, which can be considered as the reverse of this process, is dealt with
More informationSome strong sufficient conditions for cyclic homogeneous polynomial inequalities of degree four in nonnegative variables
Available online at www.tjnsa.com J. Nonlinear Sci. Appl. 6 (013), 74 85 Research Article Some strong sufficient conditions for cyclic homogeneous polynomial inequalities of degree four in nonnegative
More informationCONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12
CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.
More informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More informationOPTIMAL CONTROL OF FLEXIBLE SERVERS IN TWO TANDEM QUEUES WITH OPERATING COSTS
Probability in the Engineering and Informational Sciences, 22, 2008, 107 131. Printed in the U.S.A. DOI: 10.1017/S0269964808000077 OPTIMAL CONTROL OF FLEXILE SERVERS IN TWO TANDEM QUEUES WITH OPERATING
More informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More informationNIM with Cash. Abstract. loses. This game has been well studied. For example, it is known that for NIM(1, 2, 3; n)
NIM with Cash William Gasarch Univ. of MD at College Park John Purtilo Univ. of MD at College Park Abstract NIM(a 1,..., a k ; n) is a -player game where initially there are n stones on the board and the
More informationarxiv:math/0202219v1 [math.co] 21 Feb 2002
RESTRICTED PERMUTATIONS BY PATTERNS OF TYPE (2, 1) arxiv:math/0202219v1 [math.co] 21 Feb 2002 TOUFIK MANSOUR LaBRI (UMR 5800), Université Bordeaux 1, 351 cours de la Libération, 33405 Talence Cedex, France
More informationReference: Introduction to Partial Differential Equations by G. Folland, 1995, Chap. 3.
5 Potential Theory Reference: Introduction to Partial Differential Equations by G. Folland, 995, Chap. 3. 5. Problems of Interest. In what follows, we consider Ω an open, bounded subset of R n with C 2
More informationMATH PROBLEMS, WITH SOLUTIONS
MATH PROBLEMS, WITH SOLUTIONS OVIDIU MUNTEANU These are free online notes that I wrote to assist students that wish to test their math skills with some problems that go beyond the usual curriculum. These
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationCONTINUED FRACTIONS AND FACTORING. Niels Lauritzen
CONTINUED FRACTIONS AND FACTORING Niels Lauritzen ii NIELS LAURITZEN DEPARTMENT OF MATHEMATICAL SCIENCES UNIVERSITY OF AARHUS, DENMARK EMAIL: niels@imf.au.dk URL: http://home.imf.au.dk/niels/ Contents
More informationQuasi Contraction and Fixed Points
Available online at www.ispacs.com/jnaa Volume 2012, Year 2012 Article ID jnaa-00168, 6 Pages doi:10.5899/2012/jnaa-00168 Research Article Quasi Contraction and Fixed Points Mehdi Roohi 1, Mohsen Alimohammady
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 informationResearch Article Two-Period Inventory Control with Manufacturing and Remanufacturing under Return Compensation Policy
Discrete Dynamics in Nature and Society Volume 2013, Article ID 871286, 8 pages http://dx.doi.org/10.1155/2013/871286 Research Article Two-Period Inventory Control with Manufacturing and Remanufacturing
More informationIntroduction to Algebraic Geometry. Bézout s Theorem and Inflection Points
Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a
More informationON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE. 1. Introduction
ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE J.M. CALABUIG, J. RODRÍGUEZ, AND E.A. SÁNCHEZ-PÉREZ Abstract. Let m be a vector measure taking values in a Banach space X. We prove that
More informationReducibility of Second Order Differential Operators with Rational Coefficients
Reducibility of Second Order Differential Operators with Rational Coefficients Joseph Geisbauer University of Arkansas-Fort Smith Advisor: Dr. Jill Guerra May 10, 2007 1. INTRODUCTION In this paper we
More informationOn a comparison result for Markov processes
On a comparison result for Markov processes Ludger Rüschendorf University of Freiburg Abstract A comparison theorem is stated for Markov processes in polish state spaces. We consider a general class of
More informationBest Monotone Degree Bounds for Various Graph Parameters
Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer
More information1 Introduction, Notation and Statement of the main results
XX Congreso de Ecuaciones Diferenciales y Aplicaciones X Congreso de Matemática Aplicada Sevilla, 24-28 septiembre 2007 (pp. 1 6) Skew-product maps with base having closed set of periodic points. Juan
More informationOn the irreducibility of certain polynomials with coefficients as products of terms in an arithmetic progression
On the irreducibility of certain polynomials with coefficients as products of terms in an arithmetic progression Carrie E. Finch and N. Saradha Abstract We prove the irreducibility of ceratin polynomials
More informationOn an anti-ramsey type result
On an anti-ramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider anti-ramsey type results. For a given coloring of the k-element subsets of an n-element set X, where two k-element
More informationChapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
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 informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationWinter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov alexanderrem@gmail.com
Polynomials Alexander Remorov alexanderrem@gmail.com Warm-up Problem 1: Let f(x) be a quadratic polynomial. Prove that there exist quadratic polynomials g(x) and h(x) such that f(x)f(x + 1) = g(h(x)).
More informationSumit Chandok and T. D. Narang INVARIANT POINTS OF BEST APPROXIMATION AND BEST SIMULTANEOUS APPROXIMATION
F A S C I C U L I M A T H E M A T I C I Nr 51 2013 Sumit Chandok and T. D. Narang INVARIANT POINTS OF BEST APPROXIMATION AND BEST SIMULTANEOUS APPROXIMATION Abstract. In this paper we generalize and extend
More informationAsymptotics for a discrete-time risk model with Gamma-like insurance risks. Pokfulam Road, Hong Kong
Asymptotics for a discrete-time risk model with Gamma-like insurance risks Yang Yang 1,2 and Kam C. Yuen 3 1 Department of Statistics, Nanjing Audit University, Nanjing, 211815, China 2 School of Economics
More informationChapter 2 Remodulization of Congruences Proceedings NCUR VI. è1992è, Vol. II, pp. 1036í1041. Jeærey F. Gold Department of Mathematics, Department of Physics University of Utah Don H. Tucker Department
More informationNonlinear Algebraic Equations. Lectures INF2320 p. 1/88
Nonlinear Algebraic Equations Lectures INF2320 p. 1/88 Lectures INF2320 p. 2/88 Nonlinear algebraic equations When solving the system u (t) = g(u), u(0) = u 0, (1) with an implicit Euler scheme we have
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 informationFACTORING PEAK POLYNOMIALS
FACTORING PEAK POLYNOMIALS SARA BILLEY, MATTHEW FAHRBACH, AND ALAN TALMAGE Abstract. Let S n be the symmetric group of permutations π = π 1 π 2 π n of {1, 2,..., n}. An index i of π is a peak if π i 1
More informationHow To Know If A Domain Is Unique In An Octempo (Euclidean) Or Not (Ecl)
Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness
More informationINCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
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 informationCacti with minimum, second-minimum, and third-minimum Kirchhoff indices
MATHEMATICAL COMMUNICATIONS 47 Math. Commun., Vol. 15, No. 2, pp. 47-58 (2010) Cacti with minimum, second-minimum, and third-minimum Kirchhoff indices Hongzhuan Wang 1, Hongbo Hua 1, and Dongdong Wang
More informationCounting Primes whose Sum of Digits is Prime
2 3 47 6 23 Journal of Integer Sequences, Vol. 5 (202), Article 2.2.2 Counting Primes whose Sum of Digits is Prime Glyn Harman Department of Mathematics Royal Holloway, University of London Egham Surrey
More informationMethods for Finding Bases
Methods for Finding Bases Bases for the subspaces of a matrix Row-reduction methods can be used to find bases. Let us now look at an example illustrating how to obtain bases for the row space, null space,
More informationA note on companion matrices
Linear Algebra and its Applications 372 (2003) 325 33 www.elsevier.com/locate/laa A note on companion matrices Miroslav Fiedler Academy of Sciences of the Czech Republic Institute of Computer Science Pod
More informationFurther Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1
Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1 J. Zhang Institute of Applied Mathematics, Chongqing University of Posts and Telecommunications, Chongqing
More informationTwo classes of ternary codes and their weight distributions
Two classes of ternary codes and their weight distributions Cunsheng Ding, Torleiv Kløve, and Francesco Sica Abstract In this paper we describe two classes of ternary codes, determine their minimum weight
More information5 Numerical Differentiation
D. Levy 5 Numerical Differentiation 5. Basic Concepts This chapter deals with numerical approximations of derivatives. The first questions that comes up to mind is: why do we need to approximate derivatives
More informationA STABILITY RESULT ON MUCKENHOUPT S WEIGHTS
Publicacions Matemàtiques, Vol 42 (998), 53 63. A STABILITY RESULT ON MUCKENHOUPT S WEIGHTS Juha Kinnunen Abstract We prove that Muckenhoupt s A -weights satisfy a reverse Hölder inequality with an explicit
More informationMath 120 Final Exam Practice Problems, Form: A
Math 120 Final Exam Practice Problems, Form: A Name: While every attempt was made to be complete in the types of problems given below, we make no guarantees about the completeness of the problems. Specifically,
More informationSample Induction Proofs
Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given
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 informationConvex analysis and profit/cost/support functions
CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m
More informationExtremal equilibria for reaction diffusion equations in bounded domains and applications.
Extremal equilibria for reaction diffusion equations in bounded domains and applications. Aníbal Rodríguez-Bernal Alejandro Vidal-López Departamento de Matemática Aplicada Universidad Complutense de Madrid,
More information