Tilings, packings, coverings, and the approximation of functions

被引:1
|
作者
Hinrichs, A
Richter, C [1 ]
机构
[1] Univ Jena, Math Inst, D-07740 Jena, Germany
[2] Univ Paris 06, Equipe Anal, F-75252 Paris 05, France
关键词
tiling; completely saturated packing; completely reduced covering; controllable covering; entropy number; partition of unity; approximation of real-valued functions;
D O I
10.1002/mana.200310151
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A packing (resp. covering) F of a normed space X consisting of unit balls is called completely saturated (resp. completely reduced) if no finite set of its members can be replaced by a more numerous (resp. less numerous) set of unit balls of X without losing the packing property (resp. covering property) of T. We show that a normed space X admits completely saturated packings with disjoint closed unit balls as well as completely reduced coverings with open unit balls, provided that there exists a tiling of X with unit balls. Completely reduced coverings by open balls are of interest in the context of an approximation theory for continuous real-valued functions that rests on so-called controllable coverings of compact metric spaces. The close relation between controllable coverings and completely reduced coverings allows an extension of the approximation theory to non-compact spaces. (C) 2004 WILEY-VCH Verlag GmbH & Co. KGaA. Weinheim.
引用
收藏
页码:37 / 45
页数:9
相关论文
共 50 条
  • [1] Saturated packings and reduced coverings obtained by perturbing tilings
    Hinrichs, Aicke
    Richter, Christian
    [J]. DISCRETE MATHEMATICS, 2009, 309 (16) : 5060 - 5068
  • [2] 3rd Geometry Festival: An International Conference on Packings, Coverings and Tilings
    András Bezdek
    Károly Bezdek
    [J]. Periodica Mathematica Hungarica, 1997, 34 (1-2) : 1 - 1
  • [3] Packings and coverings
    Bambah, RP
    [J]. INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 1999, 30 (10): : 1063 - 1072
  • [4] From tilings to coverings
    Knut W. Urban
    [J]. Nature, 1998, 396 : 14 - 15
  • [5] Approximation algorithms for maximum weight k-coverings of graphs by packings
    Gavril, Fanica
    Shalom, Mordechai
    Zaks, Shmuel
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2022, 14 (01)
  • [6] Weighted coverings and packings
    Cohen, G
    Honkala, I
    Litsyn, SN
    Mattson, HF
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (06) : 1856 - 1867
  • [7] Quasicrystals - From tilings to coverings
    Urban, KW
    [J]. NATURE, 1998, 396 (6706) : 14 - 15
  • [8] Tilings and coverings of quasicrystal surfaces
    McGrath, R
    Ledieu, J
    Cox, EJ
    Diehl, RD
    [J]. COVERINGS OF DISCRETE QUASIPERIODIC SETS: THEORY AND APPLICATIONS TO QUASICRYSTALS, 2003, 180 : 257 - 268
  • [9] Tilings, coverings, clusters and quasicrystals
    Lord, EA
    Ranganathan, S
    Kulkarni, UD
    [J]. CURRENT SCIENCE, 2000, 78 (01): : 64 - 72
  • [10] ON PACKINGS AND COVERINGS OF UNIT DENSITY
    GROEMER, H
    [J]. MATHEMATIKA, 1988, 35 (70) : 172 - 179