This paper presents certain definitions, results and problems concerning the problem of representing a finite metric space with integer distances within a graph. Results are derived for the special cases of "regular" metric spaces, very small metric spaces, and for those metric spaces contained by c
On the reduction of the Wallman compactification problem to discrete spaces
β Scribed by A.K. Steiner; E.F. Steiner
- Publisher
- Elsevier Science
- Year
- 1977
- Weight
- 375 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0016-660X
No coin nor oath required. For personal study only.
β¦ Synopsis
If Ras;sd~ff
π SIMILAR VOLUMES
## Introduction. The theory of discrete approximation serves as a framework of approximation and discretization methods for the numerical solution of functional equations. This theory allows a unified functional-analytic treatment of these methods. It was developed by several authors (see e.g. the
## Published in Math. Nach. 186 (1997), 115-129 0 pp. 116 -C. 5: In the statement of Theorem 1.3 (2), we assume that mult,X = d -1. 0 pp. 116 -C. 8: (3) --f (3.1). 0 pp. 125 -C. 22: In (F.2), (2) +(3); (3) + (4). 0 pp. 126 -C. 5: In the statement of Proposition 4.9, we add the case (F.2) -(4)
## Abstract Features related to the discretization of problems characterized by simple periodic tilings using cells of various shapes are discussed. Various cell geometries that tile the plane periodically are considered. Equivalent problems are identified, where the discretization can take place o