A combinatorial approach to coarse geometry

被引:8
|
作者
Cencelj, M. [2 ]
Dydak, J. [1 ]
Vavpetic, A. [3 ]
Virk, Z. [1 ]
机构
[1] Univ Tennessee, Knoxville, TN 37996 USA
[2] Univ Ljubljana, IMFM, SI-1111 Ljubljana, Slovenia
[3] Univ Ljubljana, Fak Matemat Fiziko, SI-1111 Ljubljana, Slovenia
关键词
Asymptotic dimension; Coarse geometry; Simplicial trees; ASYMPTOTIC DIMENSION; CONJECTURE; SPACES;
D O I
10.1016/j.topol.2011.10.012
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Using ideas from shape theory we embed the coarse category of metric spaces into the category of direct sequences of simplicial complexes with bonding maps being simplicial. Two direct sequences of simplicial complexes are equivalent if one of them can be transformed to the other by contiguous factorizations of bonding maps and by taking infinite subsequences. This embedding can be realized by either Rips complexes or analogs of Roe's anti-Cech approximations of spaces. In this model coarse n-connectedness of K = (K-1 -> K-2 -> ... ) means that for each k there is m > k such that the bonding map from K-k to K-m induces trivial homomorphisms of all homotopy groups up to and including n. The asymptotic dimension being at most n means that for each k there is m > k such that the bonding map from K-k to K-m factors (up to contiguity) through an n-dimensional complex. Property A of G. Yu is equivalent to the condition that for each k and for each epsilon > 0 there is m > k such that the bonding map from vertical bar K-k vertical bar to vertical bar K-m vertical bar has a contiguous approximation g:vertical bar K-k vertical bar -> vertical bar K-m vertical bar which sends simplices of vertical bar K-k vertical bar to sets of diameter at most epsilon. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:646 / 658
页数:13
相关论文
共 50 条
  • [1] A combinatorial approach to discrete geometry
    Bombelli, L.
    Lorente, Miguel
    [J]. CENTURY OF RELATIVITY PHYSICS, 2006, 841 : 497 - +
  • [2] Combinatorial optimization approach to coarse control quantization
    Salapaka, Srinivasa
    [J]. PROCEEDINGS OF THE 45TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-14, 2006, : 5234 - 5239
  • [3] A COMBINATORIAL APPROACH TO P-ADIC GEOMETRY
    DRESS, AWM
    TERHALLE, W
    [J]. GEOMETRIAE DEDICATA, 1993, 46 (02) : 127 - 148
  • [4] Tensor algebra: A combinatorial approach to the projective geometry of figures
    McKinnon, DNR
    Lovell, BC
    [J]. COMBINATORIAL IMAGE ANALYSIS, PROCEEDINGS, 2004, 3322 : 558 - 567
  • [5] A contribution of computer science to the combinatorial approach to hyperbolic geometry
    Margenstern, M
    [J]. 6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL V, PROCEEDINGS: COMPUTER SCI I, 2002, : 423 - 428
  • [6] Mechanization of Incidence Projective Geometry in Higher Dimensions, a Combinatorial Approach
    Schreck, Pascal
    Magaud, Nicolas
    Braun, David
    [J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2021, (352): : 77 - 90
  • [7] COMBINATORIAL COST: A COARSE SETTING
    Kaiser, Tom
    [J]. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2019, 372 (04) : 2855 - 2874
  • [8] Noncommutative coarse geometry
    Banerjee, Tathagata
    Meyer, Ralf
    [J]. JOURNAL OF NONCOMMUTATIVE GEOMETRY, 2019, 13 (03) : 1117 - 1149
  • [9] ON A PROBLEM IN COMBINATORIAL GEOMETRY
    ERDOS, P
    PURDY, G
    STRAUS, EG
    [J]. DISCRETE MATHEMATICS, 1982, 40 (01) : 45 - 52
  • [10] COMBINATORIAL GEOMETRY IN PLANE
    JOHNSON, GP
    [J]. AMERICAN MATHEMATICAL MONTHLY, 1965, 72 (10): : 1154 - &