NOTE ON ASYMPTOTIC CONTRACTIONS
|
|
- Allison Baldwin
- 7 years ago
- Views:
Transcription
1 Applicable Analysis and Discrete Mathematics, , Available electronically at Presented at the conference: Topics in Mathematical Analysis and Graph Theory, Belgrade, September 1 4, NOTE ON ASYMPTOTIC CONTRACTIONS Ivan D. Arand - elović In 2003 W. A. Kirk introduced the notion of asymptotic contractions. In this paper we present one fixed point theorem of Kirk s type unifying and generalizing recent results of W. A. Kirk, J. Jachymski, I. Jóźwik and Y.-Z. Chen. 1. INTRODUCTION AND PRELIMINARIES W. A. Kirk [8] introduced the notion of asymptotic contractions and proved fixed point theorem for this class of mappings. In note [1] we present a new short and simple proof of Kirk s theorem. Further results on this class of mappings was obtained by: J. Jachymski, I. Jóźwik [7], Y.-Z. Chen [4], P. Gerhardy [5], [6], T. Suzuki [9], H. K. Xu [12], M. Arav, F. E. C. Santos, S. Reich, A. Zaslavski [2] and K. W lodarczyk, D. K, R. Plebaniak [10], [11]. The papers [10] and [11] presents some ideas for application of the theory of asymptotic contractions in the analysis of set-valued dynamic systems. In this paper we present one fixed point theorem of Kirk s type unifying and generalizing recent results of W. A. Kirk [8], J. Jachymski, I. Jóźwik [7] and Y.-Z. Chen [4]. Let X be a nonempty set and f : X X arbitrary mapping. x X is a fixed point for f if x = fx. If x 0 X, we say that a sequence x n defined by x n = f n x 0 is a sequence of Picard iterates of f at point x 0 or that x n is the orbit of f at point x 0. In [2] M. Arav, F. E. C. Santos, S. Reich and A. Zaslavski proved the following result: Proposition 1. Let X, d be a metric space, f : X X continuous function and ϕ i sequence of functions such that ϕ i : [0, [0, and for each x, y X d f i x, f i y ϕ i dx, y Mathematics Subject Classification. 54H25, 47H10 Key Words and Phrases. Fixed point, asymptotic contraction. 211
2 212 Ivan D. Arand - elović Assume also that there exists upper semicontinuous function ϕ : [0, [0, such that for any r > 0 ϕr < r, ϕ0 = 0 and ϕ i ϕ uniformly on any bounded interval [0, b]. If there exists y X such that y = fy then all sequences of Picard iterates defined by f converge to y, uniformly on each bounded subset of X. 2. MAIN RESULT S Now we present our results. Theorem 1. Let X, d be a complete metric space, f : X X continuous function and ϕ i sequence of functions such that ϕ i : [0, [0, and for each x, y X d f i x, f i y ϕ i dx, y. Assume also that there exists upper semicontinuous function ϕ : [0, [0, such that for any r > 0 ϕr < r, ϕ0 = 0 and ϕ i ϕ uniformly on any bounded interval[0, b]. If one of the following conditions is satisfying: 1 there exists x X such that orbit of f at x is bounded; or 2 t ϕt > 0; or ϕt 3 < 1. t then f has an unique fixed point y X and all sequences of Picard iterates defined by f converge to y, uniformly on each bounded subset of X. Proof. For any x, y X, x y, we have: d f n x, f n y ϕ n dx, y = ϕ dx, y < dx, y. Suppose that there exist x, y X and ε > 0 such that d f n x, f n y = ε. Then there exists sequence of integers m j, such that dx mj, y mj = dx m, y m. If d f k x, f k y ε, for each k m j, then from upper semicontinuity of ϕ follows dx mj, y mj ϕε < ε, which is a contradiction. So there exists k m j such that ϕ d f k x, f k y < ε. This implies that d f n x, f n y = n d f n f k x, f n f k y n ϕ n d f k x, f k y = ϕ d f k x, f k y < ε,
3 Note on asymptotic contractions 213 which is a contradiction. So we obtain that 1 d f n x, f n y = 0, for any x, y X, which implies that all sequences of Picard iterates defined by f, are equiconvergent. Now let a X be arbitrary, a n be a sequence of Picard iterates of f at point a, Y = a n and F n = {x Y : d x, f k x 1/n k = 1,...,n}. From 1 follows that F n is nonempty and since f is continuous F n is closed, for any n. Also, we have F n+1 F n. Let x n and y n be arbitrary sequences, such that x n, y n F n. Let n j be a sequence of integers, such that dx nj, y nj = dx n, y n. For any ε > 0 there exists positive integer k such that ϕt + ε ϕ k t for all t [0, + and m k, because ϕ n ϕ uniformly on the rang of d. Now we have: dx nj, y nj d x nj, f nj x nj + d f nj x nj, f nj y nj +d y nj, f nj y nj = d f nj x nj, f nj y nj ϕ nj dxnj, y nj ε + ϕ dx nj, y nj ε + ϕ dx nj, y nj, for n j k and so dx nj, y nj = ϕ dx nj, y nj dx nj, y nj {0, + }. Now we have following three cases: A Let dx nj, y nj = 0. Thus dx n, y n = 0 and so dx n, y n = 0. This implies that diamf n = 0. By completeness of Y follows that there exists z X such that F n = {z}. i=1 We remember that 1 A. Since d z, fz 1/n for any n, we have fz = z. From 1 follows that all sequences of Picard iterates defined by f converge to z. From Proposition 1 follows that this convergence is uniform on bounded subsets of X. B Let dx nj, y nj = + and follows t ϕt > 0. Then from dx nj, y nj d x nj, f nj x nj + d f nj x nj, f nj y nj + d y nj, f nj y nj d x nj, f nj x nj + d y nj, f nj y nj dx nj, y nj d f nj x nj, f nj y nj dx nj, y nj ϕ nj dxnj, y nj dx nj, y nj ϕ dx nj, y nj ε,
4 214 Ivan D. Arand - elović for n j k. Thus which is a contradiction. t ϕt < 0, n C Let dx nj, y nj = + and ϕt t < 1. Then from dx nj, y nj d x nj, f nj x nj + d f nj x nj, f nj y nj + d y nj, f nj y nj follows 1 d x nj, f nj x nj + d f nj x nj, f nj y nj + d y nj, f nj y nj dx nj, y nj d x nj, f nj x nj + ϕ nj dxnj, y nj + d y nj, f nj y nj dx nj, y nj d x nj, f nj x nj + ϕ dx nj, y nj + ε + d y nj, f nj y nj, dx nj, y nj for n j k. Thus which is a contradiction. 1 ϕ dx nj, y nj dx nj, y nj < 1 3. COMMENTS AND REMARKS The statement of W. A. Kirk [8] Theorem 2.1 has additional assumptions that all ϕ i are continuous, and so Kirk s result is include in our Theorem 1.1, as theorem Y.-Z. Chen [4]- Theorem 2.2 which has additional assumptions that one of ϕ i is upper semicontinuous. The statement of J. Jachymski, I. Jóźwik [7] Theorem 2 has additional assumptions f is uniformly continuous and condition t ϕt = + which is stronger then our condition t ϕt > 0. Thus this result is include in our Theorem 1.2. The statement of Y.-Z. Chen [4] Corollary 2.4 has additional assumptions that one of ϕ i is upper semicontinuous, and so it is include in our Theorem 1.3. In the statements of W. A. Kirk [8] Theorem 2.1 and Y.-Z. Chen [4] Theorem 2.2, the assumption f is continuous was inadvertently left out, but
5 Note on asymptotic contractions 215 it was used in the proofs of theorems. J. Jachymski, I. Jóźwik [7], give the following example for necessity of this condition. Example 1. Let X = [0, 1] an f : X X defined by fx = { 1, x = 0, x/2, x 0. So fx 0, 1 which implies f n X 0, 1/2 n 1. A sequence of functions ϕ n = 1/2 n 1 satisfies the conditions of Theorem 2.1 because ϕ n 0 uniformly, but f is fixed point free. Now we give the following example for necessity of uniformly convergence of sequence ϕ n. Example 2. Let x n be an arbitrary sequence, X = {x n }, and d : X 2 [0, + mapping defined by dx n, x n+k = k n + k + 1 nk, n {1, 2, 3,...}, k {0, 1, 2,...}. X, d is complete metric space, because each ball which radius is less then 1 contains only a finite number elements of X. d is discrete metric and all nonzero distance are distinct. Also we have: k dx n, x n+k = 1 and n dx n, x n+k = 0. Now define f : X X by fx n = x n+1. Let ϕt = t/2 and ϕ n dxi, x j { = max dx i+n, x j+n, dx i, x j 2 for i j. The function ϕ n is well defined because the number dx i, x j occurs only once in the rang of d. From n dx i+n, x j+n = 0 }, follows ϕ n ϕ on the rang of d. The inequality d f n x i, f n x j ϕ n dxi, x j is also satisfied, but f is fixed point free.
6 216 Ivan D. Arand - elović REFERENCES 1. I. Arand- elović: On a fixed point theorem of Kirk. J. Math. Anal. Appl., , M. Arav, F. E. C. Santos, S. Reich, A. Zaslavski: A note on asymptotic contractions. Fixed point theory and applications 2007 ID 39465, 6 pages, doi: /2007/ E. M. Briseid: A rate of convergence for asymptotic contractions. J. Math. Anal. Appl., 2006 doi: /jmaa Y.-Z. Chen:Asymptotic fixed points for nonlinear contractions. Fixed point Theory Appl., 2005:2 2005, P. Gerhardy:A quantitative version of Kirk s fixed point theorem for asymptotic contractions. J. Math. Anal. Appl., , P. Gerhardy:Applications of proof interpretations. PhD Dissertation, University of Aarhus J. Jachymski, I. Jóźwik:On Kirk s asymptotic contractions. J. Mat. Anal. Appl., , W. A. Kirk:Fixed points of asymptotic contractions. J. Math. Anal. Appl., , T. Suzuki :Fixed-point theorem for asymptotic contractions of Meir-Keeler type in complete metric spaces. Nonlinear Analysis, , K. W lodarczyk, D. K, R. Plebaniak: Existence and uniqueness of endpoints of closedset-valued asymptotic contractions in metric spaces. J. Math. Anal. Appl., , K. W lodarczyk, R. Plebaniak, Cezary Obczyński: Endpoints set-valued dynamical systems of asymptotic contractions of Meir-Keeler type and strict contractions in uniform spaces. Nonlinear Analysis, 2006, doi: /j.na H. K. Xu:Asymptotic and weakly asymptotic contractions. Indian J. pure appl. Math., , University of Belgrade, Received October 27, 2006 Faculty of Mechanical Engineering, Kraljice Marije 16, Beograd, Serbia E mail: iva@alfa.mas.bg.ac.yu
Quasi 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 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 informationx a x 2 (1 + x 2 ) n.
Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number
More informationNotes on metric spaces
Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.
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 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 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 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 informationMetric Spaces. Chapter 1
Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence
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 informationDegree Hypergroupoids Associated with Hypergraphs
Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated
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 informationMA4001 Engineering Mathematics 1 Lecture 10 Limits and Continuity
MA4001 Engineering Mathematics 1 Lecture 10 Limits and Dr. Sarah Mitchell Autumn 2014 Infinite limits If f(x) grows arbitrarily large as x a we say that f(x) has an infinite limit. Example: f(x) = 1 x
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 information4. Expanding dynamical systems
4.1. Metric definition. 4. Expanding dynamical systems Definition 4.1. Let X be a compact metric space. A map f : X X is said to be expanding if there exist ɛ > 0 and L > 1 such that d(f(x), f(y)) Ld(x,
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationFixed Point Theorems
Fixed Point Theorems Definition: Let X be a set and let T : X X be a function that maps X into itself. (Such a function is often called an operator, a transformation, or a transform on X, and the notation
More informationFIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.
FIRST YEAR CALCULUS WWLCHENW L c WWWL W L Chen, 1982, 2008. 2006. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It It is is
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 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 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 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 informationI. Pointwise convergence
MATH 40 - NOTES Sequences of functions Pointwise and Uniform Convergence Fall 2005 Previously, we have studied sequences of real numbers. Now we discuss the topic of sequences of real valued functions.
More informationTHE CENTRAL LIMIT THEOREM TORONTO
THE CENTRAL LIMIT THEOREM DANIEL RÜDT UNIVERSITY OF TORONTO MARCH, 2010 Contents 1 Introduction 1 2 Mathematical Background 3 3 The Central Limit Theorem 4 4 Examples 4 4.1 Roulette......................................
More informationNotes V General Equilibrium: Positive Theory. 1 Walrasian Equilibrium and Excess Demand
Notes V General Equilibrium: Positive Theory In this lecture we go on considering a general equilibrium model of a private ownership economy. In contrast to the Notes IV, we focus on positive issues such
More informationTHE SQUARE PARTIAL SUMS OF THE FOURIER TRANSFORM OF RADIAL FUNCTIONS IN THREE DIMENSIONS
Scientiae Mathematicae Japonicae Online, Vol. 5,, 9 9 9 THE SQUARE PARTIAL SUMS OF THE FOURIER TRANSFORM OF RADIAL FUNCTIONS IN THREE DIMENSIONS CHIKAKO HARADA AND EIICHI NAKAI Received May 4, ; revised
More informationBasic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely
More informationMathematical Methods of Engineering Analysis
Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................
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 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 information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
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 informationPooja Sharma and R. S. Chandel FIXED POINT THEOREMS FOR WEAKLY COMPATIBLE MAPPINGS IN FUZZY METRIC SPACES. 1. Introduction
F A S C I C U L I M A T H E M A T I C I Nr 51 2013 Pooja Sharma and R. S. Chandel FIXED POINT THEOREMS FOR WEAKLY COMPATIBLE MAPPINGS IN FUZZY METRIC SPACES Abstract. This paper presents some fixed point
More informationCritical points of once continuously differentiable functions are important because they are the only points that can be local maxima or minima.
Lecture 0: Convexity and Optimization We say that if f is a once continuously differentiable function on an interval I, and x is a point in the interior of I that x is a critical point of f if f (x) =
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 informationRandom graphs with a given degree sequence
Sourav Chatterjee (NYU) Persi Diaconis (Stanford) Allan Sly (Microsoft) Let G be an undirected simple graph on n vertices. Let d 1,..., d n be the degrees of the vertices of G arranged in descending order.
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 informationSeparation Properties for Locally Convex Cones
Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam
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 informationSmooth functions statistics
Smooth functions statistics V. I. rnold To describe the topological structure of a real smooth function one associates to it the graph, formed by the topological variety, whose points are the connected
More information1. Let X and Y be normed spaces and let T B(X, Y ).
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: NVP, Frist. 2005-03-14 Skrivtid: 9 11.30 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
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 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 informationThe degree, size and chromatic index of a uniform hypergraph
The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the
More informationA sufficient and necessary condition for the convergence of the sequence of successive approximations to a unique fixed point II
Suzuki and Alamri Fixed Point Theory and Applications (2015) 2015:59 DOI 10.1186/s13663-015-0302-9 RESEARCH Open Access A sufficient and necessary condition for the convergence of the sequence of successive
More informationMetric Spaces Joseph Muscat 2003 (Last revised May 2009)
1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of
More informationA 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 informationEMBEDDING COUNTABLE PARTIAL ORDERINGS IN THE DEGREES
EMBEDDING COUNTABLE PARTIAL ORDERINGS IN THE ENUMERATION DEGREES AND THE ω-enumeration DEGREES MARIYA I. SOSKOVA AND IVAN N. SOSKOV 1. Introduction One of the most basic measures of the complexity of a
More informationTricyclic biregular graphs whose energy exceeds the number of vertices
MATHEMATICAL COMMUNICATIONS 213 Math. Commun., Vol. 15, No. 1, pp. 213-222 (2010) Tricyclic biregular graphs whose energy exceeds the number of vertices Snježana Majstorović 1,, Ivan Gutman 2 and Antoaneta
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 informationPSEUDOARCS, PSEUDOCIRCLES, LAKES OF WADA AND GENERIC MAPS ON S 2
PSEUDOARCS, PSEUDOCIRCLES, LAKES OF WADA AND GENERIC MAPS ON S 2 Abstract. We prove a Bruckner-Garg type theorem for the fiber structure of a generic map from a continuum X into the unit interval I. We
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 informationMATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform
MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish
More informationDEFINABLE TYPES IN PRESBURGER ARITHMETIC
DEFINABLE TYPES IN PRESBURGER ARITHMETIC GABRIEL CONANT Abstract. We consider the first order theory of (Z, +,
More informationCONTRIBUTIONS TO ZERO SUM PROBLEMS
CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg
More informationWalrasian Demand. u(x) where B(p, w) = {x R n + : p x w}.
Walrasian Demand Econ 2100 Fall 2015 Lecture 5, September 16 Outline 1 Walrasian Demand 2 Properties of Walrasian Demand 3 An Optimization Recipe 4 First and Second Order Conditions Definition Walrasian
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 informationFollow links for Class Use and other Permissions. For more information send email to: permissions@pupress.princeton.edu
COPYRIGHT NOTICE: Ariel Rubinstein: Lecture Notes in Microeconomic Theory is published by Princeton University Press and copyrighted, c 2006, by Princeton University Press. All rights reserved. No part
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 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 informationStationary random graphs on Z with prescribed iid degrees and finite mean connections
Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative
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 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 informationFinite dimensional topological vector spaces
Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the
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 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 informationIntroduction to Topology
Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................
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 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 informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
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 information1 The Brownian bridge construction
The Brownian bridge construction The Brownian bridge construction is a way to build a Brownian motion path by successively adding finer scale detail. This construction leads to a relatively easy proof
More informationTiers, Preference Similarity, and the Limits on Stable Partners
Tiers, Preference Similarity, and the Limits on Stable Partners KANDORI, Michihiro, KOJIMA, Fuhito, and YASUDA, Yosuke February 7, 2010 Preliminary and incomplete. Do not circulate. Abstract We consider
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 informationHow To Know The Limit Set Of A Fuchsian Group On A Boundary Of A Hyperbolic Plane
Reading material on the limit set of a Fuchsian group Recommended texts Many books on hyperbolic geometry and Kleinian and Fuchsian groups contain material about limit sets. The presentation given here
More informationMATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.
MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α
More informationAbout the inverse football pool problem for 9 games 1
Seventh International Workshop on Optimal Codes and Related Topics September 6-1, 013, Albena, Bulgaria pp. 15-133 About the inverse football pool problem for 9 games 1 Emil Kolev Tsonka Baicheva Institute
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 informationLecture 17 : Equivalence and Order Relations DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion
More informationGraphs without proper subgraphs of minimum degree 3 and short cycles
Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract
More informationPh.D. Thesis. Judit Nagy-György. Supervisor: Péter Hajnal Associate Professor
Online algorithms for combinatorial problems Ph.D. Thesis by Judit Nagy-György Supervisor: Péter Hajnal Associate Professor Doctoral School in Mathematics and Computer Science University of Szeged Bolyai
More informationCycles and clique-minors in expanders
Cycles and clique-minors in expanders Benny Sudakov UCLA and Princeton University Expanders Definition: The vertex boundary of a subset X of a graph G: X = { all vertices in G\X with at least one neighbor
More informationDedekind s forgotten axiom and why we should teach it (and why we shouldn t teach mathematical induction in our calculus classes)
Dedekind s forgotten axiom and why we should teach it (and why we shouldn t teach mathematical induction in our calculus classes) by Jim Propp (UMass Lowell) March 14, 2010 1 / 29 Completeness Three common
More informationHow To Find Out How To Calculate A Premeasure On A Set Of Two-Dimensional Algebra
54 CHAPTER 5 Product Measures Given two measure spaces, we may construct a natural measure on their Cartesian product; the prototype is the construction of Lebesgue measure on R 2 as the product of Lebesgue
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 informationThe chromatic spectrum of mixed hypergraphs
The chromatic spectrum of mixed hypergraphs Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West March 30, 2003 Abstract A mixed hypergraph is a triple H = (X, C, D), where X is the vertex
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 informationRIGIDITY OF HOLOMORPHIC MAPS BETWEEN FIBER SPACES
RIGIDITY OF HOLOMORPHIC MAPS BETWEEN FIBER SPACES GAUTAM BHARALI AND INDRANIL BISWAS Abstract. In the study of holomorphic maps, the term rigidity refers to certain types of results that give us very specific
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 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 informationThe Goldberg Rao Algorithm for the Maximum Flow Problem
The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }
More informationON SOME ANALOGUE OF THE GENERALIZED ALLOCATION SCHEME
ON SOME ANALOGUE OF THE GENERALIZED ALLOCATION SCHEME Alexey Chuprunov Kazan State University, Russia István Fazekas University of Debrecen, Hungary 2012 Kolchin s generalized allocation scheme A law of
More informationConstruction of functions with the given cluster sets
arxiv:1602.07118v1 [math.gn] 23 Feb 2016 Construction of functions with the given cluster sets Oleksandr V. Maslyuchenko Instytute of Mathematics Academia Pomeraniensis in Słupsk 76-200 Słupsk, Poland
More informationt := maxγ ν subject to ν {0,1,2,...} and f(x c +γ ν d) f(x c )+cγ ν f (x c ;d).
1. Line Search Methods Let f : R n R be given and suppose that x c is our current best estimate of a solution to P min x R nf(x). A standard method for improving the estimate x c is to choose a direction
More informationINTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,
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 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 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 informationMath 104: Introduction to Analysis
Math 104: Introduction to Analysis Evan Chen UC Berkeley Notes for the course MATH 104, instructed by Charles Pugh. 1 1 August 29, 2013 Hard: #22 in Chapter 1. Consider a pile of sand principle. You wish
More information15 Limit sets. Lyapunov functions
15 Limit sets. Lyapunov functions At this point, considering the solutions to ẋ = f(x), x U R 2, (1) we were most interested in the behavior of solutions when t (sometimes, this is called asymptotic behavior
More information