A note on transitive topological Markov chains of given entropy and period
|
|
- Kelley Cox
- 5 years ago
- Views:
Transcription
1 A note on transitive topological Markov chains of given entropy and period Jérôme Buzzi and Sylvie Ruette November, 205 Abstract We show that, for every positive real number h and every positive integer p, there exist oriented graphs G, G (with countably many vertices) that are strongly connected, of period p, of Gurevich entropy h, such that G is positive recurrent (thus the topological Markov chain on G admits a measure of maximal entropy) and G is transient (thus the topological Markov chain on G admits no measure of maximal entropy). We also show that any transitive topological Markov chain with infinite entropy carries uncountably many ergodic, invariant probability measures with infinite entropy. Vere-Jones classification of graphs Definition Let G be an oriented graph and let u, v be two vertices in G. We define the following quantities. p G uv(n) is the number of paths u 0 u u n such that u 0 = u and u n = v; R uv (G) is the radius of convergence of the series p G uv(n)z n. f G uv(n) is the number of paths u 0 u u n such that u 0 = u, u n = v and u i v for all 0 < i < n; L uv (G) is the radius of convergence of the series f G uv(n)z n. Definition 2 Let G be an oriented graph and V its set of vertices. The graph G is strongly connected if for all u, v V, there exists a path from u to v in G. The period of a strongly connected graph G is the greatest common divisor of (p G uu(n)) u V,n 0. The graph G is aperiodic if its period is. Proposition 3 (Vere-Jones [8]) Let G be an oriented graph. R uv (G) does not depend on u and v; it is denoted by R(G). If G is strongly connected, If there is no confusion, R(G) and L uv (G) will be written R and L uv. In [8] Vere-Jones gives a classification of strongly connected graphs as transient, null recurrent or positive recurrent. The definitions are given in Table (lines and 2) as well as properties of the series p G uv(n)z n which give an alternative definition. Proposition 4 (Salama [7]) Let G be a strongly connected oriented graph. If G is transient or null recurrent, then R = L uu for all vertices u. Equivalently, if there exists a vertex u such that R < L uu, then G is positive recurrent.
2 transient null positive recurrent recurrent fuu(n)r G n < n>0 nfuu(n)r G n + + < + n>0 p G uv(n)r n < n 0 lim n + pg uv(n)r n 0 0 λ uv > 0 R = L uu R = L uu R L uu Table : properties of the series associated to a transient, null recurrent or positive recurrent graph G (G is strongly connected); these properties do not depend on the vertices u, v. 2 Topological Markov chains and Gurevich entropy Let G be an oriented graph and V its set of vertices. Then Γ G is the set of two-sided infinite paths in G, that is, Γ G = {(v n ) n Z n Z, v n v n+ in G} V Z. σ is the shift on Γ G. The topological Markov chain on the graph G is the system (Γ G, σ). The set V is endowed with the discrete topology and Γ G is endowed with the induced topology of V Z. The space Γ G is not compact unless G is finite. The topological Markov chain (Γ G, σ) is transitive if and only if the graph G is strongly connected. It is topologically mixing if and only if the graph G is strongly connected and of period. If G is a finite graph, Γ G is compact and the topological entropy h top (Γ G, σ) is well defined (see e.g. [2] for the definition of the topological entropy). If G is a countable graph, the Gurevich entropy [3] of the graph G (or of the topological Markov chain Γ G ) is given by h(g) = sup{h top (Γ H, σ) H G, H finite}. This entropy can also be computed in a combinatorial way, as the exponential growth of the number of paths with fixed endpoints. Proposition 5 (Gurevich [4]) Let G be a strongly connected oriented graph. Then for all vertices u, v h(g) = lim n + n log pg uv(n) = log R(G). Moreover, the variational principle is still valid for topological Markov chains. Theorem 6 (Gurevich [3]) Let G be an oriented graph. Then h(g) = sup{h µ (Γ G ) µ σ-invariant probability measure}. In this variational principle, the supremum is not necessarily reached. The next theorem gives a necessary and sufficient condition for the existence of a measure of maximal entropy (that is, a measure µ such that h(g) = h µ (Γ G )) when the graph is strongly connected. 2
3 Theorem 7 (Gurevich [4]) Let G be a strongly connected oriented graph of finite positive entropy. Then the topological Markov chain on G admits a measure of maximal entropy if and only if the graph G is positive recurrent. Moreover, such a measure is unique if it exists. 3 Construction of graphs of given entropy and given period that are either positive recurrent or transient Lemma 8 Let β (, + ). There exist a sequence of non negative integers (a(n)) and positive constants c, M such that a() =, a(n) β n =, n 2, c β n2 n a(n 2 ) c β n2 n + M, n, 0 a(n) M if n is not a square. These properties imply that the radius of convergence of a(n)zn is L = β na(n)ln < +. Proof. First we look for a constant c > 0 such that We have Thus n 2 and that β + c β n2 n =. () β n2 n 2 β n2 n β n2 = β n = n 2 β(β ). () β + c β(β ) = c = (β )2. Since β >, the constant c is positive. We define the sequence (b(n)) by: Then b() :=, b(n 2 ) := cβ n2 n for all n 2, b(n) := 0 for all n 2 such that n is not a square. b(n) β n β + c β n2 n =. β n2 n 2 We set δ := b(n) β [0, [ and k := β 2 δ. Then k β 2 δ < k + < k + β, which n implies that 0 δ k < β 2 β. We write the β-expansion of δ k (see e.g. [, p 5] for the β 2 definition): there exist integers d(n) {0,..., β } such that δ k = β 2 d(n) β. Moreover, n d() = 0 because δ k < β 2 β. Thus we can write δ = n 2 d (n) β n where d (2) = d(2) + k and d (n) = d(n) for all n 3. We set a() := b() and a(n) := b(n) + d (n) for all n 2. Let M := β + k. We then have: 3
4 a() =, a(n) β n =, n 2, c β n2 n a(n 2 ) c β n2 n + β c β n2 n + M, 0 a(2) β + k = M, n 3, 0 a(n) β M if n is not a square. The radius of convergence L of a(n)zn satisfies log L = lim sup n + Thus L = β. Moreover, log a(n) = n lim n + na(n) β n M n β n + c n 2 β n2 n β n2 n 2 log a(n2 ) = log β because a(n 2 ) cβ n2 n. = M n β n + c n 2 β n < +. Lemma 9 ([5], Lemma 2.4) Let G be a strongly connected oriented graph and u a vertex. i) R < L uu if and only if f G uu(n)l n uu >. ii) If G is recurrent, then R is the unique positive number x such that f G uu(n)x n =. Proof. For (i) and (ii), use Table and the fact that F (x) = f uu(n)x G n is increasing for x [0, + [. Proposition 0 Let β (, + ). There exist aperiodic strongly connected graphs G (β) G(β) such that h(g(β)) = h(g (β)) = log β, G(β) is positive recurrent and G (β) is transient. Remark: Salama proved the part of this proposition concerning positive recurrent graphs in [6, Theorem 3.9]. Proof. This is a variant of the proof of [5, Example 2.9]. Let u be a vertex and let (a(n)) be the sequence given by Lemma 8 for β. The graph G(β) is composed of a(n) loops of length n based at the vertex u for all n (see Figure ). More precisely, define the set of vertices of G(β) as where the vertices v n,i k arrow v n,i k v n,i k+ V = {u} + {v n,i n= k i a(n), k n }, above are distinct. Let v n,i 0 = vn n,i = u for all i a(n). There is an for all 0 k n, i a(n), n 2, there is an arrow u u, and there is no other arrow in G(β). The graph G(β) is strongly connected and f G(β) uu n. By Lemma 8, the sequence (a(n)) is defined such that L = β and (n) = a(n) for all a(n)l n =, (2) 4
5 u Figure : the graphs G(β) and G (β); the bold loop (on the left) is the only arrow that belongs to G(β) and not to G (β), otherwise the two graphs coincide. where L = L uu (G(β)) is the radius of convergence of the series a(n)z n. If G(β) is transient, then R(G(β)) = L uu (G(β)) by Proposition 4, but Equation (2) contradicts the definition of transient (see the first line of Table ). Thus G(β) is recurrent, and R(G(β)) = L by Equation (2) and Lemma 9(ii). Moreover na(n)l n < + by Lemma 8, and thus the graph G(β) is positive recurrent (see Table ). By Proposition 5, h(g(β)) = log R(G(β)) = log β. The graph G (β) is obtained from G(β) by deleting a loop u u of length n 0 for some n 0 2 such that a(n 0 ) (such an integer n 0 exists because L < + ). Obviously one has L uu (G (β)) = L and f G (β) uu (n)l n = L n 0 <. Since R(G (β)) L uu (G (β)), this implies that G (β) is transient. Moreover R(G (β)) = L uu (G (β)) by Proposition 4, so R(G (β)) = R(G(β)), and hence h(g (β)) = h(g(β)) by Proposition 5. Finally, both G(β) and G (β) are of period because of the loop u u. Corollary Let p be a positive integer and h (0, + ). There exist strongly connected graphs G, G of period p such that h(g) = h(g ) = h, G is positive recurrent and G is transient. Proof. For G, we start from the graph G(β) given by Proposition 0 with β = e hp. Let V denote the set of vertices of G(β). The set of vertices of G is V {,..., p}, and the arrows in G are: (v, i) (v, i + ) if v V, i p, (v, p) (w, ) if v, w V and v w is an arrow in G(β). According to the properties of G(β), G is strongly connected, of period p and positive recurrent. Moreover, h(g) = p h(g(β)) = p log β = h. For G, we do the same starting with G (β). According to Theorem 7, the graphs of Corollary satisfy that the topological Markov chain on G admits a measure of maximal entropy the topological Markov chain on G admits no measure of maximal entropy ; both are transitive, of entropy h and carried by a graph of period p. 5
6 4 Topological Markov chains with infinite entropy Proposition 2 Any transitive topological Markov chain with infinite entropy carries uncountably many ergodic, invariant probability measures with infinite entropy. Proof. Let (Γ G, σ) be a topological Markov chain, where G is a strongly connected graph such that h(g) = +. Let v be a vertex of G and choose a sequence (n k ) k such that fvv(n G k ) 2 k2k n k (such a sequence exists because h(g) = + ). Set a k := fvv(n G k ) and define f = k= a kz n k. The loop shift σ f embeds into the topological Markov chain (Γ G, σ). For all k, define q k = (2 k a k n k ) and p 0 = k= q k. Consider σ f as a vertex shift. Let µ be the Markov measure assigning the base vertex v probability p 0, with transition probability q k /p 0 from v to each vertex following v and lying in a first return loop of length n k. Then µ is an ergodic, atomless invariant probability measure of σ f and h µ (σ f ) = +. By use of other subsequences, we easily get uncountably many distinct ergodic measures with infinite entropy. References [] K. Dajani and C. Kraaikamp. Ergodic Theory of Numbers. Number v. 29 in Carus Mathematical Monographs. Mathematical Association of America, [2] M. Denker, C. Grillenberger, and K. Sigmund. Ergodic theory on compact spaces. Lecture Notes in Mathematics, no Springer-Verlag, 976. [3] B. M. Gurevich. Topological entropy of enumerable Markov chains (Russian). Dokl. Akad. Nauk SSSR, 87:75 78, 969. English translation Soviet Math. Dokl, 0(4):9 95, 969. [4] B. M. Gurevich. Shift entropy and Markov measures in the path space of a denumerable graph (Russian). Dokl. Akad. Nauk SSSR, 92: , 970. English translation Soviet Math. Dokl, (3): , 970. [5] S. Ruette. On the Vere-Jones classification and existence of maximal measures for topological Markov chains. Pacific J. Math., 209(2): , [6] I. A. Salama. Topological entropy and recurrence of countable chains. Pacific J. Math., 34(2):325 34, 988. Errata, 40(2):397, 989. [7] I. A. Salama. On the recurrence of countable topological Markov chains. In Symbolic dynamics and its applications (New Haven, CT, 99), Contemp. Math, 35, pages Amer. Math. Soc., Providence, RI, 992. [8] D. Vere-Jones. Geometric ergodicity in denumerable Markov chains. Quart. J. Math. Oxford Ser. (2), 3:7 28,
arxiv: v1 [math.ds] 2 Jan 2019
On the Vere-Jones classification and existence of maximal measures for countable topological Markov chains arxiv:1901.00339v1 [math.ds] 2 Jan 2019 Sylvie Ruette Abstract We consider topological Markov
More informationgives an alternative example of a positive recurrent graph which is not strongly positive recurrent; the number of the first return loops is given by
On the Vere-Jones classification and existence of maximal measures for topological Markov chains Sylvie Ruette Abstract We show that a transient graph can be extended to a recurrent graph of equal entropy
More informationRotation set for maps of degree 1 on sun graphs. Sylvie Ruette. January 6, 2019
Rotation set for maps of degree 1 on sun graphs Sylvie Ruette January 6, 2019 Abstract For a continuous map on a topological graph containing a unique loop S, it is possible to define the degree and, for
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 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 informationSIMILAR MARKOV CHAINS
SIMILAR MARKOV CHAINS by Phil Pollett The University of Queensland MAIN REFERENCES Convergence of Markov transition probabilities and their spectral properties 1. Vere-Jones, D. Geometric ergodicity in
More informationON ENTROPY AND INTRINSIC ERGODICITY OF CODED SUBSHIFTS
ON ENTROPY AND INTRINSIC ERGODICITY OF CODED SUBSHIFTS RONNIE PAVLOV Abstract. Any coded subshift X C defined by a set C of code words contains a subshift, which we call L C, consisting of limits of single
More informationNecessary and sufficient conditions for strong R-positivity
Necessary and sufficient conditions for strong R-positivity Wednesday, November 29th, 2017 The Perron-Frobenius theorem Let A = (A(x, y)) x,y S be a nonnegative matrix indexed by a countable set S. We
More informationTREE-LIKE CONTINUA THAT ADMIT POSITIVE ENTROPY HOMEOMORPHISMS ARE NON-SUSLINEAN
TREE-LIKE CONTINUA THAT ADMIT POSITIVE ENTROPY HOMEOMORPHISMS ARE NON-SUSLINEAN CHRISTOPHER MOURON Abstract. t is shown that if X is a tree-like continuum and h : X X is a homeomorphism such that the topological
More informationMarkov chains. Randomness and Computation. Markov chains. Markov processes
Markov chains Randomness and Computation or, Randomized Algorithms Mary Cryan School of Informatics University of Edinburgh Definition (Definition 7) A discrete-time stochastic process on the state space
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 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 informationLecture 7. µ(x)f(x). When µ is a probability measure, we say µ is a stationary distribution.
Lecture 7 1 Stationary measures of a Markov chain We now study the long time behavior of a Markov Chain: in particular, the existence and uniqueness of stationary measures, and the convergence of the distribution
More informationConstant Slope Maps and the Vere-Jones Classification
entropy Article Constant Slope Maps and the Vere-Jones Classification Jozef Bobok 1 and Henk Bruin 2, * 1 Faculty of Civil Engineering, Czech Technical University in Prague, Thákurova 7, 16629 Praha 6,
More informationInvariant densities for piecewise linear maps
for piecewise linear maps Paweł Góra Concordia University June 2008 Rediscovery Rediscovery, by a different method, of the results of Christoph Kopf (Insbruck) Invariant measures for piecewise linear
More informationPERIODS IMPLYING ALMOST ALL PERIODS FOR TREE MAPS. A. M. Blokh. Department of Mathematics, Wesleyan University Middletown, CT , USA
PERIODS IMPLYING ALMOST ALL PERIODS FOR TREE MAPS A. M. Blokh Department of Mathematics, Wesleyan University Middletown, CT 06459-0128, USA August 1991, revised May 1992 Abstract. Let X be a compact tree,
More informationMarkov Chains and Stochastic Sampling
Part I Markov Chains and Stochastic Sampling 1 Markov Chains and Random Walks on Graphs 1.1 Structure of Finite Markov Chains We shall only consider Markov chains with a finite, but usually very large,
More informationON THE WORK OF SARIG ON COUNTABLE MARKOV CHAINS AND THERMODYNAMIC FORMALISM
ON THE WORK OF SARIG ON COUNTABLE MARKOV CHAINS AND THERMODYNAMIC FORMALISM YAKOV PESIN Abstract. The paper is a non-technical survey and is aimed to illustrate Sarig s profound contributions to statistical
More informationCONSTANT SLOPE MAPS AND THE VERE-JONES CLASSIFICATION.
CONSTANT SLOPE MAPS AND THE VERE-JONES CLASSIFICATION. JOZEF BOBOK AND HENK BRUIN Abstract. We study continuous countably piecewise monotone interval maps, and formulate conditions under which these are
More information2 THE COMPLEXITY OF TORSION-FREENESS On the other hand, the nite presentation of a group G also does not allow us to determine almost any conceivable
THE COMPUTATIONAL COMPLEXITY OF TORSION-FREENESS OF FINITELY PRESENTED GROUPS Steffen Lempp Department of Mathematics University of Wisconsin Madison, WI 53706{1388, USA Abstract. We determine the complexity
More informationPCMI LECTURE NOTES ON PROPERTY (T ), EXPANDER GRAPHS AND APPROXIMATE GROUPS (PRELIMINARY VERSION)
PCMI LECTURE NOTES ON PROPERTY (T ), EXPANDER GRAPHS AND APPROXIMATE GROUPS (PRELIMINARY VERSION) EMMANUEL BREUILLARD 1. Lecture 1, Spectral gaps for infinite groups and non-amenability The final aim of
More informationMEASURE-THEORETIC ENTROPY
MEASURE-THEORETIC ENTROPY Abstract. We introduce measure-theoretic entropy 1. Some motivation for the formula and the logs We want to define a function I : [0, 1] R which measures how suprised we are or
More informationProof: The coding of T (x) is the left shift of the coding of x. φ(t x) n = L if T n+1 (x) L
Lecture 24: Defn: Topological conjugacy: Given Z + d (resp, Zd ), actions T, S a topological conjugacy from T to S is a homeomorphism φ : M N s.t. φ T = S φ i.e., φ T n = S n φ for all n Z + d (resp, Zd
More informationA dyadic endomorphism which is Bernoulli but not standard
A dyadic endomorphism which is Bernoulli but not standard Christopher Hoffman Daniel Rudolph November 4, 2005 Abstract Any measure preserving endomorphism generates both a decreasing sequence of σ-algebras
More informationClassification of Countable State Markov Chains
Classification of Countable State Markov Chains Friday, March 21, 2014 2:01 PM How can we determine whether a communication class in a countable state Markov chain is: transient null recurrent positive
More informationTOPOLOGICAL ENTROPY FOR DIFFERENTIABLE MAPS OF INTERVALS
Chung, Y-.M. Osaka J. Math. 38 (200), 2 TOPOLOGICAL ENTROPY FOR DIFFERENTIABLE MAPS OF INTERVALS YONG MOO CHUNG (Received February 9, 998) Let Á be a compact interval of the real line. For a continuous
More informationKneading Sequences for Unimodal Expanding Maps of the Interval
Acta Mathematica Sinica, New Series 1998, Oct., Vol.14, No.4, pp. 457 462 Kneading Sequences for Unimodal Expanding Maps of the Interval Zeng Fanping (Institute of Mathematics, Guangxi University, Nanning
More informationMarkov Chains CK eqns Classes Hitting times Rec./trans. Strong Markov Stat. distr. Reversibility * Markov Chains
Markov Chains A random process X is a family {X t : t T } of random variables indexed by some set T. When T = {0, 1, 2,... } one speaks about a discrete-time process, for T = R or T = [0, ) one has a continuous-time
More informationEXCLUDING SUBDIVISIONS OF INFINITE CLIQUES. Neil Robertson* Department of Mathematics Ohio State University 231 W. 18th Ave. Columbus, Ohio 43210, USA
EXCLUDING SUBDIVISIONS OF INFINITE CLIQUES Neil Robertson* Department of Mathematics Ohio State University 231 W. 18th Ave. Columbus, Ohio 43210, USA P. D. Seymour Bellcore 445 South St. Morristown, New
More informationMarkov Chains. X(t) is a Markov Process if, for arbitrary times t 1 < t 2 <... < t k < t k+1. If X(t) is discrete-valued. If X(t) is continuous-valued
Markov Chains X(t) is a Markov Process if, for arbitrary times t 1 < t 2
More informationFinitary Permutation Groups
Finitary Permutation Groups Combinatorics Study Group Notes by Chris Pinnock You wonder and you wonder until you wander out into Infinity, where - if it is to be found anywhere - Truth really exists. Marita
More informationPrimitive 2-factorizations of the complete graph
Discrete Mathematics 308 (2008) 175 179 www.elsevier.com/locate/disc Primitive 2-factorizations of the complete graph Giuseppe Mazzuoccolo,1 Dipartimento di Matematica, Università di Modena e Reggio Emilia,
More informationarxiv: v1 [math.nt] 10 Dec 2009
Ford circles, continued fractions, and best approximation of the second kind arxiv:092.997v [math.nt] 0 Dec 2009 Ian Short Centre for Mathematical Sciences Wilberforce Road Cambridge CB3 0WB United Kingdom
More informationVARIETIES WITHOUT EXTRA AUTOMORPHISMS I: CURVES BJORN POONEN
VARIETIES WITHOUT EXTRA AUTOMORPHISMS I: CURVES BJORN POONEN Abstract. For any field k and integer g 3, we exhibit a curve X over k of genus g such that X has no non-trivial automorphisms over k. 1. Statement
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 informationTHE STRUCTURE OF A RING OF FORMAL SERIES AMS Subject Classification : 13J05, 13J10.
THE STRUCTURE OF A RING OF FORMAL SERIES GHIOCEL GROZA 1, AZEEM HAIDER 2 AND S. M. ALI KHAN 3 If K is a field, by means of a sequence S of elements of K is defined a K-algebra K S [[X]] of formal series
More informationInterlude: Practice Final
8 POISSON PROCESS 08 Interlude: Practice Final This practice exam covers the material from the chapters 9 through 8. Give yourself 0 minutes to solve the six problems, which you may assume have equal point
More informationThe 123 Theorem and its extensions
The 123 Theorem and its extensions Noga Alon and Raphael Yuster Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract It is shown
More informationNIL, NILPOTENT AND PI-ALGEBRAS
FUNCTIONAL ANALYSIS AND OPERATOR THEORY BANACH CENTER PUBLICATIONS, VOLUME 30 INSTITUTE OF MATHEMATICS POLISH ACADEMY OF SCIENCES WARSZAWA 1994 NIL, NILPOTENT AND PI-ALGEBRAS VLADIMÍR MÜLLER Institute
More informationAn Introduction to Entropy and Subshifts of. Finite Type
An Introduction to Entropy and Subshifts of Finite Type Abby Pekoske Department of Mathematics Oregon State University pekoskea@math.oregonstate.edu August 4, 2015 Abstract This work gives an overview
More informationOn certain Regular Maps with Automorphism group PSL(2, p) Martin Downs
BULLETIN OF THE GREEK MATHEMATICAL SOCIETY Volume 53, 2007 (59 67) On certain Regular Maps with Automorphism group PSL(2, p) Martin Downs Received 18/04/2007 Accepted 03/10/2007 Abstract Let p be any prime
More informationORBITAL DIGRAPHS OF INFINITE PRIMITIVE PERMUTATION GROUPS
ORBITAL DIGRAPHS OF INFINITE PRIMITIVE PERMUTATION GROUPS SIMON M. SMITH Abstract. If G is a group acting on a set Ω and α, β Ω, the digraph whose vertex set is Ω and whose arc set is the orbit (α, β)
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 informationCOMPLEXITY OF SHORT RECTANGLES AND PERIODICITY
COMPLEXITY OF SHORT RECTANGLES AND PERIODICITY VAN CYR AND BRYNA KRA Abstract. The Morse-Hedlund Theorem states that a bi-infinite sequence η in a finite alphabet is periodic if and only if there exists
More informationMarkov Chains (Part 3)
Markov Chains (Part 3) State Classification Markov Chains - State Classification Accessibility State j is accessible from state i if p ij (n) > for some n>=, meaning that starting at state i, there is
More informationON RIGIDITY OF ALGEBRAIC DYNAMICAL SYSTEMS
ON RIGIDITY OF ALGEBRAIC DYNAMICAL SYSTEMS ALEX CLARK AND ROBBERT FOKKINK Abstract. We study topological rigidity of algebraic dynamical systems. In the first part of this paper we give an algebraic condition
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 informationLecture 4 Lebesgue spaces and inequalities
Lecture 4: Lebesgue spaces and inequalities 1 of 10 Course: Theory of Probability I Term: Fall 2013 Instructor: Gordan Zitkovic Lecture 4 Lebesgue spaces and inequalities Lebesgue spaces We have seen how
More informationMATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals
MATH 02 INTRODUCTION TO MATHEMATICAL ANALYSIS Properties of Real Numbers Some Fundamentals The whole course will be based entirely on the study of sequence of numbers and functions defined on the real
More informationThe tensor algebra of power series spaces
The tensor algebra of power series spaces Dietmar Vogt Abstract The linear isomorphism type of the tensor algebra T (E) of Fréchet spaces and, in particular, of power series spaces is studied. While for
More informationTopological properties of Z p and Q p and Euclidean models
Topological properties of Z p and Q p and Euclidean models Samuel Trautwein, Esther Röder, Giorgio Barozzi November 3, 20 Topology of Q p vs Topology of R Both R and Q p are normed fields and complete
More informationSOME PROPERTIES OF ESSENTIAL SPECTRA OF A POSITIVE OPERATOR
SOME PROPERTIES OF ESSENTIAL SPECTRA OF A POSITIVE OPERATOR E. A. ALEKHNO (Belarus, Minsk) Abstract. Let E be a Banach lattice, T be a bounded operator on E. The Weyl essential spectrum σ ew (T ) of the
More informationKhukhro, E. I. and Shumyatsky, P. MIMS EPrint: Manchester Institute for Mathematical Sciences School of Mathematics
Nonsoluble and non-p-soluble length of finite groups Khukhro, E. I. and Shumyatsky, P. 2013 MIMS EPrint: 2013.79 Manchester Institute for Mathematical Sciences School of Mathematics The University of Manchester
More informationProblem set 1, Real Analysis I, Spring, 2015.
Problem set 1, Real Analysis I, Spring, 015. (1) Let f n : D R be a sequence of functions with domain D R n. Recall that f n f uniformly if and only if for all ɛ > 0, there is an N = N(ɛ) so that if n
More informationERGODIC DYNAMICAL SYSTEMS CONJUGATE TO THEIR COMPOSITION SQUARES. 0. Introduction
Acta Math. Univ. Comenianae Vol. LXXI, 2(2002), pp. 201 210 201 ERGODIC DYNAMICAL SYSTEMS CONJUGATE TO THEIR COMPOSITION SQUARES G. R. GOODSON Abstract. We investigate the question of when an ergodic automorphism
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationSELECTIVELY BALANCING UNIT VECTORS AART BLOKHUIS AND HAO CHEN
SELECTIVELY BALANCING UNIT VECTORS AART BLOKHUIS AND HAO CHEN Abstract. A set U of unit vectors is selectively balancing if one can find two disjoint subsets U + and U, not both empty, such that the Euclidean
More informationEXTENSION OF LYAPUNOV S CONVEXITY THEOREM TO SUBRANGES
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 EXTENSION OF LYAPUNOV S CONVEXITY THEOREM TO SUBRANGES PENG DAI AND EUGENE A. FEINBERG (Communicated
More informationARITHMETIC CODING AND ENTROPY FOR THE POSITIVE GEODESIC FLOW ON THE MODULAR SURFACE
MOSCOW MATHEMATICAL JOURNAL Volume, Number 4, October December 200, Pages 569 582 ARITHMETIC CODING AND ENTROPY FOR THE POSITIVE GEODESIC FLOW ON THE MODULAR SURFACE BORIS GUREVICH AND SVETLANA KATOK This
More informationMAPPING CHAINABLE CONTINUA ONTO DENDROIDS
MAPPING CHAINABLE CONTINUA ONTO DENDROIDS PIOTR MINC Abstract. We prove that every chainable continuum can be mapped into a dendroid such that all point-inverses consist of at most three points. In particular,
More informationTOPOLOGIES ON SPACES OF VALUATIONS: A CLOSENESS CRITERION. 1. Introduction
TOPOLOGIES ON SPACES OF VALUATIONS: A CLOSENESS CRITERION JOSNEI NOVACOSKI Abstract. This paper is part of a program to understand topologies on spaces of valuations. We fix an ordered abelian group Γ
More informationCovering an ellipsoid with equal balls
Journal of Combinatorial Theory, Series A 113 (2006) 1667 1676 www.elsevier.com/locate/jcta Covering an ellipsoid with equal balls Ilya Dumer College of Engineering, University of California, Riverside,
More informationFOR PISOT NUMBERS β. 1. Introduction This paper concerns the set(s) Λ = Λ(β,D) of real numbers with representations x = dim H (Λ) =,
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 349, Number 11, November 1997, Pages 4355 4365 S 0002-9947(97)02069-2 β-expansions WITH DELETED DIGITS FOR PISOT NUMBERS β STEVEN P. LALLEY Abstract.
More informationCHORD THEOREMS ON GRAPHS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 137, Number 2, February 29, Pages 553 562 S 2-9939(8)9627-5 Article electronically published on August 19, 28 CHORD THEOREMS ON GRAPHS MOHAMMAD JAVAHERI
More informationSOLVABILITY OF MULTIPOINT DIFFERENTIAL OPERATORS OF FIRST ORDER
Electronic Journal of Differential Equations, Vol. 2015 2015, No. 36, pp. 1 10. ISSN: 1072-6691. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu SOLVABILITY OF MULTIPOINT
More informationON GROUP-THEORETIC MODELS OF RANDOMNESS AND GENERICITY
ON GROUP-THEORETIC MODELS OF RANDOMNESS AND GENERICITY ILYA KAPOVICH AND PAUL SCHUPP Abstract. We compare the random group model of Gromov and the model of generic groups of Arzhantseva and Ol shanskii.
More informationLecture 11: Introduction to Markov Chains. Copyright G. Caire (Sample Lectures) 321
Lecture 11: Introduction to Markov Chains Copyright G. Caire (Sample Lectures) 321 Discrete-time random processes A sequence of RVs indexed by a variable n 2 {0, 1, 2,...} forms a discretetime random process
More informationMarkov Chains, Random Walks on Graphs, and the Laplacian
Markov Chains, Random Walks on Graphs, and the Laplacian CMPSCI 791BB: Advanced ML Sridhar Mahadevan Random Walks! There is significant interest in the problem of random walks! Markov chain analysis! Computer
More informationA SHORT PROOF OF THE CONNES-FELDMAN-WEISS THEOREM
A SHORT PROOF OF THE CONNES-FELDMAN-WEISS THEOREM ANDREW MARKS Abstract. In this note, we give a short proof of the theorem due to Connes, Feldman, and Weiss that a countable orel equivalence relation
More informationIsomorphism for transitive groupoid C -algebras
Isomorphism for transitive groupoid C -algebras Mădălina Buneci University Constantin Brâncuşi of Târgu Jiu Abstract We shall prove that the C -algebra of the locally compact second countable transitive
More informationA CRITERION FOR THE EXISTENCE OF TRANSVERSALS OF SET SYSTEMS
A CRITERION FOR THE EXISTENCE OF TRANSVERSALS OF SET SYSTEMS JERZY WOJCIECHOWSKI Abstract. Nash-Williams [6] formulated a condition that is necessary and sufficient for a countable family A = (A i ) i
More informationLecture 10. Theorem 1.1 [Ergodicity and extremality] A probability measure µ on (Ω, F) is ergodic for T if and only if it is an extremal point in M.
Lecture 10 1 Ergodic decomposition of invariant measures Let T : (Ω, F) (Ω, F) be measurable, and let M denote the space of T -invariant probability measures on (Ω, F). Then M is a convex set, although
More informationSMSTC (2007/08) Probability.
SMSTC (27/8) Probability www.smstc.ac.uk Contents 12 Markov chains in continuous time 12 1 12.1 Markov property and the Kolmogorov equations.................... 12 2 12.1.1 Finite state space.................................
More informationNonamenable Products are not Treeable
Version of 30 July 1999 Nonamenable Products are not Treeable by Robin Pemantle and Yuval Peres Abstract. Let X and Y be infinite graphs, such that the automorphism group of X is nonamenable, and the automorphism
More informationProblem Set 2: Solutions Math 201A: Fall 2016
Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that
More informationMAIN ARTICLES. In present paper we consider the Neumann problem for the operator equation
Volume 14, 2010 1 MAIN ARTICLES THE NEUMANN PROBLEM FOR A DEGENERATE DIFFERENTIAL OPERATOR EQUATION Liparit Tepoyan Yerevan State University, Faculty of mathematics and mechanics Abstract. We consider
More informationON A UNIQUENESS PROPERTY OF SECOND CONVOLUTIONS
ON A UNIQUENESS PROPERTY OF SECOND CONVOLUTIONS N. BLANK; University of Stavanger. 1. Introduction and Main Result Let M denote the space of all finite nontrivial complex Borel measures on the real line
More informationarxiv:math/ v1 [math.fa] 26 Oct 1993
arxiv:math/9310218v1 [math.fa] 26 Oct 1993 STRUCTURE OF TOTAL SUBSPACES OF DUAL BANACH SPACES M.I.Ostrovskii I. Let X be a Banach space, X its dual. The unit ball and the unit sphere of X are denoted by
More informationTo appear in Monatsh. Math. WHEN IS THE UNION OF TWO UNIT INTERVALS A SELF-SIMILAR SET SATISFYING THE OPEN SET CONDITION? 1.
To appear in Monatsh. Math. WHEN IS THE UNION OF TWO UNIT INTERVALS A SELF-SIMILAR SET SATISFYING THE OPEN SET CONDITION? DE-JUN FENG, SU HUA, AND YUAN JI Abstract. Let U λ be the union of two unit intervals
More informationJournal of Combinatorics and Number Theory 1(2009), no. 1, ON SUMS OF PRIMES AND TRIANGULAR NUMBERS. Zhi-Wei Sun
Journal of Combinatorics and Number Theory 1(009), no. 1, 65 76. ON SUMS OF PRIMES AND TRIANGULAR NUMBERS Zhi-Wei Sun Department of Mathematics, Nanjing University Nanjing 10093, People s Republic of China
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 informationFixed points of isometries on weakly compact convex sets
J. Math. Anal. Appl. 282 (2003) 1 7 www.elsevier.com/locate/jmaa Fixed points of isometries on weakly compact convex sets Teck-Cheong Lim, a Pei-Kee Lin, b C. Petalas, c and T. Vidalis c, a Department
More informationKrieger s finite generator theorem for ergodic actions of countable groups
Krieger s finite generator theorem for ergodic actions of countable groups Brandon Seward University of Michigan UNT RTG Conference Logic, Dynamics, and Their Interactions II June 6, 2014 Brandon Seward
More informationOn metric characterizations of some classes of Banach spaces
On metric characterizations of some classes of Banach spaces Mikhail I. Ostrovskii January 12, 2011 Abstract. The first part of the paper is devoted to metric characterizations of Banach spaces with no
More informationFactorization of integer-valued polynomials with square-free denominator
accepted by Comm. Algebra (2013) Factorization of integer-valued polynomials with square-free denominator Giulio Peruginelli September 9, 2013 Dedicated to Marco Fontana on the occasion of his 65th birthday
More informationON LIPSCHITZ-LORENTZ SPACES AND THEIR ZYGMUND CLASSES
Hacettepe Journal of Mathematics and Statistics Volume 39(2) (2010), 159 169 ON LIPSCHITZ-LORENTZ SPACES AND THEIR ZYGMUND CLASSES İlker Eryılmaz and Cenap Duyar Received 24:10 :2008 : Accepted 04 :01
More informationUNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION CORE COURSE. B.Sc. MATHEMATICS V SEMESTER. (2011 Admission onwards) BASIC MATHEMATICAL ANALYSIS
UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION CORE COURSE B.Sc. MATHEMATICS V SEMESTER (2011 Admission onwards) BASIC MATHEMATICAL ANALYSIS QUESTION BANK 1. Find the number of elements in the power
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 informationWeek 2: Sequences and Series
QF0: Quantitative Finance August 29, 207 Week 2: Sequences and Series Facilitator: Christopher Ting AY 207/208 Mathematicians have tried in vain to this day to discover some order in the sequence of prime
More informationLIMITING PROBABILITY TRANSITION MATRIX OF A CONDENSED FIBONACCI TREE
International Journal of Applied Mathematics Volume 31 No. 18, 41-49 ISSN: 1311-178 (printed version); ISSN: 1314-86 (on-line version) doi: http://dx.doi.org/1.173/ijam.v31i.6 LIMITING PROBABILITY TRANSITION
More informationTWO KINDS OF CHAOS AND RELATIONS BETWEEN THEM. 1. Introduction
Acta Math. Univ. Comenianae Vol. LXXII, 1(2003), pp. 119 127 119 TWO KINDS OF CHAOS AND RELATIONS BETWEEN THEM M. LAMPART Abstract. In this paper we consider relations between chaos in the sense of Li
More informationINDEPENDENCE, RELATIVE RANDOMNESS, AND PA DEGREES
INDEPENDENCE, RELATIVE RANDOMNESS, AND PA DEGREES ADAM R. DAY AND JAN REIMANN Abstract. We study pairs of reals that are mutually Martin-Löf random with respect to a common, not necessarily computable
More informationClosed Locally Path-Connected Subspaces of Finite-Dimensional Groups Are Locally Compact
Volume 36, 2010 Pages 399 405 http://topology.auburn.edu/tp/ Closed Locally Path-Connected Subspaces of Finite-Dimensional Groups Are Locally Compact by Taras Banakh and Lyubomyr Zdomskyy Electronically
More informationTOPOLOGICAL ENTROPY AND TOPOLOGICAL STRUCTURES OF CONTINUA
TOPOLOGICAL ENTROPY AND TOPOLOGICAL STRUCTURES OF CONTINUA HISAO KATO, INSTITUTE OF MATHEMATICS, UNIVERSITY OF TSUKUBA 1. Introduction During the last thirty years or so, many interesting connections between
More information2 Discrete-Time Markov Chains
2 Discrete-Time Markov Chains Angela Peace Biomathematics II MATH 5355 Spring 2017 Lecture notes follow: Allen, Linda JS. An introduction to stochastic processes with applications to biology. CRC Press,
More informationResearch Statement. MUHAMMAD INAM 1 of 5
MUHAMMAD INAM 1 of 5 Research Statement Preliminaries My primary research interests are in geometric inverse semigroup theory and its connections with other fields of mathematics. A semigroup M is called
More informationGraphs and C -algebras
35 Graphs and C -algebras Aidan Sims Abstract We outline Adam Sørensen s recent characterisation of stable isomorphism of simple unital graph C -algebras in terms of moves on graphs. Along the way we touch
More informationThermodynamics for discontinuous maps and potentials
Thermodynamics for discontinuous maps and potentials Vaughn Climenhaga University of Houston July 11, 2013 Plan of talk Dynamical system { X a complete separable metric space f : X X a measurable map Potential
More informationDEGREE SEQUENCES OF INFINITE GRAPHS
DEGREE SEQUENCES OF INFINITE GRAPHS ANDREAS BLASS AND FRANK HARARY ABSTRACT The degree sequences of finite graphs, finite connected graphs, finite trees and finite forests have all been characterized.
More informationSTRICTLY ERGODIC PATTERNS AND ENTROPY FOR INTERVAL MAPS
Acta Math. Univ. Comenianae Vol. LXXII, (2003), pp. 8 STRICTLY ERGODIC PATTERNS AND ENTROPY FOR INTERVAL MAPS J. BOBOK Abstract. Let M be the set of all pairs (T,g) such that T R is compact, g : T T is
More information