Lectures on Quasi-Isometric Rigidity
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Metric Geometry in a Tame Setting
University of California Los Angeles Metric Geometry in a Tame Setting A dissertation submitted in partial satisfaction of the requirements for the degree Doctor of Philosophy in Mathematics by Erik Walsberg 2015 c Copyright by Erik Walsberg 2015 Abstract of the Dissertation Metric Geometry in a Tame Setting by Erik Walsberg Doctor of Philosophy in Mathematics University of California, Los Angeles, 2015 Professor Matthias J. Aschenbrenner, Chair We prove basic results about the topology and metric geometry of metric spaces which are definable in o-minimal expansions of ordered fields. ii The dissertation of Erik Walsberg is approved. Yiannis N. Moschovakis Chandrashekhar Khare David Kaplan Matthias J. Aschenbrenner, Committee Chair University of California, Los Angeles 2015 iii To Sam. iv Table of Contents 1 Introduction :::::::::::::::::::::::::::::::::::::: 1 2 Conventions :::::::::::::::::::::::::::::::::::::: 5 3 Metric Geometry ::::::::::::::::::::::::::::::::::: 7 3.1 Metric Spaces . 7 3.2 Maps Between Metric Spaces . 8 3.3 Covers and Packing Inequalities . 9 3.3.1 The 5r-covering Lemma . 9 3.3.2 Doubling Metrics . 10 3.4 Hausdorff Measures and Dimension . 11 3.4.1 Hausdorff Measures . 11 3.4.2 Hausdorff Dimension . 13 3.5 Topological Dimension . 15 3.6 Left-Invariant Metrics on Groups . 15 3.7 Reductions, Ultralimits and Limits of Metric Spaces . 16 3.7.1 Reductions of Λ-valued Metric Spaces . 16 3.7.2 Ultralimits . 17 3.7.3 GH-Convergence and GH-Ultralimits . 18 3.7.4 Asymptotic Cones . 19 3.7.5 Tangent Cones . 22 3.7.6 Conical Metric Spaces . 22 3.8 Normed Spaces . 23 4 T-Convexity :::::::::::::::::::::::::::::::::::::: 24 4.1 T-convex Structures . -
Compression of Vertex Transitive Graphs
Compression of Vertex Transitive Graphs Bruce Litow, ¤ Narsingh Deo, y and Aurel Cami y Abstract We consider the lossless compression of vertex transitive graphs. An undirected graph G = (V; E) is called vertex transitive if for every pair of vertices x; y 2 V , there is an automorphism σ of G, such that σ(x) = y. A result due to Sabidussi, guarantees that for every vertex transitive graph G there exists a graph mG (m is a positive integer) which is a Cayley graph. We propose as the compressed form of G a ¯nite presentation (X; R) , where (X; R) presents the group ¡ corresponding to such a Cayley graph mG. On a conjecture, we demonstrate that for a large subfamily of vertex transitive graphs, the original graph G can be completely reconstructed from its compressed representation. 1 Introduction The complex networks that describe systems in nature and society are typ- ically very large, often with hundreds of thousands of vertices. Examples of such networks include the World Wide Web, the Internet, semantic net- works, social networks, energy transportation networks, the global economy etc., (see e.g., [16]). Given a graph that represents such a large network, an important problem is its lossless compression, i.e., obtaining a smaller size representation of the graph, such that the original graph can be fully restored from its compressed form. We note that, in general, graphs are incompressible, i.e., the vast majority of graphs with n vertices require (n2) bits in any representation. This can be seen by a simple counting argument. There are 2n¢(n¡1)=2 labelled, undirected graphs, and at least 2n¢(n¡1)=2=n! unlabelled, undirected graphs. -
Pretty Theorems on Vertex Transitive Graphs
Pretty Theorems on Vertex Transitive Graphs Growth For a graph G a vertex x and a nonnegative integer n we let B(x; n) denote the ball of radius n around x (i.e. the set u V (G): dist(u; v) n . If G is a vertex transitive graph then f 2 ≤ g B(x; n) = B(y; n) for any two vertices x; y and we denote this number by f(n). j j j j Example: If G = Cayley(Z2; (0; 1); ( 1; 0) ) then f(n) = (n + 1)2 + n2. f ± ± g 0 f(3) = B(0, 3) = (1 + 3 + 5 + 7) + (5 + 3 + 1) = 42 + 32 | | Our first result shows a property of the function f which is a relative of log concavity. Theorem 1 (Gromov) If G is vertex transitive then f(n)f(5n) f(4n)2 ≤ Proof: Choose a maximal set Y of vertices in B(u; 3n) which are pairwise distance 2n + 1 ≥ and set y = Y . The balls of radius n around these points are disjoint and are contained in j j B(u; 4n) which gives us yf(n) f(4n). On the other hand, the balls of radius 2n around ≤ the points in Y cover B(u; 3n), so the balls of radius 4n around these points cover B(u; 5n), giving us yf(4n) f(5n). Combining our two inequalities yields the desired bound. ≥ Isoperimetric Properties Here is a classical problem: Given a small loop of string in the plane, arrange it to maximize the enclosed area. -
Algebraic Graph Theory: Automorphism Groups and Cayley Graphs
Algebraic Graph Theory: Automorphism Groups and Cayley graphs Glenna Toomey April 2014 1 Introduction An algebraic approach to graph theory can be useful in numerous ways. There is a relatively natural intersection between the fields of algebra and graph theory, specifically between group theory and graphs. Perhaps the most natural connection between group theory and graph theory lies in finding the automorphism group of a given graph. However, by studying the opposite connection, that is, finding a graph of a given group, we can define an extremely important family of vertex-transitive graphs. This paper explores the structure of these graphs and the ways in which we can use groups to explore their properties. 2 Algebraic Graph Theory: The Basics First, let us determine some terminology and examine a few basic elements of graphs. A graph, Γ, is simply a nonempty set of vertices, which we will denote V (Γ), and a set of edges, E(Γ), which consists of two-element subsets of V (Γ). If fu; vg 2 E(Γ), then we say that u and v are adjacent vertices. It is often helpful to view these graphs pictorially, letting the vertices in V (Γ) be nodes and the edges in E(Γ) be lines connecting these nodes. A digraph, D is a nonempty set of vertices, V (D) together with a set of ordered pairs, E(D) of distinct elements from V (D). Thus, given two vertices, u, v, in a digraph, u may be adjacent to v, but v is not necessarily adjacent to u. This relation is represented by arcs instead of basic edges. -
Conformally Homogeneous Surfaces
e Bull. London Math. Soc. 43 (2011) 57–62 C 2010 London Mathematical Society doi:10.1112/blms/bdq074 Exotic quasi-conformally homogeneous surfaces Petra Bonfert-Taylor, Richard D. Canary, Juan Souto and Edward C. Taylor Abstract We construct uniformly quasi-conformally homogeneous Riemann surfaces that are not quasi- conformal deformations of regular covers of closed orbifolds. 1. Introduction Recall that a hyperbolic manifold M is K- quasi-conformally homogeneous if for all x, y ∈ M, there is a K-quasi-conformal map f : M → M with f(x)=y. It is said to be uniformly quasi- conformally homogeneous if it is K-quasi-conformally homogeneous for some K. We consider only complete and oriented hyperbolic manifolds. In dimensions 3 and above, every uniformly quasi-conformally homogeneous hyperbolic manifold is isometric to the regular cover of a closed hyperbolic orbifold (see [1]). The situation is more complicated in dimension 2. It remains true that any hyperbolic surface that is a regular cover of a closed hyperbolic orbifold is uniformly quasi-conformally homogeneous. If S is a non-compact regular cover of a closed hyperbolic 2-orbifold, then any quasi-conformal deformation of S remains uniformly quasi-conformally homogeneous. However, typically a quasi-conformal deformation of S is not itself a regular cover of a closed hyperbolic 2-orbifold (see [1, Lemma 5.1].) It is thus natural to ask if every uniformly quasi-conformally homogeneous hyperbolic surface is a quasi-conformal deformation of a regular cover of a closed hyperbolic orbifold. The goal of this note is to answer this question in the negative. -
Nonpositive Curvature and the Ptolemy Inequality
Zurich Open Repository and Archive University of Zurich Main Library Strickhofstrasse 39 CH-8057 Zurich www.zora.uzh.ch Year: 2007 Nonpositive curvature and the Ptolemy inequality Foertsch, T ; Lytchak, A ; Schroeder, Viktor Abstract: We provide examples of nonlocally, compact, geodesic Ptolemy metric spaces which are not uniquely geodesic. On the other hand, we show that locally, compact, geodesic Ptolemy metric spaces are uniquely geodesic. Moreover, we prove that a metric space is CAT(0) if and only if it is Busemann convex and Ptolemy. DOI: https://doi.org/10.1093/imrn/rnm100 Posted at the Zurich Open Repository and Archive, University of Zurich ZORA URL: https://doi.org/10.5167/uzh-21536 Journal Article Published Version Originally published at: Foertsch, T; Lytchak, A; Schroeder, Viktor (2007). Nonpositive curvature and the Ptolemy inequality. International Mathematics Research Notices, 2007(rnm100):online. DOI: https://doi.org/10.1093/imrn/rnm100 Foertsch, T., A. Lytchak, and V. Schroeder. (2007) “Nonpositive Curvature and the Ptolemy Inequality,” International Mathematics Research Notices, Vol. 2007, Article ID rnm100, 15 pages. doi:10.1093/imrn/rnm100 Nonpositive Curvature and the Ptolemy Inequality Thomas Foertsch1, Alexander Lytchak1, Viktor Schroeder2 1Universitat¨ Bonn, Mathematisches Institut, Beringstr. 1, 53115 Bonn, Germany, and 2Universitat¨ Zurich¨ , Institut fur¨ Mathematik, Winterthurerstr. 190, 8057 Zurich¨ , Switzerland Correspondence to be sent to: Thomas Foertsch, Universitat¨ Bonn, Mathematisches Institut, Beringstr. 1, 53115 Bonn, Germany. e-mail: [email protected] We provide examples of nonlocally, compact, geodesic Ptolemy metric spaces which are not uniquely geodesic. On the other hand, we show that locally, compact, geodesic Ptolemy metric spaces are uniquely geodesic. -
On Cayley Graphs of Algebraic Structures
On Cayley graphs of algebraic structures Didier Caucal1 1 CNRS, LIGM, University Paris-East, France [email protected] Abstract We present simple graph-theoretic characterizations of Cayley graphs for left-cancellative monoids, groups, left-quasigroups and quasigroups. We show that these characterizations are effective for the end-regular graphs of finite degree. 1 Introduction To describe the structure of a group, Cayley introduced in 1878 [7] the concept of graph for any group (G, ·) according to any generating subset S. This is simply the set of labeled s oriented edges g −→ g·s for every g of G and s of S. Such a graph, called Cayley graph, is directed and labeled in S (or an encoding of S by symbols called letters or colors). The study of groups by their Cayley graphs is a main topic of algebraic graph theory [3, 8, 2]. A characterization of unlabeled and undirected Cayley graphs was given by Sabidussi in 1958 [15] : an unlabeled and undirected graph is a Cayley graph if and only if we can find a group with a free and transitive action on the graph. However, this algebraic characterization is not well suited for deciding whether a possibly infinite graph is a Cayley graph. It is pertinent to look for characterizations by graph-theoretic conditions. This approach was clearly stated by Hamkins in 2010: Which graphs are Cayley graphs? [10]. In this paper, we present simple graph-theoretic characterizations of Cayley graphs for firstly left-cancellative and cancellative monoids, and then for groups. These characterizations are then extended to any subset S of left-cancellative magmas, left-quasigroups, quasigroups, and groups. -
Groups Acting on Cat(0) Cube Complexes with Uniform Exponential Growth
GROUPS ACTING ON CAT(0) CUBE COMPLEXES WITH UNIFORM EXPONENTIAL GROWTH RADHIKA GUPTA, KASIA JANKIEWICZ, AND THOMAS NG Abstract. We study uniform exponential growth of groups acting on CAT(0) cube complexes. We show that groups acting without global fixed points on CAT(0) square complexes either have uniform exponential growth or stabilize a Euclidean subcomplex. This generalizes the work of Kar and Sageev considers free actions. Our result lets us show uniform exponential growth for certain groups that act improperly on CAT(0) square complexes, namely, finitely generated subgroups of the Higman group and triangle-free Artin groups. We also obtain that non-virtually abelian groups acting freely on CAT(0) cube complexes of any dimension with isolated flats that admit a geometric group action have uniform exponential growth. 1. Introduction In this article, we continue the inquiry to determine which groups that act on CAT(0) cube complexes have uniform exponential growth. Let G be a group with finite generating set S and corresponding Cayley graph Cay(G; S) equipped with the word metric. Let B(n; S) be the ball of radius n in Cay(G; S). The exponential growth rate of G with respect to S is defined as w(G; S) := lim jB(n; S)j1=n: n!1 The exponential growth rate of G is defined as w(G) := inf fw(G; S) j S finite generating setg : We say a group G has exponential growth if w(G; S) > 1 for some (hence every) finite generating set S. A group G is said to have uniform exponential growth if w(G) > 1. -
Arxiv:0803.2592V3 [Math.GR] 29 Jan 2010 F)I N Nyi Vr Isometric Every If Only and If (FH) Taeyfrpoigsao’ Eutadterm
FIXED POINT PROPERTIES IN THE SPACE OF MARKED GROUPS YVES STALDER Abstract. We explain, following Gromov, how to produce uniform isometric actions of groups starting from isometric actions without fixed point, using common ultralimits techniques. This gives in particular a simple proof of a result by Shalom: Kazhdan’s property (T) defines an open subset in the space of marked finitely generated groups. 1. Introduction In this expository note, we are interested in groups whose actions on some particular kind of spaces always have (global) fixed points. Definition 1.1. Let G be a (discrete) group. We say that G has: – Serre’s Property (FH), if any isometric G-action on an affine Hilbert space has a fixed point [HV89, Chap 4]; – Serre’s Property (FA), if any G-action on a simplicial tree (by automorphisms and without inversion) has a fixed point [Ser77, Chap I.6]; – Property (FRA), if if any isometric G-action on a complete R-tree has a fixed point [HV89, Chap 6.b]. These definitions extend to topological groups: one has then to require the actions to be continuous. Such properties give information about the structure of the group G. Serre proved that a countable group has Property (FA) if and only if (i) it is finitely generated, (ii) it has no infinite cyclic quotient, and (iii) it is not an amalgam [Ser77, Thm I.15]. Among locally compact, second countable groups, Guichardet and Delorme proved that Property (FH) is equivalent to Kazhdan’s Property (T) [Gui77, Del77]. Kazhdan groups are known to be compactly generated and to have a compact abelianization; see e.g. -
Abstract Commensurability and Quasi-Isometry Classification of Hyperbolic Surface Group Amalgams
ABSTRACT COMMENSURABILITY AND QUASI-ISOMETRY CLASSIFICATION OF HYPERBOLIC SURFACE GROUP AMALGAMS EMILY STARK Abstract. Let XS denote the class of spaces homeomorphic to two closed orientable surfaces of genus greater than one identified to each other along an essential simple closed curve in each surface. Let CS denote the set of fundamental groups of spaces in XS . In this paper, we characterize the abstract commensurability classes within CS in terms of the ratio of the Euler characteristic of the surfaces identified and the topological type of the curves identified. We prove that all groups in CS are quasi-isometric by exhibiting a bilipschitz map between the universal covers of two spaces in XS . In particular, we prove that the universal covers of any two such spaces may be realized as isomorphic cell complexes with finitely many isometry types of hyperbolic polygons as cells. We analyze the abstract commensurability classes within CS : we characterize which classes contain a maximal element within CS ; we prove each abstract commensurability class contains a right-angled Coxeter group; and, we construct a common CAT(0) cubical model geometry for each abstract commensurability class. 1. Introduction Finitely generated infinite groups carry both an algebraic and a geometric structure, and to study such groups, one may study both algebraic and geometric classifications. Abstract commensurability defines an algebraic equivalence relation on the class of groups, where two groups are said to be abstractly commensurable if they contain isomorphic subgroups of finite-index. Finitely generated groups may also be viewed as geometric objects, since a finitely generated group has a natural word metric which is well-defined up to quasi-isometric equivalence. -
Lectures on Quasi-Isometric Rigidity Michael Kapovich 1 Lectures on Quasi-Isometric Rigidity 3 Introduction: What Is Geometric Group Theory? 3 Lecture 1
Contents Lectures on quasi-isometric rigidity Michael Kapovich 1 Lectures on quasi-isometric rigidity 3 Introduction: What is Geometric Group Theory? 3 Lecture 1. Groups and Spaces 5 1. Cayley graphs and other metric spaces 5 2. Quasi-isometries 6 3. Virtual isomorphisms and QI rigidity problem 9 4. Examples and non-examples of QI rigidity 10 Lecture 2. Ultralimits and Morse Lemma 13 1. Ultralimits of sequences in topological spaces. 13 2. Ultralimits of sequences of metric spaces 14 3. Ultralimits and CAT(0) metric spaces 14 4. Asymptotic Cones 15 5. Quasi-isometries and asymptotic cones 15 6. Morse Lemma 16 Lecture 3. Boundary extension and quasi-conformal maps 19 1. Boundary extension of QI maps of hyperbolic spaces 19 2. Quasi-actions 20 3. Conical limit points of quasi-actions 21 4. Quasiconformality of the boundary extension 21 Lecture 4. Quasiconformal groups and Tukia's rigidity theorem 27 1. Quasiconformal groups 27 2. Invariant measurable conformal structure for qc groups 28 3. Proof of Tukia's theorem 29 4. QI rigidity for surface groups 31 Lecture 5. Appendix 33 1. Appendix 1: Hyperbolic space 33 2. Appendix 2: Least volume ellipsoids 35 3. Appendix 3: Different measures of quasiconformality 35 Bibliography 37 i Lectures on quasi-isometric rigidity Michael Kapovich IAS/Park City Mathematics Series Volume XX, XXXX Lectures on quasi-isometric rigidity Michael Kapovich Introduction: What is Geometric Group Theory? Historically (in the 19th century), groups appeared as automorphism groups of some structures: • Polynomials (field extensions) | Galois groups. • Vector spaces, possibly equipped with a bilinear form| Matrix groups. -
Local Connectivity of Right-Angled Coxeter Group Boundaries
LOCAL CONNECTIVITY OF RIGHT-ANGLED COXETER GROUP BOUNDARIES MICHAEL MIHALIK, KIM RUANE, AND STEVE TSCHANTZ Abstract. We provide conditions on the defining graph of a right- angled Coxeter group presentation that guarantees the boundary of any CAT (0) space on which the group acts geometrically will be locally connected. 0. Introduction This is an edited version of the published version of our paper. The changes are minor, but clean up the paper quite a bit: the proof of lemma 5.8 is reworded and a figure is added showing where (in the published version) some undefined vertices of the Cayley graph are locate, the proof of theorem 3.2 is simplified by using lemma 4.2 (allowing us to eliminate four lemmas that appeared near the end of section 1). In [BM],the authors ask whether all one-ended word hyperbolic groups have locally connected boundary. In that paper, they relate the existence of global cut points in the boundary to local connectivity of the boundary. In [Bo], Bowditch gives a correspondence between local cut points in the bound- ary and splittings of the group over one-ended subgroups. In [S], Swarup uses the work of Bowditch and others to prove that the boundary of such a group cannot contain a global cut point, thus proving these boundaries are locally connected. The situation is quite different in the setting of CAT (0) groups. If G is a one-ended group acting geometrically on a CAT (0) space X, then @X can indeed be non-locally connected. For example, consider the group G = F2 × Z where F2 denotes the non-abelian free group of rank 2, acting on X = T ×R where T is the tree of valence 4 (or the Cayley graph of F2 with the standard generating set).