On new chaotic mappings in symbol space
|
|
- Pearl Briggs
- 6 years ago
- Views:
Transcription
1 Acta Mech Sin DOI /s RESEARCH PAPER On new chaotic mappings in symbol space Inese Bula Jānis Buls Irita Rumbeniece Received: 24 August 2010 / Revised: 15 September 2010 / Accepted: 15 September 2010 The Chinese Society of Theoretical and Applied Mechanics and Springer-Verlag Berlin Heidelberg 2011 Abstract A well known chaotic mapping in symbol space is a shift mapping. However, other chaotic mappings in symbol space exist too. The basic change is to consider the process not only at a set of times which are equally spaced, say at unit time apart (a shift mapping), but at a set of times which are not equally spaced, say if the unit time can not be fixed. The increasing mapping as a generalization of the shift mapping and the k-switch mapping are introduced. The increasing and k-switch mappings are chaotic. Keywords Symbol space Chaotic mapping Increasing mapping k-switch mapping The project was supported by Latvian Scientific ( ) and ESF Project (2009/0223/1DP/ /09APIA/VIAA/008). I. Bula ( fi ) University of Latvia, Department of Mathematics, Zellu 8, Rīga, LV 1586, Latvia, and Institute of Mathematics and Computer Science of University of Latvia, Raina bulv. 29, Rīga, LV 1048, Latvia ibula@lanet.lv J. Buls I. Rumbeniece University of Latvia, Department of Mathematics, Zellu 8, Rīga, LV 1586, Latvia 1 Introduction The technique of characterizing the orbit structure of a dynamical system via infinite sequences of symbols is known as symbolic dynamics. If the process is a discrete one such as the iteration of a function f, then the theory hopes to understand the eventual behavior of the points (the orbit of x by f ) x, f (x), f 2 (x),, f n (x), as n becomes large. That is, dynamical systems ask two somewhat nonmathematical sounding questions: where do points go and what do they do when they get there? A well known chaotic mapping in symbol space is a shift mapping [1 4]. However, other chaotic mappings in symbol space exist too. The basic change is to consider the process (physical or social phenomenon) not only at a set of times which are equally spaced, say at unit time apart (a shift mapping), but at a set of times which are not equally spaced, say if the unit time (an increasing mapping) can not be fixed. There is a philosophy of modelling in which the idealized systems that have properties and can be closely approximated by physical systems are studied. The experimentalist takes the view that only quantities that can be measured have meaning. This is a mathematical reality that underlies what the experimentalist can see. The article is structured as follows. It starts with preliminaries concerning notations and terminology that is used in the paper followed by a definition of the chaotic mapping. The increasing mapping is considered in Sect. 3. The k- switch mapping is considered in Sect. 4. Much of what many researchers consider dynamical systems has been deliberately left out of this text. For example, the continuous
2 2 I. Bula, et al. systems or differential equations are not be treated at all. For this reason, the Sect. 5 is devoted to some interpretations. 2 Preliminaries This section presents the notation and terminology used in this paper. Terminology comes from combinatorics on words (for example, Ref. [5] or Ref. [6]). Some notations at first are given Z + = {x x Z & x > 0}, N = Z + {0}, k, n = {k, k + 1,, n}, k n and k, n N. where Z is the set of integers. From now on A will denote a finite alphabet, i.e., a finite nonempty set {a 0, a 1,, a n } and the elements are called letters. Assume that A contains at least two symbols. By A the set of all finite sequences of letters will be denoted, or finite words, this set contains empty word (or sequence) λ too. A + = A /{λ}. A word ω A + can be written uniquely as a sequence of letters as ω = ω 1 ω 2 ω 3 ω i ω l, with ω A, 1 i l. The integer l is called the length of ω and denoted ω. The length of λ is 0. An extension of the concept of finite word is obtained by considering infinite sequences of symbols over a finite set. One-sided (from left to right) infinite sequence or word, or simply infinite word, over A is any total map ω : N A. The set A ω contains all infinite words. A = A A ω.ifthe word u = u 0 u 1 u 2 A ω,whereu 0, u 1, u 2, A, then finite word u 0 u 1 u 2 u n is called the prefix ofu of length n + 1. The empty word λ is assumed to be the prefix ofu of length 0. Pref(u) = {λ, u 0, u 0 u 1, u 0 u 1 u 2,, u 0 u 1 u 2 u n, } is the set of all prefixes of word u. Secondly in A ametricd is introduced as follows. Definition 1 ([6]). Let u, v A. The mapping d : A A R is called a metric ( prefix metric) in the set A if 2 m, u v, d(u, v) = 0, u = v, where m = max{ ω ω Pref(u) Pref(v)}. The term chaos in reference to functions was first used in Li and Yorke s paper [7]. The following definition of Ref. [8] is used. Let (X,ρ) be metric space and A X and F A. Itsays that the set F is dense in A [1,4,8] if for each point x A and each ε>0, there exists y F such that d(x, y) <ε. It says that the function f is topologically transitive on A [1,4,8] if for any two points x and y in A and any ε>0, there is z A such that d(z, x) <εand d( f n (z), y) <εfor some n. It says that the function f : A A exhibits sensitive dependence on initial conditions [1,4,8] if there exists a δ>0such that for any x A and any ε > 0, there is a y A and natural number n such that d(x, y) < ε and d( f n (x), f n (y)) >δ. Definition 2 ([8]). The function f : A A is chaotic if (a) the set of periodic points of f is dense in X,(b) f is topologically transitive and (c) f exhibits sensitive dependence on initial conditions. Devaney s definition is not the only classification of a chaotic map. For example, another definition can be found in Ref. [4]. Also mappings with only one property sensitive dependence on initial conditions frequently are considered as chaotic (see Ref. [9]). Banks, Brooks, Cairns, Davis and Stacey [10] have demonstrated that for continuous functions, the defining characteristics of chaos are topological transitivity and the density of the set of periodic points. Theorem 1 ([10]). Let A be an infinite subset of metric space X and f : A A to be continuous. If f is topologically transitive on A and the set of periodic points of f is dense in A, then f is chaotic on A. But if the set of periodic points of f is dense in A and there is a point whose orbit under iteration of f is dense in the set A,then f is topologically transitive on A ([1]). Therefore in this case (A is infinite set) if f : A A to be continuous, then it is chaotic mapping. 3 Increasing mapping The notion of increasing mapping in Ref. [11] had been introduced. Let f ω (x) = x f (0) x f (1) x f (2) x f (i), i N, x A ω. In this case the function f is called the generator function of mapping f ω. Definition 3 ([11]). A function f : N N is called a positively increasing function if 0 < f (0) and i j [i < j f (i) < f ( j)]. The mapping f ω : A ω A ω is called the increasing mapping if its generator function f : N N is positively increasing. The well known shift map is increasing mapping in one-sided infinite symbol space A ω, in this case the generator function is a positively increasing function f : N N, where f (x) = x + 1. Theorem 2 ([11]). The increasing mapping f ω : A ω A ω is continuous in the set A ω. For increasing mapping f ω : A ω A ω exists a dense orbit in the set A ω.thesetofperiodic points of increasing mapping f ω : A ω A ω is dense in the set A ω. Theorem 3 ([11]). The increasing mapping f ω : A ω A ω is chaotic in the set A ω.
3 On new chaotic mappings in symbol space 3 Lastly two conclusions ([11]) about mappings in symbol space are recalled which are not chaotic: (1) If the generator function f : N N of mapping f ω : A ω A ω is such that f (0) = 0, then the generated mapping f ω is not chaotic in the set A ω ; (2) If the generator function f : N N of mapping f ω : A ω A ω is not one-to-one function, then the generated mapping f ω is not chaotic in the set A ω. 4 k-switch mapping In this section, another class of mappings such that are not increasing mappings are considered. The results of this section at first are represented in Ref. [12]. Definition 4. The mapping : A ω A ω is called k-switch mapping if s = s 0 s 1 s 2 s 3 s k s k+1 A ω (s) = s 1 s 2 s 3 s k s k+1 s k+2, where s i, i = 1, k, is the same symbol (letter) as s i or a A: s i = a. In other words, at first, this mapping is shift and secondly, this mapping switches some symbols (not more as k symbols). For example, let A = {0, 1} and f 1,3 (s 0 s 1 s 2 s 3 s 4 ) = s 1 s 2 s 3 s 4 s 5 It is a 3-switch mapping that switchesfirst and third symbols. Indices by mapping f show which symbols switches to another by the defined rule. For example, if s = , then f 1,3 (s) = If consider situation with A that contains at least three symbols A = {a 0, a 1, a 2,, a n }, then a rule which a i switches to a j and for every a j A exist only one a i A with this rule is defined. For example, if A = {a, b, c} and a switches to b, b to c and c to a,then f 1,3 (aaaaaaaaaa ) = babaaaaaa or f 1,3 (ababababab ) = cacababab. More formally, set a bijection : A A, andfix indices 1 i 1 < i 2 < < i n = k. Then (s 0 s 1 s 2 ) = σ 0 σ 1 σ 2 σ t where s t+1, if η i η = t + 1, σ t = s t+1, otherwise. Theorem 4. The k-switch mapping :A ω A ω is continuous in the set A ω. Proof. Fix word u A ω and ε > 0. It needs prove that there is δ>0such that whenever d(u, v) <δ, v A ω,then d( (u), (v)) <ε. Choose m such that 2 m <ε.let0<δ<2 (m+1).if d(u, v) <δ, then by definition of prefix metric follows that u i = v i for all i = 0, 1,, m. From definition of k-switch mapping: (1) if k < m, thenu i = v i, i = 1, 2,, k, andu i = v i, i = k + 1, k + 2,, m or (2) if k m,thenu i = v i, i = 1, 2,, m. Therefore d( (u), (v)) 2 m <ε. Since A ω is an infinite metric space and k-switch mapping : A ω A ω is continuous then by Theorem 1 for chaotic mapping is sufficient to prove that this mapping is topologically transitive on A ω and the periodic points of mapping are dense in A ω. Theorem 5. The k-switch mapping :A ω A ω is topologically transitive in the set A ω. Proof. Fixwordsu, v A ω and ε>0. It needs prove that there is word z A ω such that d(z, u) <εand that there exists iteration n such that d( f n (z), v) <ε. Choose m such that 2 m <ε. Then there exist a word z A ω such that u i = z i, i = 0, 1,, m 1, and therefore d(z, u) 2 m <ε. Choose n = m. Byn iterations f n (z) = z mz m+1 z m+k 1 z m+k z m+k+1, where the word z m z m+1 z m+k 1 is obtained from word z m z m+1 z m+k 1 switching some symbols several times but some symbols are not switched. Equivalent words are needed to find (1) if k < m, thenz m z m+1 z m+k 1 z m+k z m+k+1 z 2m 1 = v 0 v 1 v 2 v m 1 or (2) if k m,thenz m z m+1 z 2m 1 = v 0 v 1 v 2 v m 1. Symbol switch by rule so that it is possible to find z m, z m+1, z m+2,, z 2m 1 such that (1) or (2) follows has been defined. 4, z = u 0 u 1 u 2 u 3 z 4 z 5 z 6 z 7 A ω and f 1,3 : A ω A ω.then (the switch of symbol we denote with overline) f 1,3 (z) = u 1 u 2 u 3 z 4 z 5 z 6 z 7, f1,3 2 (z) = u 2u 3 z 4 z 5 z 6 z 7, f 3 1,3 (z) = u 3z 4 z 5 z 6 z 7 z 8, f 4 1,3 (z) = z 4z 5 z 6 z 7 z 8. If A = {0, 1}, then0 = 1, 1 = 0, 0 = 0and1 = 1. If v = v 0 v 1 v 2 v 3,thenz 4 = z 4 = v 0, z 5 = v 1, z 6 = v 3, z 7 = v 4. If A = {a, b, c} and a = b, b = c, c = a, andv = aabcaabc, then z 4 = a, z 5 = a, z 6 = b, z 7 = c, therefore z 4 = b, z 5 = c, z 6 = a, z 7 = c. It has proved that there exist z such that d(z, u) <εand d( f n (z), v) <ε.
4 4 I. Bula, et al. Theorem 6. The set of periodic points of k-switch mapping : A ω A ω is dense set in the set A ω. Proof. Let ε>0. Then there exists m such that 2 m <ε. Assume that u A ω and v is a prefix ofwordu of length m. Then there exist a point (infinite word) x A ω with the same prefixasvand this x is a periodic point for k-switch mapping with period m. In this case d(u, x) 2 m <ε. Let x = u 0 u 1 u 2 u m 1 x 0 x 1 x 2. Consider two cases: (1) if k < m, then the m-th iteration of x by : A ω A ω is in form f m(x) = y 0y 1 y k 1 x k x m 1. In this case from equality y 0 y 1 y k 1 x k x m 1 = u 0 u 1 u 2 u m 1 it is possible to determine symbols x 0, x 1, x 2,, x m 1 and then x is in the form x=u 0 u 1 u 2 u m 1 x 0 x 1 x m 1 x 0 x 1 x m 1 x 0 x 1 x m 1, and this point is periodic point with period m. 4, A = {a, b, c}, a = b, b = c, c = a, v = baca and f 1,3 : A ω A ω.then f 4 1,3 (x) = x 0x 1 x 2 x 3 x 0 x 1 x 2 x 3 x 0 x 1 x 2 x 3 and x 0 = b, x 1 = a, x 2 = c, x 3 = a therefore x 0 = c, x 1 = c, x 2 = b, x 3 = a. Theinfinite word x = baca ccba ccba ccba is a periodic point for f 1,3 with period 4 and the distance between u = baca and x is less than 2 4 <ε. (2) if k m,then f m (x) = y 0y 1 y m 1 y m y k 1 x k x k+1. In this case from equality y 0 y 1 y m 1 y m y k 1 = u 0 u 1 u 2 u m 1 x 0 x 1 x k m 1 it is possible to determine symbols x 0, x 1, x 2,, x k 1 and then x is in the form x = u 0 u 1 u 2 u m 1 x 0 x 1 x k m 1 x k m x k m+1 x k 1 x k m x k m+1 x k 1 x k m x k m+1 and this point is a periodic point with period m. 3, A = {a, b, c}, a = b, b = c, c = a, v = bac and f 1,2,5 is 5-switch mapping. Let x = bacx 0 x 1 x 2 x 3 x 4 x 2 x 3 x 4 x 2 x 3 x 4. Then f 3 1,2,5 (x) = x 0x 1 x 2 x 3 x 4 x 2 x 3 x 4 x 2 x 3 x 4 and equalities could be obtained x 0 = b, x 1 = a, x 2 = c, x 3 = x 0, x 4 = x 1, therefore x 0 = x 1 = c, x 2 = x 3 = x 4 = b and the point x = bac cc bbb bbb bbb bbb is a periodic point with period 3 for mapping f 1,2,5. Finally the following could be concluded. Theorem 7. The k-switch mapping : A ω A ω is chaotic in the set A ω. Two different classes of chaotic mappings have been demonstrated. It is possible for increasing mapping (from two symbols 0 and 1 space) to construct corresponding mapping in unit segment that is chaotic [13]. Similarly the chaotic map in the interval [0, 1] from every chaotic mapping of two symbols 0 and 1 space is obtained. Models with chaotic mappings are not predictable in long-term. 5 Interpretations Let x(t 0 ), x(t 1 ),, x(t n ), (1) be the flow of discrete signals. Suppose that the experimentally observed subsequence is as follow x(t 0 ), x(t 1 ),, x(t n ), (2) If T 0 = t 1, T 1 = t 2,, T n = t n+1,, the shift map could be obtained. Notice if the infinite word x = x 0 x 1 x n instead of sequence (1) is got, then the infinite word y = y 0 y 1 y n instead of Eq. (2) could be achieved. Here t y t = x t 1. Hence, the shift map f (t) = t + 1 is obtained, namely, y = f ω (x) = x f (0) x f (1) x f (2) x f (n) It did not claim that the function f (t) = t + 1 is chaotic on the real line R but this function as a generator creates the chaotic map f ω in the symbol space A ω had proved. It had proved [11] something more, namely, every positively increasing function g as a generator creates the chaotic map g ω in the symbol space A ω. In other words, if in our experiment only subsequence had been detected x(t 1 ), x(t 3 ),, x(t 2n 1 ), even then chaotic behavior can be revealed. Now it has proved that every k-switch mapping : A ω A ω is chaotic in the symbol space A ω.inotherwords, if in our experiment only subsequence detected x(t 1 ), x(t 2 ),, x(t n ), with some kind of regular distortion even then we can reveal chaotic behavior. References 1 Holmgren, R.A.: A First Course in Discrete Dynamical Systems. Universitext, 2nd edn., Springer-Verlag (1996)
5 On new chaotic mappings in symbol space 5 2 Kitchens, B.P.: Symbolic Dynamics. One-sided, Two-sided and Countable State Markov Shifts. Springer-Verlag (1998) 3 Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press (1995) 4 Robinson, C.: Dynamical Systems. Stability, Symbolic Dynamics, and Chaos. CRS Press (1995) 5 Lothaire, M.: Combinatorics on Words. Encyclopedia of Mathematics and Its Applications 17, Addison-Wesley, Reading, MA (1983) 6 de Luca, A., Varricchio, S.: Finiteness and regularity in semigroups and formal languages. In: Monographs in Theoretical Computer Science, Springer-Verlag (1999) 7 Li, T.Y., Yorke, J.A.: Period three implies chaos. Amer. Math. Monthly 82, (1975) 8 Devaney, R.: An introduction to chaotic dynamical systems. Benjamin Cummings: Menlo Park, CA (1986) 9 Gulick, D.: Encounters with Chaos. McGraw-Hill, Inc. (1992) 10 Banks, J., Brooks, J., Cairns, G., et al.: On Devaney s definition of chaos. Amer. Math. Monthly 99, (1992) 11 Bula, I., Buls, J., Rumbeniece, I.: Why can we detect the chaos? J. of Vibroengineering 10, (2008) 12 Bula, I., Buls, J., Rumbeniece, I.: On chaotic mappings in symbol space. In: Awrejcewiz, J. ed. Proc. of the 10th Conf. on Dynamical Systems Theory and Applications 2, December 7 10, 2009, Łódź, Poland (2009) 13 Bula, I.: Topological semi-conjugacy and chaotic mappings. In: Proc. of 6th EUROMECH Nonlinear Dynamics Conference (ENOC 2008), Saint Petersburg, Russia, 2008
A Note on the Generalized Shift Map
Gen. Math. Notes, Vol. 1, No. 2, December 2010, pp. 159-165 ISSN 2219-7184; Copyright c ICSRS Publication, 2010 www.i-csrs.org Available free online at http://www.geman.in A Note on the Generalized Shift
More informationA note on Devaney's definition of chaos
University of Wollongong Research Online Faculty of Engineering and Information Sciences - Papers: Part A Faculty of Engineering and Information Sciences 2004 A note on Devaney's definition of chaos Joseph
More informationCHAOTIC UNIMODAL AND BIMODAL MAPS
CHAOTIC UNIMODAL AND BIMODAL MAPS FRED SHULTZ Abstract. We describe up to conjugacy all unimodal and bimodal maps that are chaotic, by giving necessary and sufficient conditions for unimodal and bimodal
More informationWHAT IS A CHAOTIC ATTRACTOR?
WHAT IS A CHAOTIC ATTRACTOR? CLARK ROBINSON Abstract. Devaney gave a mathematical definition of the term chaos, which had earlier been introduced by Yorke. We discuss issues involved in choosing the properties
More informationDevaney's Chaos of One Parameter Family. of Semi-triangular Maps
International Mathematical Forum, Vol. 8, 2013, no. 29, 1439-1444 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2013.36114 Devaney's Chaos of One Parameter Family of Semi-triangular Maps
More informationCHAOTIC BEHAVIOR IN A FORECAST MODEL
CHAOTIC BEHAVIOR IN A FORECAST MODEL MICHAEL BOYLE AND MARK TOMFORDE Abstract. We examine a certain interval map, called the weather map, that has been used by previous authors as a toy model for weather
More informationON DEVANEY S DEFINITION OF CHAOS AND DENSE PERIODIC POINTS
ON DEVANEY S DEFINITION OF CHAOS AND DENSE PERIODIC POINTS SYAHIDA CHE DZUL-KIFLI AND CHRIS GOOD Abstract. We look again at density of periodic points and Devaney Chaos. We prove that if f is Devaney Chaotic
More informationINVESTIGATION OF CHAOTICITY OF THE GENERALIZED SHIFT MAP UNDER A NEW DEFINITION OF CHAOS AND COMPARE WITH SHIFT MAP
ISSN 2411-247X INVESTIGATION OF CHAOTICITY OF THE GENERALIZED SHIFT MAP UNDER A NEW DEFINITION OF CHAOS AND COMPARE WITH SHIFT MAP Hena Rani Biswas * Department of Mathematics, University of Barisal, Barisal
More informationLINEAR CHAOS? Nathan S. Feldman
LINEAR CHAOS? Nathan S. Feldman In this article we hope to convience the reader that the dynamics of linear operators can be fantastically complex and that linear dynamics exhibits the same beauty and
More informationPERIODIC POINTS OF THE FAMILY OF TENT MAPS
PERIODIC POINTS OF THE FAMILY OF TENT MAPS ROBERTO HASFURA-B. AND PHILLIP LYNCH 1. INTRODUCTION. Of interest in this article is the dynamical behavior of the one-parameter family of maps T (x) = (1/2 x
More informationUniform Convergence, Mixing and Chaos
Studies in Mathematical Sciences Vol. 2, No. 1, 2011, pp. 73-79 www.cscanada.org ISSN 1923-8444 [Print] ISSN 1923-8452 [Online] www.cscanada.net Uniform Convergence, Mixing and Chaos Lidong WANG 1,2 Lingling
More informationSHADOWING PROPERTY FOR INDUCED SET-VALUED DYNAMICAL SYSTEMS OF SOME EXPANSIVE MAPS
Dynamic Systems and Applications 19 (2010) 405-414 SHADOWING PROPERTY FOR INDUCED SET-VALUED DYNAMICAL SYSTEMS OF SOME EXPANSIVE MAPS YUHU WU 1,2 AND XIAOPING XUE 1 1 Department of Mathematics, Harbin
More informationOn Devaney Chaos and Dense Periodic Points: Period 3 and Higher Implies Chaos
On Devaney Chaos and Dense Periodic Points: Period 3 and Higher Implies Chaos Syahida Che Dzul-Kifli and Chris Good Abstract. We look at density of periodic points and Devaney Chaos. We prove that if f
More informationARTICLE IN PRESS. J. Math. Anal. Appl. ( ) Note. On pairwise sensitivity. Benoît Cadre, Pierre Jacob
S0022-27X0500087-9/SCO AID:9973 Vol. [DTD5] P.1 1-8 YJMAA:m1 v 1.35 Prn:15/02/2005; 16:33 yjmaa9973 by:jk p. 1 J. Math. Anal. Appl. www.elsevier.com/locate/jmaa Note On pairwise sensitivity Benoît Cadre,
More informationONE DIMENSIONAL CHAOTIC DYNAMICAL SYSTEMS
Journal of Pure and Applied Mathematics: Advances and Applications Volume 0 Number 0 Pages 69-0 ONE DIMENSIONAL CHAOTIC DYNAMICAL SYSTEMS HENA RANI BISWAS Department of Mathematics University of Barisal
More informationLi- Yorke Chaos in Product Dynamical Systems
Advances in Dynamical Systems and Applications. ISSN 0973-5321, Volume 12, Number 1, (2017) pp. 81-88 Research India Publications http://www.ripublication.com Li- Yorke Chaos in Product Dynamical Systems
More informationTHE SET OF RECURRENT POINTS OF A CONTINUOUS SELF-MAP ON AN INTERVAL AND STRONG CHAOS
J. Appl. Math. & Computing Vol. 4(2004), No. - 2, pp. 277-288 THE SET OF RECURRENT POINTS OF A CONTINUOUS SELF-MAP ON AN INTERVAL AND STRONG CHAOS LIDONG WANG, GONGFU LIAO, ZHENYAN CHU AND XIAODONG DUAN
More informationChaotic Subsystem Come From Glider E 3 of CA Rule 110
Chaotic Subsystem Come From Glider E 3 of CA Rule 110 Lingxiao Si, Fangyue Chen, Fang Wang, and Pingping Liu School of Science, Hangzhou Dianzi University, Hangzhou, Zhejiang, P. R. China Abstract The
More informationChaos in the Dynamics of the Family of Mappings f c (x) = x 2 x + c
IOSR Journal of Mathematics (IOSR-JM) e-issn: 78-578, p-issn: 319-765X. Volume 10, Issue 4 Ver. IV (Jul-Aug. 014), PP 108-116 Chaos in the Dynamics of the Family of Mappings f c (x) = x x + c Mr. Kulkarni
More informationREVERSALS ON SFT S. 1. Introduction and preliminaries
Trends in Mathematics Information Center for Mathematical Sciences Volume 7, Number 2, December, 2004, Pages 119 125 REVERSALS ON SFT S JUNGSEOB LEE Abstract. Reversals of topological dynamical systems
More informationFUNCTION BASES FOR TOPOLOGICAL VECTOR SPACES. Yılmaz Yılmaz
Topological Methods in Nonlinear Analysis Journal of the Juliusz Schauder Center Volume 33, 2009, 335 353 FUNCTION BASES FOR TOPOLOGICAL VECTOR SPACES Yılmaz Yılmaz Abstract. Our main interest in this
More informationNewton, Fermat, and Exactly Realizable Sequences
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 8 (2005), Article 05.1.2 Newton, Fermat, and Exactly Realizable Sequences Bau-Sen Du Institute of Mathematics Academia Sinica Taipei 115 TAIWAN mabsdu@sinica.edu.tw
More informationPERIODS OF FACTORS OF THE FIBONACCI WORD
PERIODS OF FACTORS OF THE FIBONACCI WORD KALLE SAARI Abstract. We show that if w is a factor of the infinite Fibonacci word, then the least period of w is a Fibonacci number. 1. Introduction The Fibonacci
More informationChaos, Complexity, and Inference (36-462)
Chaos, Complexity, and Inference (36-462) Lecture 5: Symbolic Dynamics; Making Discrete Stochastic Processes from Continuous Deterministic Dynamics Cosma Shalizi 27 January 2009 Symbolic dynamics Reducing
More informationA BOREL SOLUTION TO THE HORN-TARSKI PROBLEM. MSC 2000: 03E05, 03E20, 06A10 Keywords: Chain Conditions, Boolean Algebras.
A BOREL SOLUTION TO THE HORN-TARSKI PROBLEM STEVO TODORCEVIC Abstract. We describe a Borel poset satisfying the σ-finite chain condition but failing to satisfy the σ-bounded chain condition. MSC 2000:
More informationExact Devaney Chaos and Entropy
QUALITATIVE THEORY DYNAMICAL SYSTEMS 6, 169 179 (2005) ARTICLE NO. 95 Exact Devaney Chaos and Entropy Dominik Kwietniak Institute of Mathematics, Jagiellonian University, Reymonta 4, 30-059 Kraków, Poland
More informationCantor sets, Bernoulli shifts and linear dynamics
Cantor sets, Bernoulli shifts and linear dynamics S. Bartoll, F. Martínez-Giménez, M. Murillo-Arcila and A. Peris Abstract Our purpose is to review some recent results on the interplay between the symbolic
More information16 1 Basic Facts from Functional Analysis and Banach Lattices
16 1 Basic Facts from Functional Analysis and Banach Lattices 1.2.3 Banach Steinhaus Theorem Another fundamental theorem of functional analysis is the Banach Steinhaus theorem, or the Uniform Boundedness
More informationPAijpam.eu ON SUBSPACE-TRANSITIVE OPERATORS
International Journal of Pure and Applied Mathematics Volume 84 No. 5 2013, 643-649 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v84i5.15
More informationPHY411 Lecture notes Part 5
PHY411 Lecture notes Part 5 Alice Quillen January 27, 2016 Contents 0.1 Introduction.................................... 1 1 Symbolic Dynamics 2 1.1 The Shift map.................................. 3 1.2
More informationComplexity and Simplicity in the dynamics of Totally Transitive graph maps
Complexity and Simplicity in the dynamics of Totally Transitive graph maps Lluís Alsedà in collaboration with Liane Bordignon and Jorge Groisman Centre de Recerca Matemàtica Departament de Matemàtiques
More informationSome Results and Problems on Quasi Weakly Almost Periodic Points
Λ43ΨΛ3fi ffi Φ ο Vol.43, No.3 204ff5μ ADVANCES IN MATHEMATICS(CHINA) May, 204 doi: 0.845/sxjz.202002a Some Results and Problems on Quasi Weakly Almost Periodic Points YIN Jiandong, YANG Zhongxuan (Department
More informationTurbulence and Devaney s Chaos in Interval
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 2 (2017), pp. 713-717 Research India Publications http://www.ripublication.com Turbulence and Devaney s Chaos in Interval
More informationNOWHERE LOCALLY UNIFORMLY CONTINUOUS FUNCTIONS
NOWHERE LOCALLY UNIFORMLY CONTINUOUS FUNCTIONS K. Jarosz Southern Illinois University at Edwardsville, IL 606, and Bowling Green State University, OH 43403 kjarosz@siue.edu September, 995 Abstract. Suppose
More informationFrom Glider to Chaos: A Transitive Subsystem Derived From Glider B of CA Rule 110
From Glider to Chaos: A Transitive Subsystem Derived From Glider B of CA Rule 110 Pingping Liu, Fangyue Chen, Lingxiao Si, and Fang Wang School of Science, Hangzhou Dianzi University, Hangzhou, Zhejiang,
More informationAbout Duval Extensions
About Duval Extensions Tero Harju Dirk Nowotka Turku Centre for Computer Science, TUCS Department of Mathematics, University of Turku June 2003 Abstract A word v = wu is a (nontrivial) Duval extension
More informationWord-representability of line graphs
Word-representability of line graphs Sergey Kitaev,1,3, Pavel Salimov,1,2, Christopher Severs,1, and Henning Úlfarsson,1 1 Reykjavik University, School of Computer Science, Menntavegi 1, 101 Reykjavik,
More informationHAIYUN ZHOU, RAVI P. AGARWAL, YEOL JE CHO, AND YONG SOO KIM
Georgian Mathematical Journal Volume 9 (2002), Number 3, 591 600 NONEXPANSIVE MAPPINGS AND ITERATIVE METHODS IN UNIFORMLY CONVEX BANACH SPACES HAIYUN ZHOU, RAVI P. AGARWAL, YEOL JE CHO, AND YONG SOO KIM
More informationTHE GOLDEN MEAN SHIFT IS THE SET OF 3x + 1 ITINERARIES
THE GOLDEN MEAN SHIFT IS THE SET OF 3x + 1 ITINERARIES DAN-ADRIAN GERMAN Department of Computer Science, Indiana University, 150 S Woodlawn Ave, Bloomington, IN 47405-7104, USA E-mail: dgerman@csindianaedu
More informationMATH 614 Dynamical Systems and Chaos Lecture 6: Symbolic dynamics.
MATH 614 Dynamical Systems and Chaos Lecture 6: Symbolic dynamics. Metric space Definition. Given a nonempty set X, a metric (or distance function) on X is a function d : X X R that satisfies the following
More informationTHE MEASURE-THEORETIC ENTROPY OF LINEAR CELLULAR AUTOMATA WITH RESPECT TO A MARKOV MEASURE. 1. Introduction
THE MEASURE-THEORETIC ENTROPY OF LINEAR CELLULAR AUTOMATA WITH RESPECT TO A MARKOV MEASURE HASAN AKIN Abstract. The purpose of this short paper is to compute the measure-theoretic entropy of the onedimensional
More informationCombinatorial Interpretations of a Generalization of the Genocchi Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 7 (2004), Article 04.3.6 Combinatorial Interpretations of a Generalization of the Genocchi Numbers Michael Domaratzki Jodrey School of Computer Science
More informationSemigroup invariants of symbolic dynamical systems
Semigroup invariants of symbolic dynamical systems Alfredo Costa Centro de Matemática da Universidade de Coimbra Coimbra, October 6, 2010 Discretization Discretization Discretization 2 1 3 4 Discretization
More informationarxiv: v2 [math.gn] 27 Sep 2010
THE GROUP OF ISOMETRIES OF A LOCALLY COMPACT METRIC SPACE WITH ONE END arxiv:0911.0154v2 [math.gn] 27 Sep 2010 ANTONIOS MANOUSSOS Abstract. In this note we study the dynamics of the natural evaluation
More informationUnbordered Factors and Lyndon Words
Unbordered Factors and Lyndon Words J.-P. Duval Univ. of Rouen France T. Harju Univ. of Turku Finland September 2006 D. Nowotka Univ. of Stuttgart Germany Abstract A primitive word w is a Lyndon word if
More informatione Chaotic Generalized Shift Dynamical Systems
Punjab University Journal of Mathematics (ISS 1016-2526) Vol. 47(1)(2015) pp. 135-140 e Chaotic Generalized Shift Dynamical Systems Fatemah Ayatollah Zadeh Shirazi Faculty of Mathematics, Statistics and
More informationWhitney topology and spaces of preference relations. Abstract
Whitney topology and spaces of preference relations Oleksandra Hubal Lviv National University Michael Zarichnyi University of Rzeszow, Lviv National University Abstract The strong Whitney topology on the
More informationSequence of maximal distance codes in graphs or other metric spaces
Electronic Journal of Graph Theory and Applications 1 (2) (2013), 118 124 Sequence of maximal distance codes in graphs or other metric spaces C. Delorme University Paris Sud 91405 Orsay CEDEX - France.
More informationSynchronization, Chaos, and the Dynamics of Coupled Oscillators. Supplemental 1. Winter Zachary Adams Undergraduate in Mathematics and Biology
Synchronization, Chaos, and the Dynamics of Coupled Oscillators Supplemental 1 Winter 2017 Zachary Adams Undergraduate in Mathematics and Biology Outline: The shift map is discussed, and a rigorous proof
More informationSENSITIVITY AND REGIONALLY PROXIMAL RELATION IN MINIMAL SYSTEMS
SENSITIVITY AND REGIONALLY PROXIMAL RELATION IN MINIMAL SYSTEMS SONG SHAO, XIANGDONG YE AND RUIFENG ZHANG Abstract. A topological dynamical system is n-sensitive, if there is a positive constant such that
More informationON SPACES IN WHICH COMPACT-LIKE SETS ARE CLOSED, AND RELATED SPACES
Commun. Korean Math. Soc. 22 (2007), No. 2, pp. 297 303 ON SPACES IN WHICH COMPACT-LIKE SETS ARE CLOSED, AND RELATED SPACES Woo Chorl Hong Reprinted from the Communications of the Korean Mathematical Society
More informationPseudo Sylow numbers
Pseudo Sylow numbers Benjamin Sambale May 16, 2018 Abstract One part of Sylow s famous theorem in group theory states that the number of Sylow p- subgroups of a finite group is always congruent to 1 modulo
More informationOscillations in Damped Driven Pendulum: A Chaotic System
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 3, Issue 10, October 2015, PP 14-27 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org Oscillations
More informationSome chaotic and mixing properties of Zadeh s extension
Some chaotic mixing properties of Zadeh s extension Jiří Kupka Institute for Research Applications of Fuzzy Modeling, University of Ostrava 30. dubna 22, 701 33 Ostrava, Czech Republic Email: Jiri.Kupka@osu.cz
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationThe small ball property in Banach spaces (quantitative results)
The small ball property in Banach spaces (quantitative results) Ehrhard Behrends Abstract A metric space (M, d) is said to have the small ball property (sbp) if for every ε 0 > 0 there exists a sequence
More informationarxiv: v2 [math.fa] 8 Jan 2014
A CLASS OF TOEPLITZ OPERATORS WITH HYPERCYCLIC SUBSPACES ANDREI LISHANSKII arxiv:1309.7627v2 [math.fa] 8 Jan 2014 Abstract. We use a theorem by Gonzalez, Leon-Saavedra and Montes-Rodriguez to construct
More informationDYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS
DYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS Issam Naghmouchi To cite this version: Issam Naghmouchi. DYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS. 2010. HAL Id: hal-00593321 https://hal.archives-ouvertes.fr/hal-00593321v2
More informationHash Functions Using Chaotic Iterations
Hash Functions Using Chaotic Iterations Jacques Bahi, Christophe Guyeux To cite this version: Jacques Bahi, Christophe Guyeux. Hash Functions Using Chaotic Iterations. Journal of Algorithms Computational
More informationSPACES ENDOWED WITH A GRAPH AND APPLICATIONS. Mina Dinarvand. 1. Introduction
MATEMATIČKI VESNIK MATEMATIQKI VESNIK 69, 1 (2017), 23 38 March 2017 research paper originalni nauqni rad FIXED POINT RESULTS FOR (ϕ, ψ)-contractions IN METRIC SPACES ENDOWED WITH A GRAPH AND APPLICATIONS
More informationOrder-theoretical Characterizations of Countably Approximating Posets 1
Int. J. Contemp. Math. Sciences, Vol. 9, 2014, no. 9, 447-454 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijcms.2014.4658 Order-theoretical Characterizations of Countably Approximating Posets
More informationOn Firmness of the State Space and Positive Elements of a Banach Algebra 1
Journal of Universal Computer Science, vol. 11, no. 12 (2005), 1963-1969 submitted: 14/10/05, accepted: 15/11/05, appeared: 28/12/05 J.UCS On Firmness of the State Space and Positive Elements of a Banach
More informationTHE CONLEY ATTRACTORS OF AN ITERATED FUNCTION SYSTEM
Bull. Aust. Math. Soc. 88 (2013), 267 279 doi:10.1017/s0004972713000348 THE CONLEY ATTRACTORS OF AN ITERATED FUNCTION SYSTEM MICHAEL F. BARNSLEY and ANDREW VINCE (Received 15 August 2012; accepted 21 February
More informationTHE NEARLY ADDITIVE MAPS
Bull. Korean Math. Soc. 46 (009), No., pp. 199 07 DOI 10.4134/BKMS.009.46..199 THE NEARLY ADDITIVE MAPS Esmaeeil Ansari-Piri and Nasrin Eghbali Abstract. This note is a verification on the relations between
More informationFREQUENTLY HYPERCYCLIC OPERATORS WITH IRREGULARLY VISITING ORBITS. S. Grivaux
FREQUENTLY HYPERCYCLIC OPERATORS WITH IRREGULARLY VISITING ORBITS by S. Grivaux Abstract. We prove that a bounded operator T on a separable Banach space X satisfying a strong form of the Frequent Hypercyclicity
More informationGeometry and topology of continuous best and near best approximations
Journal of Approximation Theory 105: 252 262, Geometry and topology of continuous best and near best approximations Paul C. Kainen Dept. of Mathematics Georgetown University Washington, D.C. 20057 Věra
More informationExistence and data dependence for multivalued weakly Ćirić-contractive operators
Acta Univ. Sapientiae, Mathematica, 1, 2 (2009) 151 159 Existence and data dependence for multivalued weakly Ćirić-contractive operators Liliana Guran Babeş-Bolyai University, Department of Applied Mathematics,
More informationON HIGHLY PALINDROMIC WORDS
ON HIGHLY PALINDROMIC WORDS Abstract. We study some properties of palindromic (scattered) subwords of binary words. In view of the classical problem on subwords, we show that the set of palindromic subwords
More informationMath 4317 : Real Analysis I Mid-Term Exam 1 25 September 2012
Instructions: Answer all of the problems. Math 4317 : Real Analysis I Mid-Term Exam 1 25 September 2012 Definitions (2 points each) 1. State the definition of a metric space. A metric space (X, d) is set
More informationSolutions of two-point boundary value problems via phase-plane analysis
Electronic Journal of Qualitative Theory of Differential Equations Proc. 1th Coll. Qualitative Theory of Diff. Equ. (July 1 4, 215, Szeged, Hungary) 216, No. 4, 1 1; doi: 1.14232/ejqtde.216.8.4 http://www.math.u-szeged.hu/ejqtde/
More informationAN EXTENSION OF MARKOV PARTITIONS FOR A CERTAIN TORAL ENDOMORPHISM
UNIVERSITATIS IAGELLONICAE ACTA MATHEMATICA, FASCICULUS XXXIX 2001 AN EXTENSION OF MARKOV PARTITIONS FOR A CERTAIN TORAL ENDOMORPHISM by Kinga Stolot Abstract. We define and construct Markov partition
More informationCLASS NOTES FOR APRIL 14, 2000
CLASS NOTES FOR APRIL 14, 2000 Announcement: Section 1.2, Questions 3,5 have been deferred from Assignment 1 to Assignment 2. Section 1.4, Question 5 has been dropped entirely. 1. Review of Wednesday class
More informationComplex Shift Dynamics of Some Elementary Cellular Automaton Rules
Complex Shift Dynamics of Some Elementary Cellular Automaton Rules Junbiao Guan School of Science, Hangzhou Dianzi University Hangzhou, Zhejiang 3008, P.R. China junbiaoguan@gmail.com Kaihua Wang School
More informationVALUATION THEORY, GENERALIZED IFS ATTRACTORS AND FRACTALS
VALUATION THEORY, GENERALIZED IFS ATTRACTORS AND FRACTALS JAN DOBROWOLSKI AND FRANZ-VIKTOR KUHLMANN Abstract. Using valuation rings and valued fields as examples, we discuss in which ways the notions of
More informationOn Uniform Spaces with Invariant Nonstandard Hulls
1 13 ISSN 1759-9008 1 On Uniform Spaces with Invariant Nonstandard Hulls NADER VAKIL Abstract: Let X, Γ be a uniform space with its uniformity generated by a set of pseudo-metrics Γ. Let the symbol " denote
More informationRELATIVE TO ANY NONRECURSIVE SET
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 126, Number 7, July 1998, Pages 2117 2122 S 0002-9939(98)04307-X RELATIVE TO ANY NONRECURSIVE SET THEODORE A. SLAMAN (Communicated by Andreas R.
More informationRemoving the Noise from Chaos Plus Noise
Removing the Noise from Chaos Plus Noise Steven P. Lalley Department of Statistics University of Chicago November 5, 2 Abstract The problem of extracting a signal x n generated by a dynamical system from
More informationBoundedly complete weak-cauchy basic sequences in Banach spaces with the PCP
Journal of Functional Analysis 253 (2007) 772 781 www.elsevier.com/locate/jfa Note Boundedly complete weak-cauchy basic sequences in Banach spaces with the PCP Haskell Rosenthal Department of Mathematics,
More informationA PASCAL-LIKE BOUND FOR THE NUMBER OF NECKLACES WITH FIXED DENSITY
A PASCAL-LIKE BOUND FOR THE NUMBER OF NECKLACES WITH FIXED DENSITY I. HECKENBERGER AND J. SAWADA Abstract. A bound resembling Pascal s identity is presented for binary necklaces with fixed density using
More informationMathematical Induction
Chapter 6 Mathematical Induction 6.1 The Process of Mathematical Induction 6.1.1 Motivating Mathematical Induction Consider the sum of the first several odd integers. produce the following: 1 = 1 1 + 3
More informationA G δ IDEAL OF COMPACT SETS STRICTLY ABOVE THE NOWHERE DENSE IDEAL IN THE TUKEY ORDER
A G δ IDEAL OF COMPACT SETS STRICTLY ABOVE THE NOWHERE DENSE IDEAL IN THE TUKEY ORDER JUSTIN TATCH MOORE AND S LAWOMIR SOLECKI Abstract. We prove that there is a G δ σ-ideal of compact sets which is strictly
More informationLinear distortion of Hausdorff dimension and Cantor s function
Collect. Math. 57, 2 (2006), 93 20 c 2006 Universitat de Barcelona Linear distortion of Hausdorff dimension and Cantor s function O. Dovgoshey and V. Ryazanov Institute of Applied Mathematics and Mechanics,
More informationChaos and Cryptography
Chaos and Cryptography Vishaal Kapoor December 4, 2003 In his paper on chaos and cryptography, Baptista says It is possible to encrypt a message (a text composed by some alphabet) using the ergodic property
More informationConnections between connected topological spaces on the set of positive integers
Cent. Eur. J. Math. 11(5) 2013 876-881 DOI: 10.2478/s11533-013-0210-3 Central European Journal of Mathematics Connections between connected topological spaces on the set of positive integers Research Article
More informationOn negative bases.
On negative bases Christiane Frougny 1 and Anna Chiara Lai 2 1 LIAFA, CNRS UMR 7089, case 7014, 75205 Paris Cedex 13, France, and University Paris 8, Christiane.Frougny@liafa.jussieu.fr 2 LIAFA, CNRS UMR
More informationAbstract. We characterize Ramsey theoretically two classes of spaces which are related to γ-sets.
2 Supported by MNZŽS RS 125 MATEMATIQKI VESNIK 58 (2006), 125 129 UDK 515.122 originalni nauqni rad research paper SPACES RELATED TO γ-sets Filippo Cammaroto 1 and Ljubiša D.R. Kočinac 2 Abstract. We characterize
More informationSensitive Dependence on Initial Conditions, and Chaotic Group Actions
Sensitive Dependence on Initial Conditions, and Chaotic Group Actions Murtadha Mohammed Abdulkadhim Al-Muthanna University, College of Education, Department of Mathematics Al-Muthanna, Iraq Abstract: -
More informationLecture 16 Symbolic dynamics.
Lecture 16 Symbolic dynamics. 1 Symbolic dynamics. The full shift on two letters and the Baker s transformation. 2 Shifts of finite type. 3 Directed multigraphs. 4 The zeta function. 5 Topological entropy.
More informationCompact Sets with Dense Orbit in 2 X
Volume 40, 2012 Pages 319 330 http://topology.auburn.edu/tp/ Compact Sets with Dense Orbit in 2 X by Paloma Hernández, Jefferson King, and Héctor Méndez Electronically published on March 12, 2012 Topology
More informationMATH 614 Dynamical Systems and Chaos Lecture 7: Symbolic dynamics (continued).
MATH 614 Dynamical Systems and Chaos Lecture 7: Symbolic dynamics (continued). Symbolic dynamics Given a finite set A (an alphabet), we denote by Σ A the set of all infinite words over A, i.e., infinite
More informationSOLUTION TO RUBEL S QUESTION ABOUT DIFFERENTIALLY ALGEBRAIC DEPENDENCE ON INITIAL VALUES GUY KATRIEL PREPRINT NO /4
SOLUTION TO RUBEL S QUESTION ABOUT DIFFERENTIALLY ALGEBRAIC DEPENDENCE ON INITIAL VALUES GUY KATRIEL PREPRINT NO. 2 2003/4 1 SOLUTION TO RUBEL S QUESTION ABOUT DIFFERENTIALLY ALGEBRAIC DEPENDENCE ON INITIAL
More informationSeminar In Topological Dynamics
Bar Ilan University Department of Mathematics Seminar In Topological Dynamics EXAMPLES AND BASIC PROPERTIES Harari Ronen May, 2005 1 2 1. Basic functions 1.1. Examples. To set the stage, we begin with
More informationSmarandachely Precontinuous maps. and Preopen Sets in Topological Vector Spaces
International J.Math. Combin. Vol.2 (2009), 21-26 Smarandachely Precontinuous maps and Preopen Sets in Topological Vector Spaces Sayed Elagan Department of Mathematics and Statistics Faculty of Science,
More informationTopology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.
Topology Proceedings Web: http://topology.auburn.edu/tp/ Mail: Topology Proceedings Department of Mathematics & Statistics Auburn University, Alabama 36849, USA E-mail: topolog@auburn.edu ISSN: 0146-4124
More informationTopological groups with dense compactly generated subgroups
Applied General Topology c Universidad Politécnica de Valencia Volume 3, No. 1, 2002 pp. 85 89 Topological groups with dense compactly generated subgroups Hiroshi Fujita and Dmitri Shakhmatov Abstract.
More informationPOINTWISE PRODUCTS OF UNIFORMLY CONTINUOUS FUNCTIONS
SARAJEVO JOURNAL OF MATHEMATICS Vol.1 (13) (2005), 117 127 POINTWISE PRODUCTS OF UNIFORMLY CONTINUOUS FUNCTIONS SAM B. NADLER, JR. Abstract. The problem of characterizing the metric spaces on which the
More informationA novel approach to Banach contraction principle in extended quasi-metric spaces
Available online at www.tjnsa.com J. Nonlinear Sci. Appl. 9 (2016), 3858 3863 Research Article A novel approach to Banach contraction principle in extended quasi-metric spaces Afrah A. N. Abdou a, Mohammed
More informationA CHARACTERIZATION OF POWER HOMOGENEITY G. J. RIDDERBOS
A CHARACTERIZATION OF POWER HOMOGENEITY G. J. RIDDERBOS Abstract. We prove that every -power homogeneous space is power homogeneous. This answers a question of the author and it provides a characterization
More informationVARIETIES OF ABELIAN TOPOLOGICAL GROUPS AND SCATTERED SPACES
Bull. Austral. Math. Soc. 78 (2008), 487 495 doi:10.1017/s0004972708000877 VARIETIES OF ABELIAN TOPOLOGICAL GROUPS AND SCATTERED SPACES CAROLYN E. MCPHAIL and SIDNEY A. MORRIS (Received 3 March 2008) Abstract
More informationTheoretical Computer Science. Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms
Theoretical Computer Science 428 (2012) 92 97 Contents lists available at SciVerse ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Note Completing a combinatorial
More information